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/Problem02_label08.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 17:15:30,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 17:15:30,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 17:15:30,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 17:15:30,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 17:15:30,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 17:15:30,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 17:15:30,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 17:15:30,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 17:15:30,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 17:15:30,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 17:15:30,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 17:15:30,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 17:15:30,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 17:15:30,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 17:15:30,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 17:15:30,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 17:15:30,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 17:15:30,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 17:15:30,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 17:15:30,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 17:15:30,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 17:15:30,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 17:15:30,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 17:15:30,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 17:15:30,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 17:15:30,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 17:15:30,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 17:15:30,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 17:15:30,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 17:15:30,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 17:15:30,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 17:15:30,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 17:15:30,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 17:15:30,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 17:15:30,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 17:15:30,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 17:15:30,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 17:15:30,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 17:15:30,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 17:15:30,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 17:15:30,509 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-10-02 17:15:30,532 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 17:15:30,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 17:15:30,533 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 17:15:30,533 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 17:15:30,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 17:15:30,534 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 17:15:30,534 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 17:15:30,535 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 17:15:30,535 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 17:15:30,535 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 17:15:30,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 17:15:30,537 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 17:15:30,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 17:15:30,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 17:15:30,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 17:15:30,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 17:15:30,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 17:15:30,539 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 17:15:30,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 17:15:30,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 17:15:30,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 17:15:30,540 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 17:15:30,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 17:15:30,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 17:15:30,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 17:15:30,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 17:15:30,541 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 17:15:30,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 17:15:30,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 17:15:30,541 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 17:15:30,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 17:15:30,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 17:15:30,610 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 17:15:30,612 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 17:15:30,612 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 17:15:30,613 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label08.c [2019-10-02 17:15:30,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3db9f79ff/a0fe47beb3184d3f9a5e53ea7afc84ce/FLAGf110499f6 [2019-10-02 17:15:31,145 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 17:15:31,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label08.c [2019-10-02 17:15:31,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3db9f79ff/a0fe47beb3184d3f9a5e53ea7afc84ce/FLAGf110499f6 [2019-10-02 17:15:31,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3db9f79ff/a0fe47beb3184d3f9a5e53ea7afc84ce [2019-10-02 17:15:31,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 17:15:31,454 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 17:15:31,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 17:15:31,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 17:15:31,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 17:15:31,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:15:31" (1/1) ... [2019-10-02 17:15:31,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e9e1cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:31, skipping insertion in model container [2019-10-02 17:15:31,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:15:31" (1/1) ... [2019-10-02 17:15:31,471 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 17:15:31,534 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 17:15:32,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:15:32,119 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 17:15:32,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:15:32,262 INFO L192 MainTranslator]: Completed translation [2019-10-02 17:15:32,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:32 WrapperNode [2019-10-02 17:15:32,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 17:15:32,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 17:15:32,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 17:15:32,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 17:15:32,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:32" (1/1) ... [2019-10-02 17:15:32,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:32" (1/1) ... [2019-10-02 17:15:32,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:32" (1/1) ... [2019-10-02 17:15:32,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:32" (1/1) ... [2019-10-02 17:15:32,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:32" (1/1) ... [2019-10-02 17:15:32,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:32" (1/1) ... [2019-10-02 17:15:32,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:32" (1/1) ... [2019-10-02 17:15:32,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 17:15:32,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 17:15:32,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 17:15:32,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 17:15:32,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:32" (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-10-02 17:15:32,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 17:15:32,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 17:15:32,481 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 17:15:32,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 17:15:32,481 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 17:15:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 17:15:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 17:15:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 17:15:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 17:15:32,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 17:15:32,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 17:15:33,599 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 17:15:33,600 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 17:15:33,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:15:33 BoogieIcfgContainer [2019-10-02 17:15:33,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 17:15:33,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 17:15:33,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 17:15:33,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 17:15:33,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 05:15:31" (1/3) ... [2019-10-02 17:15:33,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2270b862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:15:33, skipping insertion in model container [2019-10-02 17:15:33,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:15:32" (2/3) ... [2019-10-02 17:15:33,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2270b862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:15:33, skipping insertion in model container [2019-10-02 17:15:33,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:15:33" (3/3) ... [2019-10-02 17:15:33,610 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label08.c [2019-10-02 17:15:33,620 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 17:15:33,628 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 17:15:33,645 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 17:15:33,672 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 17:15:33,672 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 17:15:33,672 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 17:15:33,672 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 17:15:33,673 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 17:15:33,673 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 17:15:33,673 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 17:15:33,673 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 17:15:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 17:15:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 17:15:33,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:33,719 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 17:15:33,721 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:33,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:33,727 INFO L82 PathProgramCache]: Analyzing trace with hash -218350154, now seen corresponding path program 1 times [2019-10-02 17:15:33,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:33,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:33,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:33,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:33,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:34,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:34,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:15:34,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:34,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:15:34,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:15:34,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:15:34,323 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 17:15:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:35,256 INFO L93 Difference]: Finished difference Result 388 states and 554 transitions. [2019-10-02 17:15:35,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:15:35,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-10-02 17:15:35,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:35,276 INFO L225 Difference]: With dead ends: 388 [2019-10-02 17:15:35,276 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:15:35,278 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:15:35,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:15:35,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:15:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:15:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 17:15:35,363 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 128 [2019-10-02 17:15:35,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:35,364 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 17:15:35,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:15:35,364 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 17:15:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 17:15:35,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:35,369 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 17:15:35,369 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:35,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:35,370 INFO L82 PathProgramCache]: Analyzing trace with hash 206670545, now seen corresponding path program 1 times [2019-10-02 17:15:35,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:35,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:35,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:35,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:35,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:35,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:35,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:15:35,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:35,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:15:35,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:15:35,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:35,694 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 17:15:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:36,442 INFO L93 Difference]: Finished difference Result 407 states and 552 transitions. [2019-10-02 17:15:36,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:15:36,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-02 17:15:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:36,446 INFO L225 Difference]: With dead ends: 407 [2019-10-02 17:15:36,447 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:15:36,448 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:36,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:15:36,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:15:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:15:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 17:15:36,468 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 136 [2019-10-02 17:15:36,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:36,468 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 17:15:36,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:15:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 17:15:36,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 17:15:36,472 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:36,472 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:15:36,472 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:36,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:36,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2140526213, now seen corresponding path program 1 times [2019-10-02 17:15:36,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:36,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:36,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:36,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:36,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:36,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:36,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:15:36,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:36,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:15:36,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:15:36,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:36,773 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 17:15:37,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:37,517 INFO L93 Difference]: Finished difference Result 403 states and 544 transitions. [2019-10-02 17:15:37,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:15:37,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-02 17:15:37,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:37,522 INFO L225 Difference]: With dead ends: 403 [2019-10-02 17:15:37,522 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:15:37,523 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:15:37,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:15:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:15:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 17:15:37,549 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 142 [2019-10-02 17:15:37,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:37,554 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 17:15:37,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:15:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 17:15:37,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 17:15:37,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:37,557 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:15:37,558 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:37,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:37,558 INFO L82 PathProgramCache]: Analyzing trace with hash 507332814, now seen corresponding path program 1 times [2019-10-02 17:15:37,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:37,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:37,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:37,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:37,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:37,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:37,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:15:37,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:37,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:15:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:15:37,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:15:37,684 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 17:15:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:38,589 INFO L93 Difference]: Finished difference Result 637 states and 894 transitions. [2019-10-02 17:15:38,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:15:38,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-02 17:15:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:38,593 INFO L225 Difference]: With dead ends: 637 [2019-10-02 17:15:38,594 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 17:15:38,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 17:15:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 17:15:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 17:15:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:15:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2019-10-02 17:15:38,619 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 150 [2019-10-02 17:15:38,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:38,619 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2019-10-02 17:15:38,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:15:38,620 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2019-10-02 17:15:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 17:15:38,623 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:38,624 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:15:38,624 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:38,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:38,624 INFO L82 PathProgramCache]: Analyzing trace with hash 842155530, now seen corresponding path program 1 times [2019-10-02 17:15:38,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:38,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:38,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:38,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:38,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:38,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:38,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:15:38,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:38,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:15:38,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:15:38,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:38,853 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2019-10-02 17:15:39,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:39,570 INFO L93 Difference]: Finished difference Result 710 states and 957 transitions. [2019-10-02 17:15:39,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:15:39,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-10-02 17:15:39,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:39,575 INFO L225 Difference]: With dead ends: 710 [2019-10-02 17:15:39,575 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 17:15:39,576 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 17:15:39,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 17:15:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:15:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2019-10-02 17:15:39,596 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 152 [2019-10-02 17:15:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:39,596 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2019-10-02 17:15:39,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:15:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2019-10-02 17:15:39,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 17:15:39,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:39,600 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 17:15:39,600 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:39,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:39,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1322550086, now seen corresponding path program 1 times [2019-10-02 17:15:39,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:39,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:39,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:39,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:39,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:39,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:39,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:15:39,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:39,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:15:39,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:15:39,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:39,784 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2019-10-02 17:15:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:40,367 INFO L93 Difference]: Finished difference Result 712 states and 947 transitions. [2019-10-02 17:15:40,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:15:40,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-10-02 17:15:40,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:40,371 INFO L225 Difference]: With dead ends: 712 [2019-10-02 17:15:40,371 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 17:15:40,372 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:15:40,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 17:15:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 17:15:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:15:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2019-10-02 17:15:40,390 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 154 [2019-10-02 17:15:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:40,391 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2019-10-02 17:15:40,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:15:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2019-10-02 17:15:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 17:15:40,395 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:40,395 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 17:15:40,395 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:40,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:40,396 INFO L82 PathProgramCache]: Analyzing trace with hash 484490686, now seen corresponding path program 1 times [2019-10-02 17:15:40,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:40,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:40,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:40,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:40,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:40,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:15:40,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:15:40,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:15:40,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:15:40,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:15:40,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:15:40,493 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2019-10-02 17:15:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:15:41,392 INFO L93 Difference]: Finished difference Result 1238 states and 1704 transitions. [2019-10-02 17:15:41,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:15:41,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-10-02 17:15:41,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:15:41,400 INFO L225 Difference]: With dead ends: 1238 [2019-10-02 17:15:41,400 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 17:15:41,401 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 17:15:41,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 17:15:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 17:15:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 17:15:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2019-10-02 17:15:41,437 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 158 [2019-10-02 17:15:41,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:15:41,437 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2019-10-02 17:15:41,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:15:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2019-10-02 17:15:41,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 17:15:41,442 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:15:41,442 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:15:41,443 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:15:41,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:15:41,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1847232649, now seen corresponding path program 1 times [2019-10-02 17:15:41,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:15:41,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:41,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:15:41,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:15:41,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:15:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:15:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:15:41,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 17:15:41,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 17:15:41,590 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2019-10-02 17:15:41,593 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [703], [705], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-10-02 17:15:41,669 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 17:15:41,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 17:27:31,408 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 17:27:31,411 INFO L272 AbstractInterpreter]: Visited 132 different actions 388 times. Merged at 6 different actions 12 times. Never widened. Performed 878 root evaluator evaluations with a maximum evaluation depth of 18. Performed 878 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2019-10-02 17:27:31,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:27:31,416 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates