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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:45:54,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:45:54,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:45:54,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:45:54,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:45:54,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:45:54,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:45:54,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:45:54,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:45:54,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:45:54,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:45:54,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:45:54,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:45:54,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:45:54,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:45:54,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:45:54,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:45:54,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:45:54,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:45:54,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:45:54,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:45:54,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:45:54,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:45:54,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:45:54,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:45:54,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:45:54,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:45:54,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:45:54,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:45:54,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:45:54,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:45:54,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:45:54,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:45:54,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:45:54,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:45:54,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:45:54,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:45:54,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:45:54,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:45:54,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:45:54,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:45:54,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:45:54,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:45:54,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:45:54,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:45:54,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:45:54,568 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:45:54,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:45:54,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:45:54,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:45:54,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:45:54,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:45:54,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:45:54,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:45:54,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:45:54,571 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:45:54,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:45:54,571 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:45:54,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:45:54,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:45:54,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:45:54,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:45:54,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:45:54,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:45:54,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:45:54,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:45:54,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:45:54,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:45:54,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:45:54,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:45:54,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:45:54,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:45:54,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:45:54,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:45:54,880 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:45:54,880 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:45:54,881 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 19:45:54,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4dfac28c/e5ab0f97ce51446d8f76c6129fac0438/FLAGd5c5b1e2e [2019-10-13 19:45:55,513 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:45:55,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 19:45:55,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4dfac28c/e5ab0f97ce51446d8f76c6129fac0438/FLAGd5c5b1e2e [2019-10-13 19:45:55,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4dfac28c/e5ab0f97ce51446d8f76c6129fac0438 [2019-10-13 19:45:55,789 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:45:55,790 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:45:55,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:45:55,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:45:55,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:45:55,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:55" (1/1) ... [2019-10-13 19:45:55,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e6ce29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:55, skipping insertion in model container [2019-10-13 19:45:55,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:55" (1/1) ... [2019-10-13 19:45:55,808 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:45:55,859 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:45:56,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:45:56,362 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:45:56,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:45:56,508 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:45:56,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:56 WrapperNode [2019-10-13 19:45:56,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:45:56,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:45:56,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:45:56,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:45:56,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:56" (1/1) ... [2019-10-13 19:45:56,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:56" (1/1) ... [2019-10-13 19:45:56,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:56" (1/1) ... [2019-10-13 19:45:56,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:56" (1/1) ... [2019-10-13 19:45:56,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:56" (1/1) ... [2019-10-13 19:45:56,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:56" (1/1) ... [2019-10-13 19:45:56,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:56" (1/1) ... [2019-10-13 19:45:56,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:45:56,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:45:56,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:45:56,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:45:56,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45: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-10-13 19:45:56,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:45:56,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:45:56,687 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:45:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:45:56,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:45:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 19:45:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 19:45:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:45:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 19:45:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 19:45:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 19:45:56,691 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 19:45:56,691 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 19:45:56,692 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 19:45:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 19:45:56,693 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:45:56,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:45:56,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:45:58,045 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:45:58,046 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 19:45:58,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:58 BoogieIcfgContainer [2019-10-13 19:45:58,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:45:58,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:45:58,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:45:58,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:45:58,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:45:55" (1/3) ... [2019-10-13 19:45:58,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ce8e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:58, skipping insertion in model container [2019-10-13 19:45:58,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:56" (2/3) ... [2019-10-13 19:45:58,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ce8e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:58, skipping insertion in model container [2019-10-13 19:45:58,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:58" (3/3) ... [2019-10-13 19:45:58,057 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 19:45:58,068 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:45:58,077 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:45:58,088 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:45:58,118 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:45:58,119 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:45:58,119 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:45:58,119 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:45:58,120 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:45:58,120 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:45:58,120 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:45:58,120 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:45:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2019-10-13 19:45:58,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:45:58,163 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:58,164 INFO L380 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] [2019-10-13 19:45:58,166 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:58,173 INFO L82 PathProgramCache]: Analyzing trace with hash -766456376, now seen corresponding path program 1 times [2019-10-13 19:45:58,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:58,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082800340] [2019-10-13 19:45:58,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:58,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:58,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:59,020 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:45:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:59,094 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-13 19:45:59,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082800340] [2019-10-13 19:45:59,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:59,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:59,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127635540] [2019-10-13 19:45:59,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:59,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:59,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:59,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:59,125 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2019-10-13 19:45:59,482 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2019-10-13 19:46:00,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:00,889 INFO L93 Difference]: Finished difference Result 489 states and 838 transitions. [2019-10-13 19:46:00,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:00,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-13 19:46:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:00,909 INFO L225 Difference]: With dead ends: 489 [2019-10-13 19:46:00,910 INFO L226 Difference]: Without dead ends: 362 [2019-10-13 19:46:00,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:00,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-10-13 19:46:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-10-13 19:46:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-13 19:46:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 547 transitions. [2019-10-13 19:46:01,027 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 547 transitions. Word has length 104 [2019-10-13 19:46:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:01,029 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 547 transitions. [2019-10-13 19:46:01,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 547 transitions. [2019-10-13 19:46:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:46:01,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:01,040 INFO L380 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] [2019-10-13 19:46:01,041 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:01,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:01,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1314271708, now seen corresponding path program 1 times [2019-10-13 19:46:01,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:01,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851884764] [2019-10-13 19:46:01,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:01,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:01,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:01,664 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:46:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:01,700 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-13 19:46:01,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851884764] [2019-10-13 19:46:01,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:01,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:01,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642244586] [2019-10-13 19:46:01,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:01,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:01,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:01,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:01,704 INFO L87 Difference]: Start difference. First operand 360 states and 547 transitions. Second operand 5 states. [2019-10-13 19:46:03,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:03,546 INFO L93 Difference]: Finished difference Result 1038 states and 1576 transitions. [2019-10-13 19:46:03,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:03,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-13 19:46:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:03,553 INFO L225 Difference]: With dead ends: 1038 [2019-10-13 19:46:03,553 INFO L226 Difference]: Without dead ends: 691 [2019-10-13 19:46:03,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:46:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-10-13 19:46:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2019-10-13 19:46:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-10-13 19:46:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1038 transitions. [2019-10-13 19:46:03,652 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1038 transitions. Word has length 104 [2019-10-13 19:46:03,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:03,652 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1038 transitions. [2019-10-13 19:46:03,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1038 transitions. [2019-10-13 19:46:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:46:03,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:03,661 INFO L380 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] [2019-10-13 19:46:03,661 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:03,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:03,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2074994812, now seen corresponding path program 1 times [2019-10-13 19:46:03,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:03,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288387652] [2019-10-13 19:46:03,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:03,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:03,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:03,939 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:46:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:03,962 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-13 19:46:03,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288387652] [2019-10-13 19:46:03,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:03,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:03,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420149323] [2019-10-13 19:46:03,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:03,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:03,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:03,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:03,965 INFO L87 Difference]: Start difference. First operand 689 states and 1038 transitions. Second operand 4 states. [2019-10-13 19:46:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:05,862 INFO L93 Difference]: Finished difference Result 2021 states and 3044 transitions. [2019-10-13 19:46:05,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:05,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-13 19:46:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:05,874 INFO L225 Difference]: With dead ends: 2021 [2019-10-13 19:46:05,874 INFO L226 Difference]: Without dead ends: 1364 [2019-10-13 19:46:05,877 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:05,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-10-13 19:46:05,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 691. [2019-10-13 19:46:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-10-13 19:46:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1040 transitions. [2019-10-13 19:46:05,948 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1040 transitions. Word has length 105 [2019-10-13 19:46:05,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:05,949 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1040 transitions. [2019-10-13 19:46:05,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1040 transitions. [2019-10-13 19:46:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:46:05,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:05,954 INFO L380 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] [2019-10-13 19:46:05,955 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:05,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:05,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1322406660, now seen corresponding path program 1 times [2019-10-13 19:46:05,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:05,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702198157] [2019-10-13 19:46:05,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:05,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:05,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:06,466 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:46:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:06,498 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-13 19:46:06,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702198157] [2019-10-13 19:46:06,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:06,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:06,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520071182] [2019-10-13 19:46:06,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:06,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:06,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:06,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:06,502 INFO L87 Difference]: Start difference. First operand 691 states and 1040 transitions. Second operand 4 states. [2019-10-13 19:46:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:08,685 INFO L93 Difference]: Finished difference Result 1822 states and 2765 transitions. [2019-10-13 19:46:08,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:08,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 19:46:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:08,700 INFO L225 Difference]: With dead ends: 1822 [2019-10-13 19:46:08,700 INFO L226 Difference]: Without dead ends: 1330 [2019-10-13 19:46:08,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-10-13 19:46:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2019-10-13 19:46:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2019-10-13 19:46:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1983 transitions. [2019-10-13 19:46:08,809 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1983 transitions. Word has length 106 [2019-10-13 19:46:08,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:08,813 INFO L462 AbstractCegarLoop]: Abstraction has 1328 states and 1983 transitions. [2019-10-13 19:46:08,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1983 transitions. [2019-10-13 19:46:08,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:46:08,817 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:08,818 INFO L380 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] [2019-10-13 19:46:08,818 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:08,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:08,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1537198239, now seen corresponding path program 1 times [2019-10-13 19:46:08,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:08,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898372641] [2019-10-13 19:46:08,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:08,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:08,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:09,351 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:46:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:09,469 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-13 19:46:09,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898372641] [2019-10-13 19:46:09,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:09,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:09,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690448737] [2019-10-13 19:46:09,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:09,474 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:09,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:09,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:09,475 INFO L87 Difference]: Start difference. First operand 1328 states and 1983 transitions. Second operand 5 states. [2019-10-13 19:46:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:10,588 INFO L93 Difference]: Finished difference Result 2157 states and 3243 transitions. [2019-10-13 19:46:10,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:10,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 19:46:10,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:10,596 INFO L225 Difference]: With dead ends: 2157 [2019-10-13 19:46:10,596 INFO L226 Difference]: Without dead ends: 1016 [2019-10-13 19:46:10,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:46:10,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-10-13 19:46:10,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2019-10-13 19:46:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2019-10-13 19:46:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1511 transitions. [2019-10-13 19:46:10,658 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1511 transitions. Word has length 106 [2019-10-13 19:46:10,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:10,660 INFO L462 AbstractCegarLoop]: Abstraction has 1016 states and 1511 transitions. [2019-10-13 19:46:10,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1511 transitions. [2019-10-13 19:46:10,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:46:10,662 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:10,662 INFO L380 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] [2019-10-13 19:46:10,663 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:10,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:10,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1464646849, now seen corresponding path program 1 times [2019-10-13 19:46:10,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:10,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129323206] [2019-10-13 19:46:10,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:10,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:10,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:10,954 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:46:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:11,010 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-13 19:46:11,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129323206] [2019-10-13 19:46:11,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:11,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:11,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358184543] [2019-10-13 19:46:11,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:11,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:11,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:11,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:11,022 INFO L87 Difference]: Start difference. First operand 1016 states and 1511 transitions. Second operand 4 states. [2019-10-13 19:46:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:12,266 INFO L93 Difference]: Finished difference Result 2291 states and 3531 transitions. [2019-10-13 19:46:12,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:12,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 19:46:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:12,277 INFO L225 Difference]: With dead ends: 2291 [2019-10-13 19:46:12,277 INFO L226 Difference]: Without dead ends: 1464 [2019-10-13 19:46:12,280 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-10-13 19:46:12,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1432. [2019-10-13 19:46:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-10-13 19:46:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2190 transitions. [2019-10-13 19:46:12,350 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2190 transitions. Word has length 106 [2019-10-13 19:46:12,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:12,354 INFO L462 AbstractCegarLoop]: Abstraction has 1432 states and 2190 transitions. [2019-10-13 19:46:12,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2190 transitions. [2019-10-13 19:46:12,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 19:46:12,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:12,357 INFO L380 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] [2019-10-13 19:46:12,358 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:12,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:12,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1043553758, now seen corresponding path program 1 times [2019-10-13 19:46:12,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:12,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800221334] [2019-10-13 19:46:12,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:12,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:12,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:12,674 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:46:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:12,698 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-13 19:46:12,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800221334] [2019-10-13 19:46:12,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:12,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:12,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146611501] [2019-10-13 19:46:12,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:12,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:12,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:12,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:12,701 INFO L87 Difference]: Start difference. First operand 1432 states and 2190 transitions. Second operand 4 states. [2019-10-13 19:46:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:14,017 INFO L93 Difference]: Finished difference Result 3397 states and 5357 transitions. [2019-10-13 19:46:14,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:14,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-10-13 19:46:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:14,030 INFO L225 Difference]: With dead ends: 3397 [2019-10-13 19:46:14,030 INFO L226 Difference]: Without dead ends: 2238 [2019-10-13 19:46:14,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2019-10-13 19:46:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2176. [2019-10-13 19:46:14,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-10-13 19:46:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3396 transitions. [2019-10-13 19:46:14,152 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3396 transitions. Word has length 108 [2019-10-13 19:46:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:14,153 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 3396 transitions. [2019-10-13 19:46:14,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3396 transitions. [2019-10-13 19:46:14,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 19:46:14,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:14,156 INFO L380 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] [2019-10-13 19:46:14,156 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:14,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:14,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1020043605, now seen corresponding path program 1 times [2019-10-13 19:46:14,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:14,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577073127] [2019-10-13 19:46:14,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:14,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:14,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:14,598 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:46:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:14,639 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-13 19:46:14,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577073127] [2019-10-13 19:46:14,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:14,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:14,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135254218] [2019-10-13 19:46:14,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:46:14,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:14,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:46:14,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:46:14,644 INFO L87 Difference]: Start difference. First operand 2176 states and 3396 transitions. Second operand 6 states. [2019-10-13 19:46:14,915 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-10-13 19:46:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:15,993 INFO L93 Difference]: Finished difference Result 4171 states and 6562 transitions. [2019-10-13 19:46:15,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:46:15,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-10-13 19:46:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:16,004 INFO L225 Difference]: With dead ends: 4171 [2019-10-13 19:46:16,004 INFO L226 Difference]: Without dead ends: 2178 [2019-10-13 19:46:16,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:46:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2019-10-13 19:46:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 2176. [2019-10-13 19:46:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-10-13 19:46:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3381 transitions. [2019-10-13 19:46:16,113 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3381 transitions. Word has length 109 [2019-10-13 19:46:16,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:16,114 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 3381 transitions. [2019-10-13 19:46:16,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:46:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3381 transitions. [2019-10-13 19:46:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 19:46:16,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:16,116 INFO L380 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] [2019-10-13 19:46:16,116 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash 802679046, now seen corresponding path program 1 times [2019-10-13 19:46:16,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:16,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198646723] [2019-10-13 19:46:16,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:16,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:16,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:16,509 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:46:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:16,543 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-13 19:46:16,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198646723] [2019-10-13 19:46:16,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:16,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:16,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375954395] [2019-10-13 19:46:16,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:16,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:16,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:16,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:16,552 INFO L87 Difference]: Start difference. First operand 2176 states and 3381 transitions. Second operand 5 states. [2019-10-13 19:46:18,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:18,083 INFO L93 Difference]: Finished difference Result 5611 states and 8738 transitions. [2019-10-13 19:46:18,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:18,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-13 19:46:18,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:18,099 INFO L225 Difference]: With dead ends: 5611 [2019-10-13 19:46:18,100 INFO L226 Difference]: Without dead ends: 3458 [2019-10-13 19:46:18,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:46:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2019-10-13 19:46:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3456. [2019-10-13 19:46:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3456 states. [2019-10-13 19:46:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 3456 states and 5341 transitions. [2019-10-13 19:46:18,296 INFO L78 Accepts]: Start accepts. Automaton has 3456 states and 5341 transitions. Word has length 109 [2019-10-13 19:46:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:18,296 INFO L462 AbstractCegarLoop]: Abstraction has 3456 states and 5341 transitions. [2019-10-13 19:46:18,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3456 states and 5341 transitions. [2019-10-13 19:46:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 19:46:18,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:18,301 INFO L380 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] [2019-10-13 19:46:18,301 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:18,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:18,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2079942452, now seen corresponding path program 1 times [2019-10-13 19:46:18,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:18,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600267515] [2019-10-13 19:46:18,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:18,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:18,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:18,618 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:46:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:18,653 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-13 19:46:18,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600267515] [2019-10-13 19:46:18,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:18,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:18,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267874076] [2019-10-13 19:46:18,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:18,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:18,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:18,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:18,656 INFO L87 Difference]: Start difference. First operand 3456 states and 5341 transitions. Second operand 4 states. [2019-10-13 19:46:20,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:20,532 INFO L93 Difference]: Finished difference Result 9594 states and 14954 transitions. [2019-10-13 19:46:20,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:20,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-13 19:46:20,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:20,559 INFO L225 Difference]: With dead ends: 9594 [2019-10-13 19:46:20,560 INFO L226 Difference]: Without dead ends: 6514 [2019-10-13 19:46:20,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2019-10-13 19:46:20,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6512. [2019-10-13 19:46:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2019-10-13 19:46:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 10016 transitions. [2019-10-13 19:46:20,956 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 10016 transitions. Word has length 111 [2019-10-13 19:46:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:20,956 INFO L462 AbstractCegarLoop]: Abstraction has 6512 states and 10016 transitions. [2019-10-13 19:46:20,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 10016 transitions. [2019-10-13 19:46:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 19:46:20,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:20,961 INFO L380 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] [2019-10-13 19:46:20,961 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:20,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:20,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2028254793, now seen corresponding path program 1 times [2019-10-13 19:46:20,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:20,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754361019] [2019-10-13 19:46:20,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:20,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:20,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:21,282 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:46:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:21,307 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-13 19:46:21,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754361019] [2019-10-13 19:46:21,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:21,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:21,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349869972] [2019-10-13 19:46:21,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:21,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:21,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:21,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:21,309 INFO L87 Difference]: Start difference. First operand 6512 states and 10016 transitions. Second operand 5 states. [2019-10-13 19:46:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:22,455 INFO L93 Difference]: Finished difference Result 10292 states and 15865 transitions. [2019-10-13 19:46:22,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:22,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-13 19:46:22,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:22,475 INFO L225 Difference]: With dead ends: 10292 [2019-10-13 19:46:22,476 INFO L226 Difference]: Without dead ends: 5311 [2019-10-13 19:46:22,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:46:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-10-13 19:46:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 5311. [2019-10-13 19:46:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5311 states. [2019-10-13 19:46:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5311 states to 5311 states and 8136 transitions. [2019-10-13 19:46:22,723 INFO L78 Accepts]: Start accepts. Automaton has 5311 states and 8136 transitions. Word has length 111 [2019-10-13 19:46:22,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:22,723 INFO L462 AbstractCegarLoop]: Abstraction has 5311 states and 8136 transitions. [2019-10-13 19:46:22,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:22,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5311 states and 8136 transitions. [2019-10-13 19:46:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 19:46:22,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:22,727 INFO L380 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] [2019-10-13 19:46:22,727 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:22,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:22,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1274580373, now seen corresponding path program 1 times [2019-10-13 19:46:22,728 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:22,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166489385] [2019-10-13 19:46:22,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:22,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:22,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:22,995 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:46:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:23,017 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-13 19:46:23,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166489385] [2019-10-13 19:46:23,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:23,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:23,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848115286] [2019-10-13 19:46:23,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:23,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:23,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:23,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:23,020 INFO L87 Difference]: Start difference. First operand 5311 states and 8136 transitions. Second operand 4 states. [2019-10-13 19:46:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:24,534 INFO L93 Difference]: Finished difference Result 13935 states and 21751 transitions. [2019-10-13 19:46:24,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:24,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-13 19:46:24,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:24,565 INFO L225 Difference]: With dead ends: 13935 [2019-10-13 19:46:24,565 INFO L226 Difference]: Without dead ends: 8965 [2019-10-13 19:46:24,575 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:24,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8965 states. [2019-10-13 19:46:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8965 to 8683. [2019-10-13 19:46:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8683 states. [2019-10-13 19:46:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8683 states to 8683 states and 13503 transitions. [2019-10-13 19:46:24,926 INFO L78 Accepts]: Start accepts. Automaton has 8683 states and 13503 transitions. Word has length 113 [2019-10-13 19:46:24,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:24,926 INFO L462 AbstractCegarLoop]: Abstraction has 8683 states and 13503 transitions. [2019-10-13 19:46:24,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 8683 states and 13503 transitions. [2019-10-13 19:46:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 19:46:24,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:24,930 INFO L380 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] [2019-10-13 19:46:24,930 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash 723633182, now seen corresponding path program 1 times [2019-10-13 19:46:24,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:24,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504859740] [2019-10-13 19:46:24,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:24,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:24,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:25,510 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:46:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:25,563 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-13 19:46:25,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504859740] [2019-10-13 19:46:25,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:25,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:25,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943867000] [2019-10-13 19:46:25,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:25,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:25,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:25,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:25,568 INFO L87 Difference]: Start difference. First operand 8683 states and 13503 transitions. Second operand 5 states. [2019-10-13 19:46:27,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:27,538 INFO L93 Difference]: Finished difference Result 24205 states and 37580 transitions. [2019-10-13 19:46:27,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:27,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-10-13 19:46:27,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:27,578 INFO L225 Difference]: With dead ends: 24205 [2019-10-13 19:46:27,578 INFO L226 Difference]: Without dead ends: 15565 [2019-10-13 19:46:27,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:46:27,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15565 states. [2019-10-13 19:46:28,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15565 to 15563. [2019-10-13 19:46:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15563 states. [2019-10-13 19:46:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15563 states to 15563 states and 23928 transitions. [2019-10-13 19:46:28,836 INFO L78 Accepts]: Start accepts. Automaton has 15563 states and 23928 transitions. Word has length 114 [2019-10-13 19:46:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:28,836 INFO L462 AbstractCegarLoop]: Abstraction has 15563 states and 23928 transitions. [2019-10-13 19:46:28,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 15563 states and 23928 transitions. [2019-10-13 19:46:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 19:46:28,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:28,844 INFO L380 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] [2019-10-13 19:46:28,844 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:28,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1996953920, now seen corresponding path program 1 times [2019-10-13 19:46:28,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:28,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064375206] [2019-10-13 19:46:28,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:28,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:28,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:29,075 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:46:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:29,098 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-13 19:46:29,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064375206] [2019-10-13 19:46:29,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:29,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:29,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648427173] [2019-10-13 19:46:29,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:29,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:29,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:29,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:29,100 INFO L87 Difference]: Start difference. First operand 15563 states and 23928 transitions. Second operand 4 states.