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_label05_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:41:02,119 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:41:02,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:41:02,134 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:41:02,134 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:41:02,135 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:41:02,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:41:02,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:41:02,140 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:41:02,141 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:41:02,142 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:41:02,142 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:41:02,143 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:41:02,144 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:41:02,145 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:41:02,146 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:41:02,146 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:41:02,148 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:41:02,150 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:41:02,152 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:41:02,153 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:41:02,155 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:41:02,157 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:41:02,158 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:41:02,158 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:41:02,159 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:41:02,160 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:41:02,161 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:41:02,162 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:41:02,163 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:41:02,163 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:41:02,164 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:41:02,164 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:41:02,164 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:41:02,165 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:41:02,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:41:02,167 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:41:02,183 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:41:02,183 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:41:02,184 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:41:02,184 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:41:02,184 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:41:02,185 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:41:02,185 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:41:02,185 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:41:02,185 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:41:02,186 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:41:02,186 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:41:02,186 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:41:02,186 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:41:02,187 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:41:02,187 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:41:02,188 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:41:02,188 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:41:02,188 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:41:02,188 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:41:02,188 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:41:02,189 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:41:02,189 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:41:02,189 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:41:02,189 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:41:02,189 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:41:02,190 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:41:02,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:41:02,190 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:41:02,190 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:41:02,190 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:41:02,191 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:41:02,191 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:41:02,191 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:41:02,191 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:41:02,191 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:41:02,192 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:41:02,234 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:41:02,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:41:02,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:41:02,256 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:41:02,256 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:41:02,257 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label05_true-unreach-call.c [2018-10-25 01:41:02,319 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/08fc682a0/97e10af10c954a6788919aed61a202d7/FLAGc6fcb7b31 [2018-10-25 01:41:03,135 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:41:03,136 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label05_true-unreach-call.c [2018-10-25 01:41:03,167 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/08fc682a0/97e10af10c954a6788919aed61a202d7/FLAGc6fcb7b31 [2018-10-25 01:41:03,184 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/08fc682a0/97e10af10c954a6788919aed61a202d7 [2018-10-25 01:41:03,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:41:03,198 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:41:03,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:41:03,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:41:03,204 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:41:03,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:41:03" (1/1) ... [2018-10-25 01:41:03,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce3d116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:03, skipping insertion in model container [2018-10-25 01:41:03,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:41:03" (1/1) ... [2018-10-25 01:41:03,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:41:03,379 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:41:04,892 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:41:04,896 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:41:05,679 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:41:05,716 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:41:05,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:05 WrapperNode [2018-10-25 01:41:05,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:41:05,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:41:05,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:41:05,719 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:41:05,729 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:41:05" (1/1) ... [2018-10-25 01:41:05,815 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:41:05" (1/1) ... [2018-10-25 01:41:06,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:41:06,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:41:06,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:41:06,321 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:41:06,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:05" (1/1) ... [2018-10-25 01:41:06,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:05" (1/1) ... [2018-10-25 01:41:06,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:05" (1/1) ... [2018-10-25 01:41:06,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:05" (1/1) ... [2018-10-25 01:41:06,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:05" (1/1) ... [2018-10-25 01:41:06,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:05" (1/1) ... [2018-10-25 01:41:06,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:05" (1/1) ... [2018-10-25 01:41:06,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:41:06,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:41:06,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:41:06,645 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:41:06,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:05" (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:41:06,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:41:06,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:41:06,722 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:41:06,722 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:41:06,722 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:41:06,722 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:41:06,723 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:41:06,725 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:41:06,725 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:41:06,726 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:41:06,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:41:06,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:41:06,726 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:41:06,728 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:41:18,679 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:41:18,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:41:18 BoogieIcfgContainer [2018-10-25 01:41:18,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:41:18,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:41:18,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:41:18,684 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:41:18,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:41:03" (1/3) ... [2018-10-25 01:41:18,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638a8962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:41:18, skipping insertion in model container [2018-10-25 01:41:18,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:41:05" (2/3) ... [2018-10-25 01:41:18,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638a8962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:41:18, skipping insertion in model container [2018-10-25 01:41:18,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:41:18" (3/3) ... [2018-10-25 01:41:18,687 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label05_true-unreach-call.c [2018-10-25 01:41:18,698 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:41:18,713 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:41:18,731 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:41:18,794 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:41:18,795 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:41:18,795 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:41:18,795 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:41:18,795 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:41:18,795 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:41:18,795 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:41:18,796 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:41:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-25 01:41:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-25 01:41:18,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:18,854 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] [2018-10-25 01:41:18,860 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:18,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:18,871 INFO L82 PathProgramCache]: Analyzing trace with hash -192700485, now seen corresponding path program 1 times [2018-10-25 01:41:18,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:18,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:18,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:18,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:18,927 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:19,359 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:41:19,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:19,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:41:19,366 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:19,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:41:19,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:41:19,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:41:19,421 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-10-25 01:41:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:33,132 INFO L93 Difference]: Finished difference Result 3968 states and 7392 transitions. [2018-10-25 01:41:33,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:41:33,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-10-25 01:41:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:33,200 INFO L225 Difference]: With dead ends: 3968 [2018-10-25 01:41:33,200 INFO L226 Difference]: Without dead ends: 2842 [2018-10-25 01:41:33,217 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:41:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2018-10-25 01:41:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1981. [2018-10-25 01:41:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2018-10-25 01:41:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 3456 transitions. [2018-10-25 01:41:33,412 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 3456 transitions. Word has length 49 [2018-10-25 01:41:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:33,413 INFO L481 AbstractCegarLoop]: Abstraction has 1981 states and 3456 transitions. [2018-10-25 01:41:33,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:41:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 3456 transitions. [2018-10-25 01:41:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-25 01:41:33,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:33,424 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:33,424 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:33,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:33,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1544921282, now seen corresponding path program 1 times [2018-10-25 01:41:33,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:33,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:33,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:33,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:33,427 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:33,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:33,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:41:33,791 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:33,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:41:33,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:41:33,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:41:33,793 INFO L87 Difference]: Start difference. First operand 1981 states and 3456 transitions. Second operand 5 states. [2018-10-25 01:41:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:50,525 INFO L93 Difference]: Finished difference Result 5673 states and 10081 transitions. [2018-10-25 01:41:50,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:41:50,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-10-25 01:41:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:50,557 INFO L225 Difference]: With dead ends: 5673 [2018-10-25 01:41:50,558 INFO L226 Difference]: Without dead ends: 3698 [2018-10-25 01:41:50,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:41:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2018-10-25 01:41:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3687. [2018-10-25 01:41:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3687 states. [2018-10-25 01:41:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 5870 transitions. [2018-10-25 01:41:50,680 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 5870 transitions. Word has length 119 [2018-10-25 01:41:50,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:50,680 INFO L481 AbstractCegarLoop]: Abstraction has 3687 states and 5870 transitions. [2018-10-25 01:41:50,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:41:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 5870 transitions. [2018-10-25 01:41:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-25 01:41:50,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:50,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:50,691 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:50,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:50,692 INFO L82 PathProgramCache]: Analyzing trace with hash 745803618, now seen corresponding path program 1 times [2018-10-25 01:41:50,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:50,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:50,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:50,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:50,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:50,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:50,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:41:50,932 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:50,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:41:50,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:41:50,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:41:50,934 INFO L87 Difference]: Start difference. First operand 3687 states and 5870 transitions. Second operand 5 states. [2018-10-25 01:42:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:04,873 INFO L93 Difference]: Finished difference Result 10963 states and 17865 transitions. [2018-10-25 01:42:04,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 01:42:04,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-10-25 01:42:04,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:04,925 INFO L225 Difference]: With dead ends: 10963 [2018-10-25 01:42:04,925 INFO L226 Difference]: Without dead ends: 7282 [2018-10-25 01:42:04,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 01:42:04,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7282 states. [2018-10-25 01:42:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7282 to 7175. [2018-10-25 01:42:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7175 states. [2018-10-25 01:42:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7175 states to 7175 states and 10520 transitions. [2018-10-25 01:42:05,141 INFO L78 Accepts]: Start accepts. Automaton has 7175 states and 10520 transitions. Word has length 121 [2018-10-25 01:42:05,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:05,141 INFO L481 AbstractCegarLoop]: Abstraction has 7175 states and 10520 transitions. [2018-10-25 01:42:05,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:42:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 10520 transitions. [2018-10-25 01:42:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-25 01:42:05,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:05,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:05,149 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:05,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:05,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2075646886, now seen corresponding path program 1 times [2018-10-25 01:42:05,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:05,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:05,151 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:05,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:05,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 01:42:05,460 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:05,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 01:42:05,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 01:42:05,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:42:05,461 INFO L87 Difference]: Start difference. First operand 7175 states and 10520 transitions. Second operand 4 states. [2018-10-25 01:42:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:15,052 INFO L93 Difference]: Finished difference Result 27675 states and 43299 transitions. [2018-10-25 01:42:15,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 01:42:15,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-10-25 01:42:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:15,166 INFO L225 Difference]: With dead ends: 27675 [2018-10-25 01:42:15,166 INFO L226 Difference]: Without dead ends: 20506 [2018-10-25 01:42:15,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 01:42:15,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20506 states. [2018-10-25 01:42:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20506 to 20467. [2018-10-25 01:42:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20467 states. [2018-10-25 01:42:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20467 states to 20467 states and 29131 transitions. [2018-10-25 01:42:15,760 INFO L78 Accepts]: Start accepts. Automaton has 20467 states and 29131 transitions. Word has length 165 [2018-10-25 01:42:15,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:15,760 INFO L481 AbstractCegarLoop]: Abstraction has 20467 states and 29131 transitions. [2018-10-25 01:42:15,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 01:42:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 20467 states and 29131 transitions. [2018-10-25 01:42:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-25 01:42:15,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:15,766 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:15,766 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:15,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:15,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1150006652, now seen corresponding path program 1 times [2018-10-25 01:42:15,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:15,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:15,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:15,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:15,772 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:16,077 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:42:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:42:16,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:42:16,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:42:16,144 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:42:16,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:42:16,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:42:16,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:42:16,146 INFO L87 Difference]: Start difference. First operand 20467 states and 29131 transitions. Second operand 3 states. [2018-10-25 01:42:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:42:26,829 INFO L93 Difference]: Finished difference Result 58971 states and 88554 transitions. [2018-10-25 01:42:26,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:42:26,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2018-10-25 01:42:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:42:26,998 INFO L225 Difference]: With dead ends: 58971 [2018-10-25 01:42:26,998 INFO L226 Difference]: Without dead ends: 38510 [2018-10-25 01:42:27,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:42:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38510 states. [2018-10-25 01:42:27,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38510 to 38503. [2018-10-25 01:42:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38503 states. [2018-10-25 01:42:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38503 states to 38503 states and 54012 transitions. [2018-10-25 01:42:28,006 INFO L78 Accepts]: Start accepts. Automaton has 38503 states and 54012 transitions. Word has length 170 [2018-10-25 01:42:28,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:42:28,007 INFO L481 AbstractCegarLoop]: Abstraction has 38503 states and 54012 transitions. [2018-10-25 01:42:28,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:42:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 38503 states and 54012 transitions. [2018-10-25 01:42:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-10-25 01:42:28,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:42:28,051 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:42:28,052 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:42:28,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:42:28,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1475529496, now seen corresponding path program 1 times [2018-10-25 01:42:28,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:42:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:28,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:42:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:42:28,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:42:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:42:28,547 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:42:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 85 proven. 23 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-10-25 01:42:29,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:42:29,161 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:42:29,163 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 394 with the following transitions: [2018-10-25 01:42:29,165 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], [2919], [2921], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [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], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3409], [3410], [3414], [3425], [3429], [3440], [3451], [3455], [3459], [3463], [3467], [3471], [3475], [3479], [3483], [3487], [3498], [3502], [3506], [3517], [3521], [3525], [3529], [3533], [3537], [3541], [3545], [3556], [3560], [3564], [3568], [3572], [3576], [3580], [3591], [3595], [3599], [3603], [3614], [3618], [3622], [3626], [3630], [3634], [3638], [3642], [3646], [3650], [3654], [3658], [3662], [3666], [3670], [3674], [3678], [3682], [3686], [3690], [3694], [3698], [3709], [3713], [3717], [3721], [3725], [3729], [3733], [3737], [3741], [3745], [3749], [3753], [3757], [3768], [3772], [3776], [3780], [3784], [3788], [3792], [3796], [3800], [3804], [3807], [3812], [3814], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-25 01:42:29,250 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:42:29,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:42:29,930 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.ArithmeticException: BigInteger: modulus not positive at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) 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) Caused by: 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.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-10-25 01:42:29,938 INFO L168 Benchmark]: Toolchain (without parser) took 86741.92 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -148.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-25 01:42:29,940 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 01:42:29,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2518.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:29,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 601.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.3 MB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.0 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:29,944 INFO L168 Benchmark]: Boogie Preprocessor took 323.63 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:42:29,945 INFO L168 Benchmark]: RCFGBuilder took 12035.43 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 188.7 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 11.5 MB). Peak memory consumption was 668.4 MB. Max. memory is 7.1 GB. [2018-10-25 01:42:29,946 INFO L168 Benchmark]: TraceAbstraction took 71257.00 ms. Allocated memory was 2.5 GB in the beginning and 3.0 GB in the end (delta: 520.6 MB). Free memory was 2.2 GB in the beginning and 1.5 GB in the end (delta: 638.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-25 01:42:29,958 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2518.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 601.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.3 MB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 73.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 323.63 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 12035.43 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 188.7 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 11.5 MB). Peak memory consumption was 668.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71257.00 ms. Allocated memory was 2.5 GB in the beginning and 3.0 GB in the end (delta: 520.6 MB). Free memory was 2.2 GB in the beginning and 1.5 GB in the end (delta: 638.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.ArithmeticException: BigInteger: modulus not positive: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...