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/Problem18_label34_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:52:24,732 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:52:24,736 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:52:24,754 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:52:24,754 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:52:24,756 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:52:24,757 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:52:24,759 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:52:24,762 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:52:24,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:52:24,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:52:24,765 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:52:24,766 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:52:24,767 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:52:24,768 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:52:24,769 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:52:24,770 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:52:24,772 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:52:24,774 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:52:24,776 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:52:24,777 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:52:24,778 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:52:24,780 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:52:24,786 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:52:24,786 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:52:24,789 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:52:24,790 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:52:24,790 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:52:24,791 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:52:24,792 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:52:24,792 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:52:24,796 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:52:24,797 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:52:24,797 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:52:24,798 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:52:24,798 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:52:24,801 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-24 23:52:24,834 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:52:24,834 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:52:24,835 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:52:24,836 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:52:24,836 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:52:24,836 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:52:24,836 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:52:24,837 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:52:24,837 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:52:24,837 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:52:24,837 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:52:24,837 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:52:24,838 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:52:24,838 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:52:24,838 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:52:24,839 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:52:24,840 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:52:24,840 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:52:24,840 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:52:24,840 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:52:24,840 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:52:24,840 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:52:24,842 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:52:24,842 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:52:24,842 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:52:24,843 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:52:24,843 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:52:24,843 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:52:24,843 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:52:24,843 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:52:24,844 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:52:24,844 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:52:24,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:52:24,844 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:52:24,844 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:52:24,845 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:52:24,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:52:24,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:52:24,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:52:24,935 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:52:24,935 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:52:24,936 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label34_false-unreach-call.c [2018-10-24 23:52:25,000 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ae18d5bd1/0e284b57bc054e46904c6aed44d51e79/FLAG76b1e1fa1 [2018-10-24 23:52:25,695 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:52:25,696 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label34_false-unreach-call.c [2018-10-24 23:52:25,725 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ae18d5bd1/0e284b57bc054e46904c6aed44d51e79/FLAG76b1e1fa1 [2018-10-24 23:52:25,747 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ae18d5bd1/0e284b57bc054e46904c6aed44d51e79 [2018-10-24 23:52:25,761 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:52:25,763 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:52:25,764 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:52:25,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:52:25,768 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:52:25,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:25" (1/1) ... [2018-10-24 23:52:25,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9634c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25, skipping insertion in model container [2018-10-24 23:52:25,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:25" (1/1) ... [2018-10-24 23:52:25,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:52:25,928 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:52:27,113 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:52:27,124 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:52:27,549 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:52:27,580 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:52:27,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:27 WrapperNode [2018-10-24 23:52:27,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:52:27,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:52:27,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:52:27,583 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:52:27,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:27" (1/1) ... [2018-10-24 23:52:27,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:27" (1/1) ... [2018-10-24 23:52:28,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:52:28,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:52:28,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:52:28,084 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:52:28,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:27" (1/1) ... [2018-10-24 23:52:28,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:27" (1/1) ... [2018-10-24 23:52:28,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:27" (1/1) ... [2018-10-24 23:52:28,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:27" (1/1) ... [2018-10-24 23:52:28,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:27" (1/1) ... [2018-10-24 23:52:28,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:27" (1/1) ... [2018-10-24 23:52:28,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:27" (1/1) ... [2018-10-24 23:52:28,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:52:28,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:52:28,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:52:28,306 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:52:28,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:27" (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-24 23:52:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:52:28,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:52:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:52:28,388 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:52:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:52:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:52:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:52:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:52:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:52:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:52:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:52:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:52:36,688 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:52:36,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:36 BoogieIcfgContainer [2018-10-24 23:52:36,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:52:36,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:52:36,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:52:36,694 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:52:36,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:52:25" (1/3) ... [2018-10-24 23:52:36,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c19077d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:36, skipping insertion in model container [2018-10-24 23:52:36,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:27" (2/3) ... [2018-10-24 23:52:36,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c19077d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:36, skipping insertion in model container [2018-10-24 23:52:36,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:36" (3/3) ... [2018-10-24 23:52:36,698 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label34_false-unreach-call.c [2018-10-24 23:52:36,708 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:52:36,718 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:52:36,735 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:52:36,781 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:52:36,781 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:52:36,781 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:52:36,781 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:52:36,782 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:52:36,782 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:52:36,782 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:52:36,782 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:52:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-10-24 23:52:36,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-24 23:52:36,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:52:36,831 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:52:36,834 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:52:36,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:52:36,840 INFO L82 PathProgramCache]: Analyzing trace with hash -81823740, now seen corresponding path program 1 times [2018-10-24 23:52:36,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:52:36,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:52:36,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:52:36,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:52:36,892 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:52:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:52:37,166 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-24 23:52:37,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:52:37,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 23:52:37,170 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:52:37,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 23:52:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 23:52:37,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:52:37,198 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 3 states. [2018-10-24 23:52:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:52:43,958 INFO L93 Difference]: Finished difference Result 2251 states and 4322 transitions. [2018-10-24 23:52:43,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 23:52:43,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-24 23:52:43,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:52:44,001 INFO L225 Difference]: With dead ends: 2251 [2018-10-24 23:52:44,001 INFO L226 Difference]: Without dead ends: 1474 [2018-10-24 23:52:44,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 23:52:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2018-10-24 23:52:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2018-10-24 23:52:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-10-24 23:52:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2721 transitions. [2018-10-24 23:52:44,175 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2721 transitions. Word has length 14 [2018-10-24 23:52:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:52:44,175 INFO L481 AbstractCegarLoop]: Abstraction has 1474 states and 2721 transitions. [2018-10-24 23:52:44,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 23:52:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2721 transitions. [2018-10-24 23:52:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-24 23:52:44,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:52:44,183 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:52:44,184 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:52:44,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:52:44,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1421617358, now seen corresponding path program 1 times [2018-10-24 23:52:44,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:52:44,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:52:44,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:52:44,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:52:44,186 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:52:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:52:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:52:44,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:52:44,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:52:44,472 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:52:44,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:52:44,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:52:44,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:52:44,475 INFO L87 Difference]: Start difference. First operand 1474 states and 2721 transitions. Second operand 5 states. [2018-10-24 23:52:52,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:52:52,926 INFO L93 Difference]: Finished difference Result 3698 states and 6787 transitions. [2018-10-24 23:52:52,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:52:52,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-10-24 23:52:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:52:52,944 INFO L225 Difference]: With dead ends: 3698 [2018-10-24 23:52:52,944 INFO L226 Difference]: Without dead ends: 2230 [2018-10-24 23:52:52,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:52:52,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2018-10-24 23:52:53,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2209. [2018-10-24 23:52:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2018-10-24 23:52:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3833 transitions. [2018-10-24 23:52:53,038 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3833 transitions. Word has length 86 [2018-10-24 23:52:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:52:53,038 INFO L481 AbstractCegarLoop]: Abstraction has 2209 states and 3833 transitions. [2018-10-24 23:52:53,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:52:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3833 transitions. [2018-10-24 23:52:53,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-24 23:52:53,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:52:53,048 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:52:53,049 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:52:53,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:52:53,049 INFO L82 PathProgramCache]: Analyzing trace with hash 100869727, now seen corresponding path program 1 times [2018-10-24 23:52:53,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:52:53,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:52:53,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:52:53,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:52:53,051 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:52:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:52:53,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:52:53,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:52:53,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:52:53,375 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:52:53,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:52:53,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:52:53,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:52:53,376 INFO L87 Difference]: Start difference. First operand 2209 states and 3833 transitions. Second operand 6 states. [2018-10-24 23:53:01,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:53:01,013 INFO L93 Difference]: Finished difference Result 5866 states and 10122 transitions. [2018-10-24 23:53:01,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:53:01,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-10-24 23:53:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:53:01,041 INFO L225 Difference]: With dead ends: 5866 [2018-10-24 23:53:01,041 INFO L226 Difference]: Without dead ends: 3663 [2018-10-24 23:53:01,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:53:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3663 states. [2018-10-24 23:53:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3663 to 3639. [2018-10-24 23:53:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2018-10-24 23:53:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 5517 transitions. [2018-10-24 23:53:01,149 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 5517 transitions. Word has length 109 [2018-10-24 23:53:01,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:53:01,150 INFO L481 AbstractCegarLoop]: Abstraction has 3639 states and 5517 transitions. [2018-10-24 23:53:01,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:53:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 5517 transitions. [2018-10-24 23:53:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-24 23:53:01,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:53:01,153 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 23:53:01,153 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:53:01,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1677215465, now seen corresponding path program 1 times [2018-10-24 23:53:01,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:53:01,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:01,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:53:01,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:01,156 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:53:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:53:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:53:01,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:53:01,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:53:01,354 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:53:01,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:53:01,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:53:01,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:53:01,355 INFO L87 Difference]: Start difference. First operand 3639 states and 5517 transitions. Second operand 6 states. [2018-10-24 23:53:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:53:09,670 INFO L93 Difference]: Finished difference Result 8735 states and 13271 transitions. [2018-10-24 23:53:09,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:53:09,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-10-24 23:53:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:53:09,692 INFO L225 Difference]: With dead ends: 8735 [2018-10-24 23:53:09,693 INFO L226 Difference]: Without dead ends: 5102 [2018-10-24 23:53:09,704 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-24 23:53:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2018-10-24 23:53:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 5084. [2018-10-24 23:53:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5084 states. [2018-10-24 23:53:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5084 states to 5084 states and 6940 transitions. [2018-10-24 23:53:09,815 INFO L78 Accepts]: Start accepts. Automaton has 5084 states and 6940 transitions. Word has length 113 [2018-10-24 23:53:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:53:09,816 INFO L481 AbstractCegarLoop]: Abstraction has 5084 states and 6940 transitions. [2018-10-24 23:53:09,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:53:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 5084 states and 6940 transitions. [2018-10-24 23:53:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-24 23:53:09,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:53:09,825 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:53:09,825 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:53:09,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:09,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1672920838, now seen corresponding path program 1 times [2018-10-24 23:53:09,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:53:09,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:09,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:53:09,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:09,828 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:53:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:53:10,160 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:53:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:53:10,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:53:10,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:53:10,291 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:53:10,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:53:10,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:53:10,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:53:10,292 INFO L87 Difference]: Start difference. First operand 5084 states and 6940 transitions. Second operand 6 states. [2018-10-24 23:53:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:53:16,061 INFO L93 Difference]: Finished difference Result 13307 states and 18750 transitions. [2018-10-24 23:53:16,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:53:16,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2018-10-24 23:53:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:53:16,106 INFO L225 Difference]: With dead ends: 13307 [2018-10-24 23:53:16,106 INFO L226 Difference]: Without dead ends: 8229 [2018-10-24 23:53:16,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:53:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2018-10-24 23:53:16,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8128. [2018-10-24 23:53:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8128 states. [2018-10-24 23:53:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8128 states to 8128 states and 10817 transitions. [2018-10-24 23:53:16,292 INFO L78 Accepts]: Start accepts. Automaton has 8128 states and 10817 transitions. Word has length 144 [2018-10-24 23:53:16,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:53:16,292 INFO L481 AbstractCegarLoop]: Abstraction has 8128 states and 10817 transitions. [2018-10-24 23:53:16,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:53:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 8128 states and 10817 transitions. [2018-10-24 23:53:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-24 23:53:16,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:53:16,296 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 23:53:16,297 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:53:16,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:16,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1946011279, now seen corresponding path program 1 times [2018-10-24 23:53:16,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:53:16,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:16,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:53:16,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:53:16,298 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:53:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:53:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 14 proven. 67 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 23:53:16,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:53:16,749 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:53:16,750 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-10-24 23:53:16,752 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1635], [1637], [1640], [1648], [1656], [1664], [1672], [1680], [1688], [1696], [1704], [1712], [1720], [1728], [1736], [1744], [1752], [1760], [1768], [1776], [1784], [1792], [1800], [1808], [1816], [1824], [1832], [1840], [1848], [1856], [1864], [1872], [1880], [1888], [1896], [1904], [1912], [1920], [1928], [1936], [1944], [1952], [1960], [1968], [1976], [1984], [1992], [2000], [2008], [2016], [2024], [2032], [2040], [2048], [2056], [2064], [2072], [2080], [2088], [2096], [2104], [2112], [2117], [2121], [2124], [2125], [2129], [2133], [2137], [2141], [2145], [2149], [2153], [2157], [2161], [2165], [2169], [2173], [2177], [2181], [2185], [2189], [2193], [2197], [2200], [2996], [3000], [3004], [3010], [3014], [3016], [3025], [3026], [3027], [3029], [3030] [2018-10-24 23:53:16,815 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:53:16,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:53:17,343 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:53:17,344 INFO L272 AbstractInterpreter]: Visited 96 different actions 96 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-10-24 23:53:17,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:53:17,365 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:53:17,806 INFO L232 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 77.21% of their original sizes. [2018-10-24 23:53:17,807 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:53:18,055 INFO L413 sIntCurrentIteration]: We have 176 unified AI predicates [2018-10-24 23:53:18,056 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:53:18,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:53:18,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 23:53:18,057 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:53:18,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:53:18,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:53:18,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:53:18,058 INFO L87 Difference]: Start difference. First operand 8128 states and 10817 transitions. Second operand 6 states. [2018-10-24 23:53:22,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:53:22,110 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.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-24 23:53:22,114 INFO L168 Benchmark]: Toolchain (without parser) took 56352.64 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -674.8 MB). Peak memory consumption was 557.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:53:22,116 INFO L168 Benchmark]: CDTParser took 0.19 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-24 23:53:22,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1817.24 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: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:53:22,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 500.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 778.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -950.2 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:53:22,118 INFO L168 Benchmark]: Boogie Preprocessor took 221.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:53:22,119 INFO L168 Benchmark]: RCFGBuilder took 8383.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 489.6 MB). Peak memory consumption was 489.6 MB. Max. memory is 7.1 GB. [2018-10-24 23:53:22,120 INFO L168 Benchmark]: TraceAbstraction took 45422.94 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 454.0 MB). Free memory was 1.7 GB in the beginning and 2.1 GB in the end (delta: -376.9 MB). Peak memory consumption was 77.1 MB. Max. memory is 7.1 GB. [2018-10-24 23:53:22,126 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.19 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 1817.24 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: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 500.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 778.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -950.2 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 221.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8383.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 489.6 MB). Peak memory consumption was 489.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45422.94 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 454.0 MB). Free memory was 1.7 GB in the beginning and 2.1 GB in the end (delta: -376.9 MB). Peak memory consumption was 77.1 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...