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_label51_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 23:36:48,047 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 23:36:48,049 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 23:36:48,062 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 23:36:48,063 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 23:36:48,065 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 23:36:48,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 23:36:48,069 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 23:36:48,072 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 23:36:48,073 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 23:36:48,075 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 23:36:48,075 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 23:36:48,076 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 23:36:48,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 23:36:48,079 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 23:36:48,089 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 23:36:48,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 23:36:48,094 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 23:36:48,096 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 23:36:48,098 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 23:36:48,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 23:36:48,100 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 23:36:48,104 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 23:36:48,104 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 23:36:48,104 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 23:36:48,107 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 23:36:48,109 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 23:36:48,113 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 23:36:48,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 23:36:48,117 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 23:36:48,117 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 23:36:48,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 23:36:48,120 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 23:36:48,120 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 23:36:48,121 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 23:36:48,122 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 23:36:48,122 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:36:48,152 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 23:36:48,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 23:36:48,153 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 23:36:48,153 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 23:36:48,154 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 23:36:48,154 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 23:36:48,154 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 23:36:48,154 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 23:36:48,154 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 23:36:48,155 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 23:36:48,155 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 23:36:48,155 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 23:36:48,155 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 23:36:48,156 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 23:36:48,160 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 23:36:48,160 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 23:36:48,160 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 23:36:48,162 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 23:36:48,162 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 23:36:48,163 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 23:36:48,163 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 23:36:48,163 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 23:36:48,163 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 23:36:48,163 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 23:36:48,164 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 23:36:48,164 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 23:36:48,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 23:36:48,165 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 23:36:48,165 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 23:36:48,165 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 23:36:48,165 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 23:36:48,165 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 23:36:48,166 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 23:36:48,166 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 23:36:48,166 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 23:36:48,166 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 23:36:48,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 23:36:48,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 23:36:48,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 23:36:48,255 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 23:36:48,256 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 23:36:48,256 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label51_false-unreach-call.c [2018-10-24 23:36:48,332 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5943be058/019f8117e1e44695ad7829d768db73bd/FLAG50d6047a8 [2018-10-24 23:36:49,139 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 23:36:49,140 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label51_false-unreach-call.c [2018-10-24 23:36:49,182 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5943be058/019f8117e1e44695ad7829d768db73bd/FLAG50d6047a8 [2018-10-24 23:36:49,203 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/5943be058/019f8117e1e44695ad7829d768db73bd [2018-10-24 23:36:49,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 23:36:49,219 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 23:36:49,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 23:36:49,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 23:36:49,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 23:36:49,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:36:49" (1/1) ... [2018-10-24 23:36:49,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a79e33f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:49, skipping insertion in model container [2018-10-24 23:36:49,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:36:49" (1/1) ... [2018-10-24 23:36:49,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 23:36:49,406 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 23:36:51,022 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:36:51,027 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 23:36:51,809 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 23:36:51,852 INFO L193 MainTranslator]: Completed translation [2018-10-24 23:36:51,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:51 WrapperNode [2018-10-24 23:36:51,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 23:36:51,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 23:36:51,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 23:36:51,856 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 23:36:51,867 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:36:51" (1/1) ... [2018-10-24 23:36:51,947 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:36:51" (1/1) ... [2018-10-24 23:36:52,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 23:36:52,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 23:36:52,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 23:36:52,462 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 23:36:52,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:51" (1/1) ... [2018-10-24 23:36:52,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:51" (1/1) ... [2018-10-24 23:36:52,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:51" (1/1) ... [2018-10-24 23:36:52,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:51" (1/1) ... [2018-10-24 23:36:52,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:51" (1/1) ... [2018-10-24 23:36:52,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:51" (1/1) ... [2018-10-24 23:36:52,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:51" (1/1) ... [2018-10-24 23:36:52,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 23:36:52,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 23:36:52,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 23:36:52,780 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 23:36:52,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:51" (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:36:52,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 23:36:52,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 23:36:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-24 23:36:52,853 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-24 23:36:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-24 23:36:52,853 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-24 23:36:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-24 23:36:52,853 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-24 23:36:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 23:36:52,854 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 23:36:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 23:36:52,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 23:36:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 23:36:52,855 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 23:37:04,367 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 23:37:04,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:37:04 BoogieIcfgContainer [2018-10-24 23:37:04,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 23:37:04,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 23:37:04,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 23:37:04,372 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 23:37:04,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:36:49" (1/3) ... [2018-10-24 23:37:04,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd2658d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:37:04, skipping insertion in model container [2018-10-24 23:37:04,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:36:51" (2/3) ... [2018-10-24 23:37:04,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd2658d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:37:04, skipping insertion in model container [2018-10-24 23:37:04,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:37:04" (3/3) ... [2018-10-24 23:37:04,376 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label51_false-unreach-call.c [2018-10-24 23:37:04,386 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 23:37:04,395 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 23:37:04,413 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 23:37:04,460 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 23:37:04,461 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 23:37:04,461 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 23:37:04,461 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 23:37:04,461 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 23:37:04,461 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 23:37:04,461 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 23:37:04,462 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 23:37:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-10-24 23:37:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-24 23:37:04,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:04,525 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] [2018-10-24 23:37:04,528 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:04,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:04,537 INFO L82 PathProgramCache]: Analyzing trace with hash -81716397, now seen corresponding path program 1 times [2018-10-24 23:37:04,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:04,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:04,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:04,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:04,597 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:04,986 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-10-24 23:37:04,994 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:37:04,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:04,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:37:05,000 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:05,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:37:05,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:37:05,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:37:05,027 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 4 states. [2018-10-24 23:37:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:20,347 INFO L93 Difference]: Finished difference Result 4065 states and 7606 transitions. [2018-10-24 23:37:20,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:37:20,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-10-24 23:37:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:20,431 INFO L225 Difference]: With dead ends: 4065 [2018-10-24 23:37:20,433 INFO L226 Difference]: Without dead ends: 2939 [2018-10-24 23:37:20,453 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-24 23:37:20,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2018-10-24 23:37:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1972. [2018-10-24 23:37:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1972 states. [2018-10-24 23:37:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 3594 transitions. [2018-10-24 23:37:20,640 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 3594 transitions. Word has length 31 [2018-10-24 23:37:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:20,640 INFO L481 AbstractCegarLoop]: Abstraction has 1972 states and 3594 transitions. [2018-10-24 23:37:20,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:37:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 3594 transitions. [2018-10-24 23:37:20,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-24 23:37:20,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:20,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:20,652 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:20,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:20,653 INFO L82 PathProgramCache]: Analyzing trace with hash 2132538579, now seen corresponding path program 1 times [2018-10-24 23:37:20,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:20,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:20,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:20,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:20,654 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:37:21,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:21,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 23:37:21,080 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:21,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:37:21,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:37:21,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:37:21,082 INFO L87 Difference]: Start difference. First operand 1972 states and 3594 transitions. Second operand 6 states. [2018-10-24 23:37:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:36,854 INFO L93 Difference]: Finished difference Result 7229 states and 13602 transitions. [2018-10-24 23:37:36,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 23:37:36,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-10-24 23:37:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:36,888 INFO L225 Difference]: With dead ends: 7229 [2018-10-24 23:37:36,889 INFO L226 Difference]: Without dead ends: 5263 [2018-10-24 23:37:36,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 23:37:36,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2018-10-24 23:37:37,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5234. [2018-10-24 23:37:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5234 states. [2018-10-24 23:37:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 8445 transitions. [2018-10-24 23:37:37,193 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 8445 transitions. Word has length 104 [2018-10-24 23:37:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:37,194 INFO L481 AbstractCegarLoop]: Abstraction has 5234 states and 8445 transitions. [2018-10-24 23:37:37,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 23:37:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 8445 transitions. [2018-10-24 23:37:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-24 23:37:37,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:37,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:37,212 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:37,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:37,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1105327350, now seen corresponding path program 1 times [2018-10-24 23:37:37,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:37,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:37,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:37,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:37,218 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:37:37,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:37,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:37:37,574 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:37,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:37:37,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:37:37,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:37:37,577 INFO L87 Difference]: Start difference. First operand 5234 states and 8445 transitions. Second operand 5 states. [2018-10-24 23:37:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:37:55,575 INFO L93 Difference]: Finished difference Result 15741 states and 26186 transitions. [2018-10-24 23:37:55,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:37:55,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-10-24 23:37:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:37:55,634 INFO L225 Difference]: With dead ends: 15741 [2018-10-24 23:37:55,635 INFO L226 Difference]: Without dead ends: 10513 [2018-10-24 23:37:55,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-24 23:37:55,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10513 states. [2018-10-24 23:37:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10513 to 10309. [2018-10-24 23:37:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10309 states. [2018-10-24 23:37:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10309 states to 10309 states and 15531 transitions. [2018-10-24 23:37:55,967 INFO L78 Accepts]: Start accepts. Automaton has 10309 states and 15531 transitions. Word has length 133 [2018-10-24 23:37:55,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:37:55,968 INFO L481 AbstractCegarLoop]: Abstraction has 10309 states and 15531 transitions. [2018-10-24 23:37:55,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:37:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 10309 states and 15531 transitions. [2018-10-24 23:37:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-24 23:37:55,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:37:55,978 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:55,979 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:37:55,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:37:55,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1620702082, now seen corresponding path program 1 times [2018-10-24 23:37:55,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:37:55,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:55,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:37:55,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:37:55,981 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:37:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:37:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:37:56,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:37:56,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 23:37:56,297 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:37:56,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 23:37:56,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 23:37:56,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 23:37:56,298 INFO L87 Difference]: Start difference. First operand 10309 states and 15531 transitions. Second operand 5 states. [2018-10-24 23:38:32,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:32,969 INFO L93 Difference]: Finished difference Result 32117 states and 50259 transitions. [2018-10-24 23:38:32,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 23:38:32,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2018-10-24 23:38:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:33,072 INFO L225 Difference]: With dead ends: 32117 [2018-10-24 23:38:33,073 INFO L226 Difference]: Without dead ends: 21814 [2018-10-24 23:38:33,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 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:38:33,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21814 states. [2018-10-24 23:38:33,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21814 to 21590. [2018-10-24 23:38:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21590 states. [2018-10-24 23:38:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21590 states to 21590 states and 31809 transitions. [2018-10-24 23:38:33,649 INFO L78 Accepts]: Start accepts. Automaton has 21590 states and 31809 transitions. Word has length 137 [2018-10-24 23:38:33,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:33,650 INFO L481 AbstractCegarLoop]: Abstraction has 21590 states and 31809 transitions. [2018-10-24 23:38:33,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 23:38:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 21590 states and 31809 transitions. [2018-10-24 23:38:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-24 23:38:33,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:33,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:33,654 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:33,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:33,654 INFO L82 PathProgramCache]: Analyzing trace with hash 819768018, now seen corresponding path program 1 times [2018-10-24 23:38:33,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:33,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:33,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:33,659 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 23:38:33,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 23:38:33,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 23:38:33,903 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:33,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 23:38:33,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 23:38:33,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 23:38:33,906 INFO L87 Difference]: Start difference. First operand 21590 states and 31809 transitions. Second operand 4 states. [2018-10-24 23:38:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 23:38:44,616 INFO L93 Difference]: Finished difference Result 82882 states and 132360 transitions. [2018-10-24 23:38:44,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 23:38:44,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-10-24 23:38:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 23:38:44,860 INFO L225 Difference]: With dead ends: 82882 [2018-10-24 23:38:44,861 INFO L226 Difference]: Without dead ends: 61298 [2018-10-24 23:38:44,969 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-24 23:38:45,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61298 states. [2018-10-24 23:38:46,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61298 to 61227. [2018-10-24 23:38:46,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61227 states. [2018-10-24 23:38:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61227 states to 61227 states and 89048 transitions. [2018-10-24 23:38:46,367 INFO L78 Accepts]: Start accepts. Automaton has 61227 states and 89048 transitions. Word has length 147 [2018-10-24 23:38:46,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 23:38:46,368 INFO L481 AbstractCegarLoop]: Abstraction has 61227 states and 89048 transitions. [2018-10-24 23:38:46,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 23:38:46,368 INFO L276 IsEmpty]: Start isEmpty. Operand 61227 states and 89048 transitions. [2018-10-24 23:38:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-24 23:38:46,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 23:38:46,389 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 23:38:46,389 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 23:38:46,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:46,390 INFO L82 PathProgramCache]: Analyzing trace with hash -643006826, now seen corresponding path program 1 times [2018-10-24 23:38:46,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 23:38:46,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:46,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 23:38:46,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 23:38:46,391 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 23:38:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 23:38:46,711 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 23:38:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 48 proven. 102 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 23:38:47,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 23:38:47,123 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 23:38:47,125 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 258 with the following transitions: [2018-10-24 23:38:47,129 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2775], [2777], [2780], [2788], [2796], [2804], [2812], [2820], [2828], [2836], [2844], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [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], [3289], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3336], [3341], [3343], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-10-24 23:38:47,215 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 23:38:47,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 23:38:47,774 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 23:38:47,776 INFO L272 AbstractInterpreter]: Visited 122 different actions 122 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-24 23:38:47,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 23:38:47,821 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 23:38:48,939 INFO L232 lantSequenceWeakener]: Weakened 246 states. On average, predicates are now at 70.95% of their original sizes. [2018-10-24 23:38:48,941 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 23:38:49,204 INFO L413 sIntCurrentIteration]: We have 256 unified AI predicates [2018-10-24 23:38:49,204 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 23:38:49,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 23:38:49,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-24 23:38:49,206 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 23:38:49,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 23:38:49,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 23:38:49,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 23:38:49,208 INFO L87 Difference]: Start difference. First operand 61227 states and 89048 transitions. Second operand 6 states. [2018-10-24 23:38:54,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 23:38:54,577 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-24 23:38:54,595 INFO L168 Benchmark]: Toolchain (without parser) took 125374.86 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 521.8 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:54,597 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:38:54,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2633.97 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:54,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 606.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 795.9 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.2 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:54,602 INFO L168 Benchmark]: Boogie Preprocessor took 317.95 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: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:54,605 INFO L168 Benchmark]: RCFGBuilder took 11588.65 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 210.2 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -11.7 MB). Peak memory consumption was 680.9 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:54,606 INFO L168 Benchmark]: TraceAbstraction took 110221.87 ms. Allocated memory was 2.5 GB in the beginning and 3.2 GB in the end (delta: 708.3 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -404.3 MB). Peak memory consumption was 304.0 MB. Max. memory is 7.1 GB. [2018-10-24 23:38:54,618 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 2633.97 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: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 606.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 795.9 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.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 317.95 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: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11588.65 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 210.2 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -11.7 MB). Peak memory consumption was 680.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 110221.87 ms. Allocated memory was 2.5 GB in the beginning and 3.2 GB in the end (delta: 708.3 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -404.3 MB). Peak memory consumption was 304.0 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...