java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label08.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 18:53:54,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 18:53:54,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 18:53:54,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 18:53:54,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 18:53:54,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 18:53:54,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 18:53:54,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 18:53:54,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 18:53:54,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 18:53:54,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 18:53:54,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 18:53:54,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 18:53:54,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 18:53:54,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 18:53:54,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 18:53:54,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 18:53:54,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 18:53:54,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 18:53:54,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 18:53:54,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 18:53:54,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 18:53:54,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 18:53:54,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 18:53:54,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 18:53:54,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 18:53:54,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 18:53:54,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 18:53:54,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 18:53:54,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 18:53:54,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 18:53:54,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 18:53:54,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 18:53:54,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 18:53:54,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 18:53:54,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 18:53:54,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 18:53:54,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 18:53:54,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 18:53:54,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 18:53:54,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 18:53:54,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 18:53:54,570 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 18:53:54,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 18:53:54,571 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 18:53:54,571 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 18:53:54,572 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 18:53:54,572 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 18:53:54,573 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 18:53:54,573 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 18:53:54,573 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 18:53:54,573 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 18:53:54,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 18:53:54,576 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 18:53:54,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 18:53:54,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 18:53:54,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 18:53:54,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 18:53:54,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 18:53:54,577 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 18:53:54,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 18:53:54,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 18:53:54,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 18:53:54,578 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 18:53:54,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 18:53:54,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 18:53:54,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 18:53:54,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 18:53:54,579 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 18:53:54,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 18:53:54,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 18:53:54,580 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 18:53:54,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 18:53:54,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 18:53:54,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 18:53:54,661 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 18:53:54,665 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 18:53:54,666 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label08.c [2019-09-09 18:53:54,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa968e349/ef049f41792d47f593c5beb1f643f9b5/FLAGb747ec7a6 [2019-09-09 18:53:55,421 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 18:53:55,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label08.c [2019-09-09 18:53:55,452 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa968e349/ef049f41792d47f593c5beb1f643f9b5/FLAGb747ec7a6 [2019-09-09 18:53:55,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa968e349/ef049f41792d47f593c5beb1f643f9b5 [2019-09-09 18:53:55,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 18:53:55,576 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 18:53:55,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 18:53:55,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 18:53:55,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 18:53:55,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 06:53:55" (1/1) ... [2019-09-09 18:53:55,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e607a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:53:55, skipping insertion in model container [2019-09-09 18:53:55,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 06:53:55" (1/1) ... [2019-09-09 18:53:55,593 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 18:53:55,690 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 18:53:56,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 18:53:56,516 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 18:53:56,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 18:53:56,942 INFO L192 MainTranslator]: Completed translation [2019-09-09 18:53:56,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:53:56 WrapperNode [2019-09-09 18:53:56,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 18:53:56,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 18:53:56,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 18:53:56,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 18:53:56,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:53:56" (1/1) ... [2019-09-09 18:53:56,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:53:56" (1/1) ... [2019-09-09 18:53:56,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:53:56" (1/1) ... [2019-09-09 18:53:56,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:53:56" (1/1) ... [2019-09-09 18:53:57,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:53:56" (1/1) ... [2019-09-09 18:53:57,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:53:56" (1/1) ... [2019-09-09 18:53:57,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:53:56" (1/1) ... [2019-09-09 18:53:57,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 18:53:57,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 18:53:57,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 18:53:57,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 18:53:57,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:53:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-09-09 18:53:57,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 18:53:57,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 18:53:57,241 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-09 18:53:57,241 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-09 18:53:57,242 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 18:53:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-09 18:53:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-09 18:53:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 18:53:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 18:53:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-09 18:53:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 18:53:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 18:53:57,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 18:54:00,173 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 18:54:00,173 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 18:54:00,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 06:54:00 BoogieIcfgContainer [2019-09-09 18:54:00,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 18:54:00,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 18:54:00,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 18:54:00,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 18:54:00,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 06:53:55" (1/3) ... [2019-09-09 18:54:00,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3806eff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 06:54:00, skipping insertion in model container [2019-09-09 18:54:00,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:53:56" (2/3) ... [2019-09-09 18:54:00,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3806eff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 06:54:00, skipping insertion in model container [2019-09-09 18:54:00,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 06:54:00" (3/3) ... [2019-09-09 18:54:00,184 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label08.c [2019-09-09 18:54:00,194 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 18:54:00,203 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 18:54:00,220 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 18:54:00,247 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 18:54:00,247 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 18:54:00,248 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 18:54:00,248 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 18:54:00,248 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 18:54:00,248 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 18:54:00,248 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 18:54:00,249 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 18:54:00,278 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-09 18:54:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-09 18:54:00,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:54:00,293 INFO L399 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] [2019-09-09 18:54:00,294 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:54:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:54:00,299 INFO L82 PathProgramCache]: Analyzing trace with hash 192141165, now seen corresponding path program 1 times [2019-09-09 18:54:00,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:54:00,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:00,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:54:00,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:00,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:54:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:54:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:54:00,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:54:00,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 18:54:00,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:54:00,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 18:54:00,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 18:54:00,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 18:54:00,739 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 3 states. [2019-09-09 18:54:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:54:03,637 INFO L93 Difference]: Finished difference Result 760 states and 1275 transitions. [2019-09-09 18:54:03,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 18:54:03,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-09 18:54:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:54:03,677 INFO L225 Difference]: With dead ends: 760 [2019-09-09 18:54:03,677 INFO L226 Difference]: Without dead ends: 692 [2019-09-09 18:54:03,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 18:54:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-09-09 18:54:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 690. [2019-09-09 18:54:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-09-09 18:54:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1154 transitions. [2019-09-09 18:54:03,800 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1154 transitions. Word has length 57 [2019-09-09 18:54:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:54:03,800 INFO L475 AbstractCegarLoop]: Abstraction has 690 states and 1154 transitions. [2019-09-09 18:54:03,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 18:54:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1154 transitions. [2019-09-09 18:54:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-09 18:54:03,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:54:03,814 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:54:03,815 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:54:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:54:03,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1869763890, now seen corresponding path program 1 times [2019-09-09 18:54:03,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:54:03,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:03,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:54:03,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:03,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:54:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:54:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:54:04,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:54:04,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 18:54:04,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:54:04,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 18:54:04,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 18:54:04,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 18:54:04,116 INFO L87 Difference]: Start difference. First operand 690 states and 1154 transitions. Second operand 6 states. [2019-09-09 18:54:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:54:09,705 INFO L93 Difference]: Finished difference Result 1373 states and 2305 transitions. [2019-09-09 18:54:09,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 18:54:09,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-09-09 18:54:09,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:54:09,719 INFO L225 Difference]: With dead ends: 1373 [2019-09-09 18:54:09,719 INFO L226 Difference]: Without dead ends: 1373 [2019-09-09 18:54:09,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-09 18:54:09,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2019-09-09 18:54:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1342. [2019-09-09 18:54:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-09-09 18:54:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 2245 transitions. [2019-09-09 18:54:09,787 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 2245 transitions. Word has length 130 [2019-09-09 18:54:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:54:09,791 INFO L475 AbstractCegarLoop]: Abstraction has 1342 states and 2245 transitions. [2019-09-09 18:54:09,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 18:54:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 2245 transitions. [2019-09-09 18:54:09,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-09 18:54:09,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:54:09,804 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:54:09,805 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:54:09,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:54:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash 601746521, now seen corresponding path program 1 times [2019-09-09 18:54:09,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:54:09,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:09,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:54:09,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:09,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:54:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:54:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:54:09,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:54:09,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 18:54:09,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:54:09,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 18:54:09,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 18:54:09,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 18:54:09,937 INFO L87 Difference]: Start difference. First operand 1342 states and 2245 transitions. Second operand 5 states. [2019-09-09 18:54:14,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:54:14,419 INFO L93 Difference]: Finished difference Result 2654 states and 3852 transitions. [2019-09-09 18:54:14,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 18:54:14,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-09 18:54:14,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:54:14,436 INFO L225 Difference]: With dead ends: 2654 [2019-09-09 18:54:14,437 INFO L226 Difference]: Without dead ends: 2654 [2019-09-09 18:54:14,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-09 18:54:14,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2019-09-09 18:54:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2615. [2019-09-09 18:54:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2615 states. [2019-09-09 18:54:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2615 states and 3768 transitions. [2019-09-09 18:54:14,524 INFO L78 Accepts]: Start accepts. Automaton has 2615 states and 3768 transitions. Word has length 133 [2019-09-09 18:54:14,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:54:14,525 INFO L475 AbstractCegarLoop]: Abstraction has 2615 states and 3768 transitions. [2019-09-09 18:54:14,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 18:54:14,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2615 states and 3768 transitions. [2019-09-09 18:54:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-09 18:54:14,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:54:14,528 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:54:14,528 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:54:14,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:54:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash -286591957, now seen corresponding path program 1 times [2019-09-09 18:54:14,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:54:14,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:14,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:54:14,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:14,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:54:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:54:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:54:14,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:54:14,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 18:54:14,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:54:14,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 18:54:14,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 18:54:14,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 18:54:14,680 INFO L87 Difference]: Start difference. First operand 2615 states and 3768 transitions. Second operand 6 states. [2019-09-09 18:54:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:54:18,888 INFO L93 Difference]: Finished difference Result 3963 states and 5759 transitions. [2019-09-09 18:54:18,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 18:54:18,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-09 18:54:18,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:54:18,916 INFO L225 Difference]: With dead ends: 3963 [2019-09-09 18:54:18,916 INFO L226 Difference]: Without dead ends: 3963 [2019-09-09 18:54:18,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-09 18:54:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2019-09-09 18:54:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3910. [2019-09-09 18:54:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3910 states. [2019-09-09 18:54:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3910 states to 3910 states and 5486 transitions. [2019-09-09 18:54:19,090 INFO L78 Accepts]: Start accepts. Automaton has 3910 states and 5486 transitions. Word has length 143 [2019-09-09 18:54:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:54:19,090 INFO L475 AbstractCegarLoop]: Abstraction has 3910 states and 5486 transitions. [2019-09-09 18:54:19,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 18:54:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3910 states and 5486 transitions. [2019-09-09 18:54:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-09 18:54:19,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:54:19,094 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:54:19,094 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:54:19,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:54:19,095 INFO L82 PathProgramCache]: Analyzing trace with hash -449229944, now seen corresponding path program 1 times [2019-09-09 18:54:19,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:54:19,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:19,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:54:19,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:19,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:54:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:54:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:54:19,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:54:19,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 18:54:19,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:54:19,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 18:54:19,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 18:54:19,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 18:54:19,253 INFO L87 Difference]: Start difference. First operand 3910 states and 5486 transitions. Second operand 5 states. [2019-09-09 18:54:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:54:26,635 INFO L93 Difference]: Finished difference Result 6176 states and 8536 transitions. [2019-09-09 18:54:26,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 18:54:26,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-09 18:54:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:54:26,672 INFO L225 Difference]: With dead ends: 6176 [2019-09-09 18:54:26,673 INFO L226 Difference]: Without dead ends: 6176 [2019-09-09 18:54:26,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-09 18:54:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6176 states. [2019-09-09 18:54:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6176 to 6153. [2019-09-09 18:54:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6153 states. [2019-09-09 18:54:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8483 transitions. [2019-09-09 18:54:26,865 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8483 transitions. Word has length 153 [2019-09-09 18:54:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:54:26,866 INFO L475 AbstractCegarLoop]: Abstraction has 6153 states and 8483 transitions. [2019-09-09 18:54:26,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 18:54:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8483 transitions. [2019-09-09 18:54:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-09 18:54:26,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:54:26,871 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:54:26,871 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:54:26,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:54:26,872 INFO L82 PathProgramCache]: Analyzing trace with hash -379423501, now seen corresponding path program 1 times [2019-09-09 18:54:26,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:54:26,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:26,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:54:26,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:26,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:54:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:54:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:54:27,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:54:27,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 18:54:27,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:54:27,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 18:54:27,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 18:54:27,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 18:54:27,062 INFO L87 Difference]: Start difference. First operand 6153 states and 8483 transitions. Second operand 4 states. [2019-09-09 18:54:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:54:32,006 INFO L93 Difference]: Finished difference Result 11550 states and 16889 transitions. [2019-09-09 18:54:32,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 18:54:32,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-09-09 18:54:32,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:54:32,070 INFO L225 Difference]: With dead ends: 11550 [2019-09-09 18:54:32,070 INFO L226 Difference]: Without dead ends: 11550 [2019-09-09 18:54:32,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 18:54:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11550 states. [2019-09-09 18:54:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11550 to 11543. [2019-09-09 18:54:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11543 states. [2019-09-09 18:54:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11543 states to 11543 states and 16881 transitions. [2019-09-09 18:54:32,354 INFO L78 Accepts]: Start accepts. Automaton has 11543 states and 16881 transitions. Word has length 168 [2019-09-09 18:54:32,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:54:32,355 INFO L475 AbstractCegarLoop]: Abstraction has 11543 states and 16881 transitions. [2019-09-09 18:54:32,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 18:54:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 11543 states and 16881 transitions. [2019-09-09 18:54:32,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-09 18:54:32,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:54:32,361 INFO L399 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, 2, 2, 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] [2019-09-09 18:54:32,361 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:54:32,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:54:32,361 INFO L82 PathProgramCache]: Analyzing trace with hash -870285491, now seen corresponding path program 1 times [2019-09-09 18:54:32,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:54:32,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:32,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:54:32,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:32,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:54:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:54:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-09 18:54:32,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:54:32,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 18:54:32,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:54:32,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 18:54:32,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 18:54:32,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 18:54:32,652 INFO L87 Difference]: Start difference. First operand 11543 states and 16881 transitions. Second operand 3 states. [2019-09-09 18:54:36,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:54:36,572 INFO L93 Difference]: Finished difference Result 19933 states and 28673 transitions. [2019-09-09 18:54:36,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 18:54:36,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-09-09 18:54:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:54:36,664 INFO L225 Difference]: With dead ends: 19933 [2019-09-09 18:54:36,665 INFO L226 Difference]: Without dead ends: 19933 [2019-09-09 18:54:36,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 18:54:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19933 states. [2019-09-09 18:54:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19933 to 18380. [2019-09-09 18:54:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18380 states. [2019-09-09 18:54:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18380 states to 18380 states and 26669 transitions. [2019-09-09 18:54:37,779 INFO L78 Accepts]: Start accepts. Automaton has 18380 states and 26669 transitions. Word has length 213 [2019-09-09 18:54:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:54:37,780 INFO L475 AbstractCegarLoop]: Abstraction has 18380 states and 26669 transitions. [2019-09-09 18:54:37,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 18:54:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 18380 states and 26669 transitions. [2019-09-09 18:54:37,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-09 18:54:37,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:54:37,793 INFO L399 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, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 18:54:37,793 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:54:37,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:54:37,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1305840580, now seen corresponding path program 1 times [2019-09-09 18:54:37,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:54:37,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:37,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:54:37,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:54:37,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:54:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:54:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:54:38,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:54:38,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 18:54:38,037 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2019-09-09 18:54:38,040 INFO L207 CegarAbsIntRunner]: [0], [1], [74], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [437], [439], [442], [450], [458], [466], [474], [482], [490], [498], [506], [514], [522], [530], [538], [546], [554], [562], [567], [571], [582], [586], [590], [594], [598], [602], [606], [610], [614], [617], [618], [622], [626], [630], [641], [645], [649], [653], [657], [668], [672], [676], [680], [684], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [798], [809], [813], [824], [835], [839], [850], [854], [865], [869], [873], [877], [880], [1635], [1639], [1648], [1652], [1654], [1661], [1662], [1663], [1665], [1666] [2019-09-09 18:54:38,137 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 18:54:38,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 18:54:44,428 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 18:54:44,430 INFO L272 AbstractInterpreter]: Visited 135 different actions 135 times. Never merged. Never widened. Performed 309 root evaluator evaluations with a maximum evaluation depth of 14. Performed 309 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Never found a fixpoint. Largest state had 24 variables. [2019-09-09 18:54:44,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:54:44,434 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 18:54:48,787 INFO L227 lantSequenceWeakener]: Weakened 248 states. On average, predicates are now at 78.1% of their original sizes. [2019-09-09 18:54:48,788 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 18:54:48,877 INFO L420 sIntCurrentIteration]: We unified 266 AI predicates to 266 [2019-09-09 18:54:48,877 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 18:54:48,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 18:54:48,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2019-09-09 18:54:48,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:54:48,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 18:54:48,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 18:54:48,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-09 18:54:48,880 INFO L87 Difference]: Start difference. First operand 18380 states and 26669 transitions. Second operand 11 states. [2019-09-09 18:54:58,485 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.