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/Problem12_label47_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:39:36,348 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:39:36,353 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:39:36,368 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:39:36,368 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:39:36,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:39:36,373 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:39:36,375 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:39:36,377 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:39:36,378 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:39:36,379 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:39:36,379 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:39:36,380 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:39:36,381 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:39:36,382 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:39:36,383 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:39:36,384 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:39:36,386 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:39:36,388 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:39:36,390 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:39:36,391 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:39:36,392 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:39:36,395 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:39:36,395 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:39:36,395 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:39:36,396 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:39:36,397 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:39:36,398 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:39:36,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:39:36,404 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:39:36,404 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:39:36,405 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:39:36,405 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:39:36,405 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:39:36,406 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:39:36,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:39:36,407 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:39:36,436 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:39:36,437 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:39:36,438 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:39:36,438 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:39:36,438 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:39:36,438 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:39:36,438 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:39:36,439 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:39:36,439 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:39:36,439 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:39:36,439 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:39:36,439 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:39:36,440 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:39:36,440 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:39:36,440 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:39:36,441 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:39:36,441 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:39:36,441 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:39:36,441 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:39:36,441 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:39:36,442 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:39:36,442 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:39:36,442 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:39:36,442 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:39:36,442 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:39:36,443 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:39:36,443 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:39:36,443 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:39:36,443 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:39:36,444 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:39:36,444 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:39:36,444 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:39:36,444 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:39:36,444 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:39:36,445 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:39:36,445 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:39:36,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:39:36,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:39:36,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:39:36,528 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:39:36,529 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:39:36,529 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label47_true-unreach-call.c [2018-10-25 01:39:36,599 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2e26e08ed/9648fd22d22e45a389c59fb3cdf0c5a2/FLAGca9cc8488 [2018-10-25 01:39:37,429 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:39:37,430 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label47_true-unreach-call.c [2018-10-25 01:39:37,461 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2e26e08ed/9648fd22d22e45a389c59fb3cdf0c5a2/FLAGca9cc8488 [2018-10-25 01:39:37,480 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2e26e08ed/9648fd22d22e45a389c59fb3cdf0c5a2 [2018-10-25 01:39:37,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:39:37,496 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:39:37,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:39:37,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:39:37,505 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:39:37,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:39:37" (1/1) ... [2018-10-25 01:39:37,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d08a6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:37, skipping insertion in model container [2018-10-25 01:39:37,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:39:37" (1/1) ... [2018-10-25 01:39:37,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:39:37,690 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:39:39,051 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:39:39,055 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:39:39,696 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:39:39,732 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:39:39,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:39 WrapperNode [2018-10-25 01:39:39,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:39:39,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:39:39,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:39:39,734 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:39:39,746 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:39:39" (1/1) ... [2018-10-25 01:39:39,828 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:39:39" (1/1) ... [2018-10-25 01:39:40,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:39:40,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:39:40,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:39:40,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:39:40,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:39" (1/1) ... [2018-10-25 01:39:40,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:39" (1/1) ... [2018-10-25 01:39:40,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:39" (1/1) ... [2018-10-25 01:39:40,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:39" (1/1) ... [2018-10-25 01:39:40,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:39" (1/1) ... [2018-10-25 01:39:40,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:39" (1/1) ... [2018-10-25 01:39:40,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:39" (1/1) ... [2018-10-25 01:39:40,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:39:40,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:39:40,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:39:40,518 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:39:40,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:39" (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:39:40,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:39:40,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:39:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:39:40,591 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:39:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:39:40,591 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:39:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:39:40,592 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:39:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:39:40,592 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:39:40,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:39:40,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:39:40,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:39:40,594 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:39:51,752 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:39:51,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:39:51 BoogieIcfgContainer [2018-10-25 01:39:51,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:39:51,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:39:51,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:39:51,758 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:39:51,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:39:37" (1/3) ... [2018-10-25 01:39:51,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b9b286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:39:51, skipping insertion in model container [2018-10-25 01:39:51,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:39:39" (2/3) ... [2018-10-25 01:39:51,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b9b286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:39:51, skipping insertion in model container [2018-10-25 01:39:51,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:39:51" (3/3) ... [2018-10-25 01:39:51,762 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label47_true-unreach-call.c [2018-10-25 01:39:51,772 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:39:51,783 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:39:51,801 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:39:51,853 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:39:51,854 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:39:51,854 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:39:51,854 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:39:51,854 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:39:51,854 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:39:51,855 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:39:51,855 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:39:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-25 01:39:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-25 01:39:52,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:39:52,041 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] [2018-10-25 01:39:52,043 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:39:52,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:39:52,062 INFO L82 PathProgramCache]: Analyzing trace with hash 986841587, now seen corresponding path program 1 times [2018-10-25 01:39:52,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:39:52,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:52,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:39:52,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:39:52,116 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:39:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:39:52,626 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:39:52,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:39:52,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:39:52,630 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:39:52,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:39:52,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:39:52,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:39:52,659 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-25 01:40:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:01,724 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-25 01:40:01,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:40:01,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-25 01:40:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:01,780 INFO L225 Difference]: With dead ends: 2446 [2018-10-25 01:40:01,780 INFO L226 Difference]: Without dead ends: 1604 [2018-10-25 01:40:01,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:40:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-25 01:40:01,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-25 01:40:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-25 01:40:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2909 transitions. [2018-10-25 01:40:02,010 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2909 transitions. Word has length 45 [2018-10-25 01:40:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:02,011 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2909 transitions. [2018-10-25 01:40:02,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:40:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2909 transitions. [2018-10-25 01:40:02,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-25 01:40:02,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:02,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:02,019 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:02,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:02,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1872718060, now seen corresponding path program 1 times [2018-10-25 01:40:02,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:02,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:02,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:02,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:02,022 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:02,339 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:40:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:40:02,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:02,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:40:02,375 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:02,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:40:02,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:40:02,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:40:02,378 INFO L87 Difference]: Start difference. First operand 1604 states and 2909 transitions. Second operand 5 states. [2018-10-25 01:40:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:13,212 INFO L93 Difference]: Finished difference Result 4818 states and 8826 transitions. [2018-10-25 01:40:13,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:40:13,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-10-25 01:40:13,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:13,238 INFO L225 Difference]: With dead ends: 4818 [2018-10-25 01:40:13,239 INFO L226 Difference]: Without dead ends: 3220 [2018-10-25 01:40:13,245 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:40:13,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2018-10-25 01:40:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 3186. [2018-10-25 01:40:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2018-10-25 01:40:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 5594 transitions. [2018-10-25 01:40:13,347 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 5594 transitions. Word has length 119 [2018-10-25 01:40:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:13,348 INFO L481 AbstractCegarLoop]: Abstraction has 3186 states and 5594 transitions. [2018-10-25 01:40:13,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:40:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 5594 transitions. [2018-10-25 01:40:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-25 01:40:13,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:13,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:13,352 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:13,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:13,353 INFO L82 PathProgramCache]: Analyzing trace with hash 715820005, now seen corresponding path program 1 times [2018-10-25 01:40:13,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:13,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:13,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:13,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:13,354 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:40:13,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:13,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:40:13,620 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:13,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:40:13,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:40:13,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:40:13,622 INFO L87 Difference]: Start difference. First operand 3186 states and 5594 transitions. Second operand 6 states. [2018-10-25 01:40:28,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:28,445 INFO L93 Difference]: Finished difference Result 11148 states and 19850 transitions. [2018-10-25 01:40:28,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:40:28,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-10-25 01:40:28,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:28,502 INFO L225 Difference]: With dead ends: 11148 [2018-10-25 01:40:28,502 INFO L226 Difference]: Without dead ends: 7968 [2018-10-25 01:40:28,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:40:28,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7968 states. [2018-10-25 01:40:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7968 to 7924. [2018-10-25 01:40:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7924 states. [2018-10-25 01:40:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7924 states to 7924 states and 13424 transitions. [2018-10-25 01:40:28,732 INFO L78 Accepts]: Start accepts. Automaton has 7924 states and 13424 transitions. Word has length 124 [2018-10-25 01:40:28,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:28,732 INFO L481 AbstractCegarLoop]: Abstraction has 7924 states and 13424 transitions. [2018-10-25 01:40:28,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:40:28,733 INFO L276 IsEmpty]: Start isEmpty. Operand 7924 states and 13424 transitions. [2018-10-25 01:40:28,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-25 01:40:28,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:28,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:28,737 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:28,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:28,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1322155659, now seen corresponding path program 1 times [2018-10-25 01:40:28,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:28,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:28,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:28,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:28,739 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:29,016 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:40:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:40:29,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:29,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:40:29,144 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:29,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:40:29,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:40:29,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:40:29,145 INFO L87 Difference]: Start difference. First operand 7924 states and 13424 transitions. Second operand 6 states. [2018-10-25 01:40:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:40:39,304 INFO L93 Difference]: Finished difference Result 22224 states and 38004 transitions. [2018-10-25 01:40:39,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:40:39,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2018-10-25 01:40:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:40:39,376 INFO L225 Difference]: With dead ends: 22224 [2018-10-25 01:40:39,376 INFO L226 Difference]: Without dead ends: 14306 [2018-10-25 01:40:39,411 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-25 01:40:39,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14306 states. [2018-10-25 01:40:39,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14306 to 14219. [2018-10-25 01:40:39,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14219 states. [2018-10-25 01:40:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14219 states to 14219 states and 21550 transitions. [2018-10-25 01:40:39,778 INFO L78 Accepts]: Start accepts. Automaton has 14219 states and 21550 transitions. Word has length 132 [2018-10-25 01:40:39,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:40:39,779 INFO L481 AbstractCegarLoop]: Abstraction has 14219 states and 21550 transitions. [2018-10-25 01:40:39,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:40:39,779 INFO L276 IsEmpty]: Start isEmpty. Operand 14219 states and 21550 transitions. [2018-10-25 01:40:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-25 01:40:39,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:40:39,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:39,785 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:40:39,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:40:39,786 INFO L82 PathProgramCache]: Analyzing trace with hash 822542856, now seen corresponding path program 1 times [2018-10-25 01:40:39,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:40:39,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:39,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:40:39,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:40:39,791 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:40:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:40:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:40:40,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:40:40,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:40:40,218 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:40:40,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:40:40,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:40:40,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:40:40,220 INFO L87 Difference]: Start difference. First operand 14219 states and 21550 transitions. Second operand 6 states. [2018-10-25 01:41:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:04,614 INFO L93 Difference]: Finished difference Result 56457 states and 95976 transitions. [2018-10-25 01:41:04,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-25 01:41:04,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-10-25 01:41:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:04,848 INFO L225 Difference]: With dead ends: 56457 [2018-10-25 01:41:04,849 INFO L226 Difference]: Without dead ends: 42244 [2018-10-25 01:41:04,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-25 01:41:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42244 states. [2018-10-25 01:41:05,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42244 to 42002. [2018-10-25 01:41:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42002 states. [2018-10-25 01:41:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42002 states to 42002 states and 62979 transitions. [2018-10-25 01:41:06,083 INFO L78 Accepts]: Start accepts. Automaton has 42002 states and 62979 transitions. Word has length 149 [2018-10-25 01:41:06,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:06,084 INFO L481 AbstractCegarLoop]: Abstraction has 42002 states and 62979 transitions. [2018-10-25 01:41:06,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:41:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 42002 states and 62979 transitions. [2018-10-25 01:41:06,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-25 01:41:06,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:06,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,090 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:06,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:06,090 INFO L82 PathProgramCache]: Analyzing trace with hash -891765791, now seen corresponding path program 1 times [2018-10-25 01:41:06,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:06,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:06,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:06,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:06,092 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:06,340 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:41:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:41:06,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:41:06,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:41:06,775 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:06,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:41:06,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:41:06,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:41:06,777 INFO L87 Difference]: Start difference. First operand 42002 states and 62979 transitions. Second operand 6 states. [2018-10-25 01:41:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:41:19,955 INFO L93 Difference]: Finished difference Result 104623 states and 165912 transitions. [2018-10-25 01:41:19,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:41:19,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-10-25 01:41:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:41:20,203 INFO L225 Difference]: With dead ends: 104623 [2018-10-25 01:41:20,204 INFO L226 Difference]: Without dead ends: 62627 [2018-10-25 01:41:20,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:41:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62627 states. [2018-10-25 01:41:21,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62627 to 62377. [2018-10-25 01:41:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62377 states. [2018-10-25 01:41:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62377 states to 62377 states and 87791 transitions. [2018-10-25 01:41:22,042 INFO L78 Accepts]: Start accepts. Automaton has 62377 states and 87791 transitions. Word has length 170 [2018-10-25 01:41:22,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:41:22,043 INFO L481 AbstractCegarLoop]: Abstraction has 62377 states and 87791 transitions. [2018-10-25 01:41:22,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:41:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 62377 states and 87791 transitions. [2018-10-25 01:41:22,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-25 01:41:22,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:41:22,054 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 01:41:22,054 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:41:22,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:22,054 INFO L82 PathProgramCache]: Analyzing trace with hash -707609888, now seen corresponding path program 1 times [2018-10-25 01:41:22,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:41:22,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:22,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:41:22,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:41:22,056 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:41:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:41:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 76 proven. 74 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:41:22,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:41:22,456 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:41:22,457 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-10-25 01:41:22,461 INFO L202 CegarAbsIntRunner]: [0], [1], [1868], [1875], [1883], [1891], [1899], [1907], [1915], [1923], [1931], [1939], [1947], [1955], [1963], [1971], [1979], [1987], [1995], [2003], [2011], [2019], [2027], [2035], [2043], [2051], [2059], [2067], [2075], [2083], [2091], [2099], [2107], [2115], [2123], [2127], [2129], [2132], [2140], [2148], [2156], [2164], [2172], [2180], [2188], [2196], [2204], [2212], [2220], [2228], [2236], [2244], [2252], [2260], [2268], [2276], [2284], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2385], [2389], [2393], [2396], [2397], [2400], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:41:22,545 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:41:22,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:41:23,282 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:41:23,284 INFO L272 AbstractInterpreter]: Visited 85 different actions 85 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:41:23,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:41:23,333 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:41:24,147 INFO L232 lantSequenceWeakener]: Weakened 195 states. On average, predicates are now at 75.54% of their original sizes. [2018-10-25 01:41:24,147 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:41:24,406 INFO L413 sIntCurrentIteration]: We have 203 unified AI predicates [2018-10-25 01:41:24,407 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:41:24,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:41:24,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-25 01:41:24,408 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:41:24,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:41:24,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:41:24,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:41:24,409 INFO L87 Difference]: Start difference. First operand 62377 states and 87791 transitions. Second operand 6 states. [2018-10-25 01:41:29,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:41:29,945 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 01:41:29,954 INFO L168 Benchmark]: Toolchain (without parser) took 112460.37 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 1.5 GB in the end (delta: -79.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-10-25 01:41:29,956 INFO L168 Benchmark]: CDTParser took 0.22 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:41:29,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2232.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:29,958 INFO L168 Benchmark]: Boogie Procedure Inliner took 537.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.0 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:29,960 INFO L168 Benchmark]: Boogie Preprocessor took 245.21 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.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:29,961 INFO L168 Benchmark]: RCFGBuilder took 11235.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.5 GB in the end (delta: 650.5 MB). Peak memory consumption was 650.5 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:29,961 INFO L168 Benchmark]: TraceAbstraction took 98199.21 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 952.6 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 37.2 MB). Peak memory consumption was 989.8 MB. Max. memory is 7.1 GB. [2018-10-25 01:41:29,968 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2232.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Peak memory consumption was 200.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 537.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 766.0 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 245.21 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.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11235.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.5 GB in the end (delta: 650.5 MB). Peak memory consumption was 650.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98199.21 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 952.6 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 37.2 MB). Peak memory consumption was 989.8 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...