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_label12_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 01:37:12,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 01:37:12,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 01:37:12,381 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 01:37:12,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 01:37:12,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 01:37:12,385 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 01:37:12,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 01:37:12,389 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 01:37:12,390 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 01:37:12,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 01:37:12,391 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 01:37:12,392 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 01:37:12,393 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 01:37:12,394 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 01:37:12,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 01:37:12,396 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 01:37:12,398 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 01:37:12,400 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 01:37:12,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 01:37:12,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 01:37:12,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 01:37:12,407 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 01:37:12,407 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 01:37:12,408 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 01:37:12,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 01:37:12,410 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 01:37:12,411 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 01:37:12,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 01:37:12,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 01:37:12,413 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 01:37:12,414 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 01:37:12,414 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 01:37:12,415 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 01:37:12,416 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 01:37:12,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 01:37:12,417 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:37:12,434 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 01:37:12,434 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 01:37:12,435 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 01:37:12,435 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 01:37:12,435 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 01:37:12,436 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 01:37:12,436 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 01:37:12,436 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 01:37:12,436 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 01:37:12,437 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 01:37:12,437 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 01:37:12,437 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 01:37:12,437 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 01:37:12,437 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 01:37:12,438 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 01:37:12,438 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 01:37:12,439 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 01:37:12,439 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 01:37:12,439 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 01:37:12,439 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 01:37:12,439 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 01:37:12,440 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 01:37:12,440 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 01:37:12,440 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 01:37:12,440 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 01:37:12,441 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 01:37:12,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 01:37:12,441 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 01:37:12,441 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 01:37:12,442 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 01:37:12,442 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 01:37:12,442 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 01:37:12,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 01:37:12,442 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 01:37:12,443 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 01:37:12,443 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 01:37:12,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 01:37:12,513 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 01:37:12,517 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 01:37:12,518 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 01:37:12,518 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 01:37:12,519 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label12_true-unreach-call.c [2018-10-25 01:37:12,579 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/668c53659/aad24b9af4304d75859e29bcb1bf9439/FLAGcb468fd59 [2018-10-25 01:37:13,301 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 01:37:13,302 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label12_true-unreach-call.c [2018-10-25 01:37:13,339 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/668c53659/aad24b9af4304d75859e29bcb1bf9439/FLAGcb468fd59 [2018-10-25 01:37:13,364 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/668c53659/aad24b9af4304d75859e29bcb1bf9439 [2018-10-25 01:37:13,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 01:37:13,380 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 01:37:13,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 01:37:13,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 01:37:13,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 01:37:13,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:37:13" (1/1) ... [2018-10-25 01:37:13,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5de7335f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:13, skipping insertion in model container [2018-10-25 01:37:13,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 01:37:13" (1/1) ... [2018-10-25 01:37:13,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 01:37:13,568 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 01:37:14,829 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:37:14,835 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 01:37:15,514 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 01:37:15,554 INFO L193 MainTranslator]: Completed translation [2018-10-25 01:37:15,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:15 WrapperNode [2018-10-25 01:37:15,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 01:37:15,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 01:37:15,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 01:37:15,557 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 01:37:15,569 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:37:15" (1/1) ... [2018-10-25 01:37:15,650 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:37:15" (1/1) ... [2018-10-25 01:37:16,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 01:37:16,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 01:37:16,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 01:37:16,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 01:37:16,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:15" (1/1) ... [2018-10-25 01:37:16,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:15" (1/1) ... [2018-10-25 01:37:16,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:15" (1/1) ... [2018-10-25 01:37:16,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:15" (1/1) ... [2018-10-25 01:37:16,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:15" (1/1) ... [2018-10-25 01:37:16,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:15" (1/1) ... [2018-10-25 01:37:16,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:15" (1/1) ... [2018-10-25 01:37:16,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 01:37:16,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 01:37:16,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 01:37:16,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 01:37:16,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:15" (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:37:16,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 01:37:16,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 01:37:16,514 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-10-25 01:37:16,514 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-10-25 01:37:16,515 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-10-25 01:37:16,515 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-10-25 01:37:16,515 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 01:37:16,515 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 01:37:16,516 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 01:37:16,516 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 01:37:16,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 01:37:16,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 01:37:16,516 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 01:37:16,517 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 01:37:28,180 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 01:37:28,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:37:28 BoogieIcfgContainer [2018-10-25 01:37:28,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 01:37:28,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 01:37:28,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 01:37:28,186 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 01:37:28,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 01:37:13" (1/3) ... [2018-10-25 01:37:28,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da772a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:37:28, skipping insertion in model container [2018-10-25 01:37:28,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 01:37:15" (2/3) ... [2018-10-25 01:37:28,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da772a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 01:37:28, skipping insertion in model container [2018-10-25 01:37:28,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 01:37:28" (3/3) ... [2018-10-25 01:37:28,190 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label12_true-unreach-call.c [2018-10-25 01:37:28,201 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 01:37:28,219 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 01:37:28,237 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 01:37:28,306 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 01:37:28,306 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 01:37:28,306 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 01:37:28,306 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 01:37:28,306 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 01:37:28,307 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 01:37:28,307 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 01:37:28,307 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 01:37:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states. [2018-10-25 01:37:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-25 01:37:28,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:28,367 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:37:28,369 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:28,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:28,375 INFO L82 PathProgramCache]: Analyzing trace with hash -653168765, now seen corresponding path program 1 times [2018-10-25 01:37:28,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:28,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:28,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:28,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:28,426 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:29,091 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:37:29,276 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:37:29,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:29,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 01:37:29,281 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:29,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 01:37:29,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 01:37:29,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 01:37:29,302 INFO L87 Difference]: Start difference. First operand 840 states. Second operand 3 states. [2018-10-25 01:37:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:37:36,263 INFO L93 Difference]: Finished difference Result 2446 states and 4700 transitions. [2018-10-25 01:37:36,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 01:37:36,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-25 01:37:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:37:36,303 INFO L225 Difference]: With dead ends: 2446 [2018-10-25 01:37:36,304 INFO L226 Difference]: Without dead ends: 1604 [2018-10-25 01:37:36,315 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:37:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2018-10-25 01:37:36,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2018-10-25 01:37:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-10-25 01:37:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2909 transitions. [2018-10-25 01:37:36,470 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2909 transitions. Word has length 65 [2018-10-25 01:37:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:37:36,470 INFO L481 AbstractCegarLoop]: Abstraction has 1604 states and 2909 transitions. [2018-10-25 01:37:36,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 01:37:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2909 transitions. [2018-10-25 01:37:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-25 01:37:36,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:36,479 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:37:36,479 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:36,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:36,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1735878332, now seen corresponding path program 1 times [2018-10-25 01:37:36,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:36,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:36,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:36,482 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:36,728 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:37:36,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:36,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 01:37:36,729 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:36,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 01:37:36,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 01:37:36,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 01:37:36,732 INFO L87 Difference]: Start difference. First operand 1604 states and 2909 transitions. Second operand 5 states. [2018-10-25 01:37:47,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:37:47,601 INFO L93 Difference]: Finished difference Result 4818 states and 8826 transitions. [2018-10-25 01:37:47,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:37:47,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-10-25 01:37:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:37:47,631 INFO L225 Difference]: With dead ends: 4818 [2018-10-25 01:37:47,632 INFO L226 Difference]: Without dead ends: 3220 [2018-10-25 01:37:47,638 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:37:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2018-10-25 01:37:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 3186. [2018-10-25 01:37:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2018-10-25 01:37:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 5594 transitions. [2018-10-25 01:37:47,768 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 5594 transitions. Word has length 139 [2018-10-25 01:37:47,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:37:47,769 INFO L481 AbstractCegarLoop]: Abstraction has 3186 states and 5594 transitions. [2018-10-25 01:37:47,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 01:37:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 5594 transitions. [2018-10-25 01:37:47,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-25 01:37:47,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:37:47,783 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:37:47,783 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:37:47,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:37:47,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2022768053, now seen corresponding path program 1 times [2018-10-25 01:37:47,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:37:47,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:47,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:37:47,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:37:47,789 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:37:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:37:48,182 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:37:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:37:48,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:37:48,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:37:48,505 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:37:48,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:37:48,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:37:48,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:37:48,506 INFO L87 Difference]: Start difference. First operand 3186 states and 5594 transitions. Second operand 6 states. [2018-10-25 01:38:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:00,737 INFO L93 Difference]: Finished difference Result 11148 states and 19850 transitions. [2018-10-25 01:38:00,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:38:00,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2018-10-25 01:38:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:00,796 INFO L225 Difference]: With dead ends: 11148 [2018-10-25 01:38:00,796 INFO L226 Difference]: Without dead ends: 7968 [2018-10-25 01:38:00,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:38:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7968 states. [2018-10-25 01:38:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7968 to 7924. [2018-10-25 01:38:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7924 states. [2018-10-25 01:38:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7924 states to 7924 states and 13424 transitions. [2018-10-25 01:38:01,064 INFO L78 Accepts]: Start accepts. Automaton has 7924 states and 13424 transitions. Word has length 144 [2018-10-25 01:38:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:01,065 INFO L481 AbstractCegarLoop]: Abstraction has 7924 states and 13424 transitions. [2018-10-25 01:38:01,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:38:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 7924 states and 13424 transitions. [2018-10-25 01:38:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-25 01:38:01,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:01,069 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:38:01,070 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:01,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:01,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1110461253, now seen corresponding path program 1 times [2018-10-25 01:38:01,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:01,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:01,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:01,072 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:01,339 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:38:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:38:01,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:38:01,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:38:01,531 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:01,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:38:01,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:38:01,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:38:01,533 INFO L87 Difference]: Start difference. First operand 7924 states and 13424 transitions. Second operand 6 states. [2018-10-25 01:38:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:12,519 INFO L93 Difference]: Finished difference Result 22224 states and 38004 transitions. [2018-10-25 01:38:12,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:38:12,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2018-10-25 01:38:12,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:12,592 INFO L225 Difference]: With dead ends: 22224 [2018-10-25 01:38:12,593 INFO L226 Difference]: Without dead ends: 14306 [2018-10-25 01:38:12,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:38:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14306 states. [2018-10-25 01:38:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14306 to 14219. [2018-10-25 01:38:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14219 states. [2018-10-25 01:38:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14219 states to 14219 states and 21550 transitions. [2018-10-25 01:38:12,967 INFO L78 Accepts]: Start accepts. Automaton has 14219 states and 21550 transitions. Word has length 152 [2018-10-25 01:38:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:12,967 INFO L481 AbstractCegarLoop]: Abstraction has 14219 states and 21550 transitions. [2018-10-25 01:38:12,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:38:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 14219 states and 21550 transitions. [2018-10-25 01:38:12,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-25 01:38:12,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:12,976 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:38:12,976 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:12,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:12,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1126931720, now seen corresponding path program 1 times [2018-10-25 01:38:12,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:12,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:12,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:12,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:12,978 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:13,300 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 01:38:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:38:13,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 01:38:13,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 01:38:13,671 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:13,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:38:13,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:38:13,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:38:13,673 INFO L87 Difference]: Start difference. First operand 14219 states and 21550 transitions. Second operand 6 states. [2018-10-25 01:38:27,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:27,537 INFO L93 Difference]: Finished difference Result 35956 states and 55845 transitions. [2018-10-25 01:38:27,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 01:38:27,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 185 [2018-10-25 01:38:27,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:27,629 INFO L225 Difference]: With dead ends: 35956 [2018-10-25 01:38:27,629 INFO L226 Difference]: Without dead ends: 21743 [2018-10-25 01:38:27,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 01:38:27,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21743 states. [2018-10-25 01:38:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21743 to 21651. [2018-10-25 01:38:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21651 states. [2018-10-25 01:38:28,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21651 states to 21651 states and 30247 transitions. [2018-10-25 01:38:28,172 INFO L78 Accepts]: Start accepts. Automaton has 21651 states and 30247 transitions. Word has length 185 [2018-10-25 01:38:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:28,173 INFO L481 AbstractCegarLoop]: Abstraction has 21651 states and 30247 transitions. [2018-10-25 01:38:28,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 01:38:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 21651 states and 30247 transitions. [2018-10-25 01:38:28,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-25 01:38:28,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:28,190 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 01:38:28,190 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:28,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:28,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1082582744, now seen corresponding path program 1 times [2018-10-25 01:38:28,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:28,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:28,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 119 proven. 67 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-25 01:38:28,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:38:28,853 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:38:28,855 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 237 with the following transitions: [2018-10-25 01:38:28,857 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], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2235], [2243], [2251], [2259], [2267], [2275], [2283], [2287], [2289], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2377], [2381], [2384], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2460], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:38:28,917 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:38:28,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:38:29,703 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 01:38:29,704 INFO L272 AbstractInterpreter]: Visited 104 different actions 200 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 01:38:29,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:29,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 01:38:29,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:38:29,749 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 01:38:29,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:29,766 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 01:38:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:29,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 01:38:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 190 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:38:30,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 01:38:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 190 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 01:38:31,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 01:38:31,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 01:38:31,221 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 01:38:31,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 01:38:31,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 01:38:31,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-25 01:38:31,223 INFO L87 Difference]: Start difference. First operand 21651 states and 30247 transitions. Second operand 9 states. [2018-10-25 01:38:52,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 01:38:52,994 INFO L93 Difference]: Finished difference Result 66713 states and 105908 transitions. [2018-10-25 01:38:52,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-25 01:38:52,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 236 [2018-10-25 01:38:52,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 01:38:53,240 INFO L225 Difference]: With dead ends: 66713 [2018-10-25 01:38:53,240 INFO L226 Difference]: Without dead ends: 45068 [2018-10-25 01:38:53,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 488 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=309, Invalid=951, Unknown=0, NotChecked=0, Total=1260 [2018-10-25 01:38:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45068 states. [2018-10-25 01:38:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45068 to 44019. [2018-10-25 01:38:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44019 states. [2018-10-25 01:38:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44019 states to 44019 states and 57466 transitions. [2018-10-25 01:38:54,935 INFO L78 Accepts]: Start accepts. Automaton has 44019 states and 57466 transitions. Word has length 236 [2018-10-25 01:38:54,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 01:38:54,935 INFO L481 AbstractCegarLoop]: Abstraction has 44019 states and 57466 transitions. [2018-10-25 01:38:54,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 01:38:54,936 INFO L276 IsEmpty]: Start isEmpty. Operand 44019 states and 57466 transitions. [2018-10-25 01:38:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-25 01:38:54,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 01:38:54,950 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:54,950 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 01:38:54,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:54,951 INFO L82 PathProgramCache]: Analyzing trace with hash 465647125, now seen corresponding path program 1 times [2018-10-25 01:38:54,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 01:38:54,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:54,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 01:38:54,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 01:38:54,952 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 01:38:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 01:38:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 116 proven. 69 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 01:38:55,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 01:38:55,360 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 01:38:55,360 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 262 with the following transitions: [2018-10-25 01:38:55,361 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], [2131], [2139], [2147], [2155], [2163], [2171], [2179], [2187], [2195], [2203], [2211], [2219], [2227], [2235], [2243], [2251], [2259], [2267], [2275], [2283], [2287], [2289], [2292], [2300], [2308], [2316], [2324], [2332], [2340], [2348], [2356], [2361], [2365], [2369], [2373], [2376], [2377], [2381], [2385], [2389], [2393], [2397], [2401], [2405], [2409], [2413], [2417], [2421], [2425], [2429], [2433], [2437], [2441], [2445], [2449], [2453], [2457], [2461], [2465], [2469], [2473], [2477], [2481], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2568], [3240], [3244], [3248], [3254], [3258], [3260], [3271], [3272], [3273], [3275], [3276] [2018-10-25 01:38:55,372 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 01:38:55,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 01:38:55,745 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 01:38:55,746 INFO L272 AbstractInterpreter]: Visited 127 different actions 127 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 01:38:55,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 01:38:55,782 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 01:38:56,431 INFO L232 lantSequenceWeakener]: Weakened 252 states. On average, predicates are now at 75.75% of their original sizes. [2018-10-25 01:38:56,432 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 01:38:56,682 INFO L413 sIntCurrentIteration]: We have 260 unified AI predicates [2018-10-25 01:38:56,683 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 01:38:56,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 01:38:56,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-25 01:38:56,684 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 01:38:56,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 01:38:56,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 01:38:56,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 01:38:56,685 INFO L87 Difference]: Start difference. First operand 44019 states and 57466 transitions. Second operand 6 states. [2018-10-25 01:39:15,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 01:39:15,541 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:93) 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: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:39:15,547 INFO L168 Benchmark]: Toolchain (without parser) took 122168.00 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.3 GB in the beginning and 1.7 GB in the end (delta: -323.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-10-25 01:39:15,548 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:39:15,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2172.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.1 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:39:15,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 546.23 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.7 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -962.9 MB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:15,550 INFO L168 Benchmark]: Boogie Preprocessor took 341.95 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:15,551 INFO L168 Benchmark]: RCFGBuilder took 11735.68 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.4 GB in the end (delta: 657.7 MB). Peak memory consumption was 657.7 MB. Max. memory is 7.1 GB. [2018-10-25 01:39:15,552 INFO L168 Benchmark]: TraceAbstraction took 107363.46 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -257.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-25 01:39:15,560 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 2172.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.1 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 546.23 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.7 MB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -962.9 MB). Peak memory consumption was 68.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 341.95 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 38.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11735.68 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.4 GB in the end (delta: 657.7 MB). Peak memory consumption was 657.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107363.46 ms. Allocated memory was 2.2 GB in the beginning and 3.9 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -257.9 MB). Peak memory consumption was 1.5 GB. 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...