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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:44:37,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:44:37,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:44:37,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:44:37,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:44:37,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:44:37,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:44:37,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:44:37,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:44:37,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:44:37,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:44:37,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:44:37,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:44:37,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:44:37,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:44:37,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:44:37,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:44:37,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:44:37,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:44:37,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:44:37,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:44:37,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:44:37,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:44:37,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:44:37,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:44:37,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:44:37,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:44:37,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:44:37,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:44:37,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:44:37,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:44:37,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:44:37,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:44:37,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:44:37,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:44:37,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:44:37,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:44:37,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:44:37,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:44:37,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:44:37,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:44:37,555 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:44:37,573 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:44:37,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:44:37,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:44:37,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:44:37,578 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:44:37,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:44:37,579 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:44:37,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:44:37,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:44:37,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:44:37,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:44:37,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:44:37,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:44:37,580 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:44:37,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:44:37,581 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:44:37,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:44:37,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:44:37,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:44:37,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:44:37,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:44:37,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:44:37,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:44:37,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:44:37,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:44:37,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:44:37,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:44:37,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:44:37,585 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:44:37,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:44:37,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:44:37,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:44:37,891 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:44:37,891 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:44:37,892 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 19:44:37,969 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f43e8b2a/77cb212be00d410ba1894c501cb7566b/FLAGcdce039b0 [2019-10-13 19:44:38,549 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:44:38,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 19:44:38,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f43e8b2a/77cb212be00d410ba1894c501cb7566b/FLAGcdce039b0 [2019-10-13 19:44:38,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f43e8b2a/77cb212be00d410ba1894c501cb7566b [2019-10-13 19:44:38,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:44:38,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:44:38,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:44:38,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:44:38,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:44:38,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:44:38" (1/1) ... [2019-10-13 19:44:38,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50cbd6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:38, skipping insertion in model container [2019-10-13 19:44:38,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:44:38" (1/1) ... [2019-10-13 19:44:38,832 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:44:38,883 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:44:39,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:44:39,360 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:44:39,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:44:39,518 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:44:39,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:39 WrapperNode [2019-10-13 19:44:39,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:44:39,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:44:39,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:44:39,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:44:39,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:39" (1/1) ... [2019-10-13 19:44:39,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:39" (1/1) ... [2019-10-13 19:44:39,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:39" (1/1) ... [2019-10-13 19:44:39,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:39" (1/1) ... [2019-10-13 19:44:39,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:39" (1/1) ... [2019-10-13 19:44:39,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:39" (1/1) ... [2019-10-13 19:44:39,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:39" (1/1) ... [2019-10-13 19:44:39,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:44:39,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:44:39,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:44:39,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:44:39,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:39" (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:44:39,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:44:39,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:44:39,708 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:44:39,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:44:39,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:44:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 19:44:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 19:44:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:44:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 19:44:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 19:44:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 19:44:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 19:44:39,712 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 19:44:39,712 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 19:44:39,713 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 19:44:39,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:44:39,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:44:39,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:44:41,038 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:44:41,038 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 19:44:41,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:44:41 BoogieIcfgContainer [2019-10-13 19:44:41,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:44:41,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:44:41,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:44:41,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:44:41,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:44:38" (1/3) ... [2019-10-13 19:44:41,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aabe20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:44:41, skipping insertion in model container [2019-10-13 19:44:41,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:39" (2/3) ... [2019-10-13 19:44:41,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aabe20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:44:41, skipping insertion in model container [2019-10-13 19:44:41,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:44:41" (3/3) ... [2019-10-13 19:44:41,055 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 19:44:41,066 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:44:41,094 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-13 19:44:41,107 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-13 19:44:41,149 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:44:41,149 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:44:41,150 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:44:41,150 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:44:41,150 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:44:41,151 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:44:41,151 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:44:41,151 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:44:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states. [2019-10-13 19:44:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 19:44:41,204 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:41,205 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] [2019-10-13 19:44:41,207 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:41,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:41,212 INFO L82 PathProgramCache]: Analyzing trace with hash 621454591, now seen corresponding path program 1 times [2019-10-13 19:44:41,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:41,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787441833] [2019-10-13 19:44:41,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:41,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:41,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:42,212 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:44:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:42,295 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:44:42,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787441833] [2019-10-13 19:44:42,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:42,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:42,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830045990] [2019-10-13 19:44:42,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:44:42,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:42,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:44:42,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:42,345 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 5 states. [2019-10-13 19:44:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:44,610 INFO L93 Difference]: Finished difference Result 692 states and 1230 transitions. [2019-10-13 19:44:44,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:44:44,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-10-13 19:44:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:44,630 INFO L225 Difference]: With dead ends: 692 [2019-10-13 19:44:44,631 INFO L226 Difference]: Without dead ends: 455 [2019-10-13 19:44:44,636 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:44:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-10-13 19:44:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 435. [2019-10-13 19:44:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-10-13 19:44:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 633 transitions. [2019-10-13 19:44:44,728 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 633 transitions. Word has length 95 [2019-10-13 19:44:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:44,730 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 633 transitions. [2019-10-13 19:44:44,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:44:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 633 transitions. [2019-10-13 19:44:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 19:44:44,743 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:44,743 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] [2019-10-13 19:44:44,743 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:44,744 INFO L82 PathProgramCache]: Analyzing trace with hash -12071785, now seen corresponding path program 1 times [2019-10-13 19:44:44,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:44,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736726917] [2019-10-13 19:44:44,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:44,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:44,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:45,053 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:44:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:45,078 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:44:45,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736726917] [2019-10-13 19:44:45,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:45,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:44:45,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875904360] [2019-10-13 19:44:45,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:44:45,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:45,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:44:45,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:45,082 INFO L87 Difference]: Start difference. First operand 435 states and 633 transitions. Second operand 4 states. [2019-10-13 19:44:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:47,007 INFO L93 Difference]: Finished difference Result 1259 states and 1829 transitions. [2019-10-13 19:44:47,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:44:47,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-10-13 19:44:47,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:47,015 INFO L225 Difference]: With dead ends: 1259 [2019-10-13 19:44:47,016 INFO L226 Difference]: Without dead ends: 856 [2019-10-13 19:44:47,019 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:44:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-10-13 19:44:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 437. [2019-10-13 19:44:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-10-13 19:44:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 635 transitions. [2019-10-13 19:44:47,073 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 635 transitions. Word has length 96 [2019-10-13 19:44:47,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:47,074 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 635 transitions. [2019-10-13 19:44:47,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:44:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 635 transitions. [2019-10-13 19:44:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 19:44:47,081 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:47,081 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] [2019-10-13 19:44:47,082 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:47,082 INFO L82 PathProgramCache]: Analyzing trace with hash 551245475, now seen corresponding path program 1 times [2019-10-13 19:44:47,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:47,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418720719] [2019-10-13 19:44:47,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:47,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:47,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:47,477 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:44:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:47,510 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:44:47,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418720719] [2019-10-13 19:44:47,511 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:47,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:44:47,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126207196] [2019-10-13 19:44:47,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:44:47,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:47,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:44:47,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:47,513 INFO L87 Difference]: Start difference. First operand 437 states and 635 transitions. Second operand 4 states. [2019-10-13 19:44:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:49,237 INFO L93 Difference]: Finished difference Result 1094 states and 1608 transitions. [2019-10-13 19:44:49,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:44:49,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-13 19:44:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:49,245 INFO L225 Difference]: With dead ends: 1094 [2019-10-13 19:44:49,245 INFO L226 Difference]: Without dead ends: 839 [2019-10-13 19:44:49,247 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:44:49,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-10-13 19:44:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 821. [2019-10-13 19:44:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-10-13 19:44:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1189 transitions. [2019-10-13 19:44:49,292 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1189 transitions. Word has length 97 [2019-10-13 19:44:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:49,293 INFO L462 AbstractCegarLoop]: Abstraction has 821 states and 1189 transitions. [2019-10-13 19:44:49,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:44:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1189 transitions. [2019-10-13 19:44:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 19:44:49,295 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:49,296 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] [2019-10-13 19:44:49,296 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:49,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:49,296 INFO L82 PathProgramCache]: Analyzing trace with hash -604854874, now seen corresponding path program 1 times [2019-10-13 19:44:49,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:49,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900614435] [2019-10-13 19:44:49,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:49,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:49,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:49,627 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:44:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:49,665 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:44:49,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900614435] [2019-10-13 19:44:49,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:49,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:49,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795118047] [2019-10-13 19:44:49,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:44:49,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:49,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:44:49,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:49,668 INFO L87 Difference]: Start difference. First operand 821 states and 1189 transitions. Second operand 5 states. [2019-10-13 19:44:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:50,800 INFO L93 Difference]: Finished difference Result 1281 states and 1871 transitions. [2019-10-13 19:44:50,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:44:50,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-10-13 19:44:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:50,804 INFO L225 Difference]: With dead ends: 1281 [2019-10-13 19:44:50,805 INFO L226 Difference]: Without dead ends: 632 [2019-10-13 19:44:50,807 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:44:50,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-13 19:44:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-13 19:44:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-13 19:44:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 909 transitions. [2019-10-13 19:44:50,841 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 909 transitions. Word has length 97 [2019-10-13 19:44:50,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:50,841 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 909 transitions. [2019-10-13 19:44:50,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:44:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 909 transitions. [2019-10-13 19:44:50,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 19:44:50,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:50,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] [2019-10-13 19:44:50,844 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:50,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:50,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1078583877, now seen corresponding path program 1 times [2019-10-13 19:44:50,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:50,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704464375] [2019-10-13 19:44:50,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:50,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:50,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:51,358 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:44:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:51,410 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:44:51,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704464375] [2019-10-13 19:44:51,412 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:51,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:51,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244614278] [2019-10-13 19:44:51,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:44:51,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:51,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:44:51,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:44:51,416 INFO L87 Difference]: Start difference. First operand 632 states and 909 transitions. Second operand 6 states. [2019-10-13 19:44:51,844 WARN L191 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2019-10-13 19:44:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:53,439 INFO L93 Difference]: Finished difference Result 1328 states and 1993 transitions. [2019-10-13 19:44:53,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:44:53,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-13 19:44:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:53,447 INFO L225 Difference]: With dead ends: 1328 [2019-10-13 19:44:53,447 INFO L226 Difference]: Without dead ends: 867 [2019-10-13 19:44:53,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:44:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-10-13 19:44:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2019-10-13 19:44:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-10-13 19:44:53,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1286 transitions. [2019-10-13 19:44:53,507 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1286 transitions. Word has length 99 [2019-10-13 19:44:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:53,507 INFO L462 AbstractCegarLoop]: Abstraction has 865 states and 1286 transitions. [2019-10-13 19:44:53,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:44:53,508 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1286 transitions. [2019-10-13 19:44:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 19:44:53,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:53,510 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] [2019-10-13 19:44:53,510 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:53,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:53,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1205034742, now seen corresponding path program 1 times [2019-10-13 19:44:53,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:53,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509628849] [2019-10-13 19:44:53,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:53,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:53,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:53,921 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:44:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:53,952 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:44:53,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509628849] [2019-10-13 19:44:53,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:53,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:53,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821776177] [2019-10-13 19:44:53,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:44:53,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:53,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:44:53,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:53,955 INFO L87 Difference]: Start difference. First operand 865 states and 1286 transitions. Second operand 5 states. [2019-10-13 19:44:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:55,696 INFO L93 Difference]: Finished difference Result 2160 states and 3219 transitions. [2019-10-13 19:44:55,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:44:55,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-13 19:44:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:55,705 INFO L225 Difference]: With dead ends: 2160 [2019-10-13 19:44:55,706 INFO L226 Difference]: Without dead ends: 1318 [2019-10-13 19:44:55,709 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:44:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2019-10-13 19:44:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1304. [2019-10-13 19:44:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2019-10-13 19:44:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1930 transitions. [2019-10-13 19:44:55,854 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1930 transitions. Word has length 99 [2019-10-13 19:44:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:55,856 INFO L462 AbstractCegarLoop]: Abstraction has 1304 states and 1930 transitions. [2019-10-13 19:44:55,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:44:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1930 transitions. [2019-10-13 19:44:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 19:44:55,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:55,865 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] [2019-10-13 19:44:55,866 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:55,866 INFO L82 PathProgramCache]: Analyzing trace with hash 2136447595, now seen corresponding path program 1 times [2019-10-13 19:44:55,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:55,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524742766] [2019-10-13 19:44:55,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:55,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:55,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:56,196 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:44:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:56,222 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:44:56,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524742766] [2019-10-13 19:44:56,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:56,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:56,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866386150] [2019-10-13 19:44:56,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:44:56,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:56,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:44:56,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:56,225 INFO L87 Difference]: Start difference. First operand 1304 states and 1930 transitions. Second operand 5 states. [2019-10-13 19:44:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:57,154 INFO L93 Difference]: Finished difference Result 2251 states and 3353 transitions. [2019-10-13 19:44:57,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:44:57,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-10-13 19:44:57,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:57,159 INFO L225 Difference]: With dead ends: 2251 [2019-10-13 19:44:57,160 INFO L226 Difference]: Without dead ends: 1304 [2019-10-13 19:44:57,162 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:44:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2019-10-13 19:44:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2019-10-13 19:44:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2019-10-13 19:44:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1929 transitions. [2019-10-13 19:44:57,256 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1929 transitions. Word has length 101 [2019-10-13 19:44:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:57,256 INFO L462 AbstractCegarLoop]: Abstraction has 1304 states and 1929 transitions. [2019-10-13 19:44:57,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:44:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1929 transitions. [2019-10-13 19:44:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 19:44:57,258 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:57,259 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] [2019-10-13 19:44:57,259 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:57,260 INFO L82 PathProgramCache]: Analyzing trace with hash 752353320, now seen corresponding path program 1 times [2019-10-13 19:44:57,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:57,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455113559] [2019-10-13 19:44:57,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:57,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:57,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:57,581 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:44:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:57,624 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:44:57,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455113559] [2019-10-13 19:44:57,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:57,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:44:57,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813635749] [2019-10-13 19:44:57,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:44:57,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:57,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:44:57,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:57,628 INFO L87 Difference]: Start difference. First operand 1304 states and 1929 transitions. Second operand 4 states. [2019-10-13 19:44:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:59,263 INFO L93 Difference]: Finished difference Result 2939 states and 4429 transitions. [2019-10-13 19:44:59,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:44:59,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-13 19:44:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:59,277 INFO L225 Difference]: With dead ends: 2939 [2019-10-13 19:44:59,278 INFO L226 Difference]: Without dead ends: 1968 [2019-10-13 19:44:59,281 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:44:59,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2019-10-13 19:44:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1956. [2019-10-13 19:44:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2019-10-13 19:44:59,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2882 transitions. [2019-10-13 19:44:59,407 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2882 transitions. Word has length 101 [2019-10-13 19:44:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:59,409 INFO L462 AbstractCegarLoop]: Abstraction has 1956 states and 2882 transitions. [2019-10-13 19:44:59,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:44:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2882 transitions. [2019-10-13 19:44:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 19:44:59,412 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:59,412 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] [2019-10-13 19:44:59,412 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash -401467718, now seen corresponding path program 1 times [2019-10-13 19:44:59,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:59,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181687169] [2019-10-13 19:44:59,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:59,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:59,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:59,852 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:44:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:59,884 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:44:59,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181687169] [2019-10-13 19:44:59,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:59,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:59,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491694318] [2019-10-13 19:44:59,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:44:59,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:59,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:44:59,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:59,887 INFO L87 Difference]: Start difference. First operand 1956 states and 2882 transitions. Second operand 5 states. [2019-10-13 19:45:01,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:01,103 INFO L93 Difference]: Finished difference Result 5625 states and 8282 transitions. [2019-10-13 19:45:01,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:01,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-13 19:45:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:01,126 INFO L225 Difference]: With dead ends: 5625 [2019-10-13 19:45:01,127 INFO L226 Difference]: Without dead ends: 3712 [2019-10-13 19:45:01,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 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:45:01,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2019-10-13 19:45:01,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3639. [2019-10-13 19:45:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2019-10-13 19:45:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 5322 transitions. [2019-10-13 19:45:01,344 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 5322 transitions. Word has length 103 [2019-10-13 19:45:01,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:01,345 INFO L462 AbstractCegarLoop]: Abstraction has 3639 states and 5322 transitions. [2019-10-13 19:45:01,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 5322 transitions. [2019-10-13 19:45:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:45:01,351 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:01,351 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:01,351 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash -344356272, now seen corresponding path program 1 times [2019-10-13 19:45:01,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:01,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625750283] [2019-10-13 19:45:01,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:01,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:01,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:01,601 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:45:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:01,623 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:01,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625750283] [2019-10-13 19:45:01,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:01,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:01,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528277463] [2019-10-13 19:45:01,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:01,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:01,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:01,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:01,625 INFO L87 Difference]: Start difference. First operand 3639 states and 5322 transitions. Second operand 4 states. [2019-10-13 19:45:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:02,854 INFO L93 Difference]: Finished difference Result 10723 states and 15717 transitions. [2019-10-13 19:45:02,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:02,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-13 19:45:02,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:02,887 INFO L225 Difference]: With dead ends: 10723 [2019-10-13 19:45:02,888 INFO L226 Difference]: Without dead ends: 7190 [2019-10-13 19:45:02,897 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:45:02,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7190 states. [2019-10-13 19:45:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7190 to 3645. [2019-10-13 19:45:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3645 states. [2019-10-13 19:45:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 5328 transitions. [2019-10-13 19:45:03,135 INFO L78 Accepts]: Start accepts. Automaton has 3645 states and 5328 transitions. Word has length 104 [2019-10-13 19:45:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:03,136 INFO L462 AbstractCegarLoop]: Abstraction has 3645 states and 5328 transitions. [2019-10-13 19:45:03,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3645 states and 5328 transitions. [2019-10-13 19:45:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:45:03,140 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:03,140 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:45:03,141 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:03,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1407880473, now seen corresponding path program 1 times [2019-10-13 19:45:03,141 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:03,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734724820] [2019-10-13 19:45:03,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:03,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:03,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:03,465 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:45:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:03,491 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:03,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734724820] [2019-10-13 19:45:03,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:03,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:03,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150128926] [2019-10-13 19:45:03,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:03,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:03,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:03,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:03,493 INFO L87 Difference]: Start difference. First operand 3645 states and 5328 transitions. Second operand 5 states. [2019-10-13 19:45:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:04,505 INFO L93 Difference]: Finished difference Result 7248 states and 10600 transitions. [2019-10-13 19:45:04,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:04,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-13 19:45:04,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:04,518 INFO L225 Difference]: With dead ends: 7248 [2019-10-13 19:45:04,518 INFO L226 Difference]: Without dead ends: 3639 [2019-10-13 19:45:04,525 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:45:04,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2019-10-13 19:45:04,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3639. [2019-10-13 19:45:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3639 states. [2019-10-13 19:45:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 5316 transitions. [2019-10-13 19:45:04,709 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 5316 transitions. Word has length 105 [2019-10-13 19:45:04,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:04,710 INFO L462 AbstractCegarLoop]: Abstraction has 3639 states and 5316 transitions. [2019-10-13 19:45:04,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:04,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 5316 transitions. [2019-10-13 19:45:04,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:45:04,714 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:04,714 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:45:04,714 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:04,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:04,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1322542982, now seen corresponding path program 1 times [2019-10-13 19:45:04,715 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:04,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763384071] [2019-10-13 19:45:04,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:04,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:04,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:04,972 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:45:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:05,002 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:05,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763384071] [2019-10-13 19:45:05,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:05,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:05,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708873339] [2019-10-13 19:45:05,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:05,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:05,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:05,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:05,005 INFO L87 Difference]: Start difference. First operand 3639 states and 5316 transitions. Second operand 4 states. [2019-10-13 19:45:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:06,734 INFO L93 Difference]: Finished difference Result 8390 states and 12380 transitions. [2019-10-13 19:45:06,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:06,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-13 19:45:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:06,758 INFO L225 Difference]: With dead ends: 8390 [2019-10-13 19:45:06,758 INFO L226 Difference]: Without dead ends: 5435 [2019-10-13 19:45:06,765 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:45:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5435 states. [2019-10-13 19:45:07,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5435 to 5362. [2019-10-13 19:45:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5362 states. [2019-10-13 19:45:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5362 states to 5362 states and 7702 transitions. [2019-10-13 19:45:07,120 INFO L78 Accepts]: Start accepts. Automaton has 5362 states and 7702 transitions. Word has length 105 [2019-10-13 19:45:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:07,121 INFO L462 AbstractCegarLoop]: Abstraction has 5362 states and 7702 transitions. [2019-10-13 19:45:07,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5362 states and 7702 transitions. [2019-10-13 19:45:07,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 19:45:07,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:07,127 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] [2019-10-13 19:45:07,128 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:07,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:07,128 INFO L82 PathProgramCache]: Analyzing trace with hash 826091784, now seen corresponding path program 1 times [2019-10-13 19:45:07,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:07,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572327542] [2019-10-13 19:45:07,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:07,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:07,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:07,568 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:45:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:07,610 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:07,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572327542] [2019-10-13 19:45:07,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:07,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 19:45:07,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729317384] [2019-10-13 19:45:07,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 19:45:07,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:07,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 19:45:07,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:45:07,612 INFO L87 Difference]: Start difference. First operand 5362 states and 7702 transitions. Second operand 13 states. [2019-10-13 19:45:07,888 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-10-13 19:45:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:10,203 INFO L93 Difference]: Finished difference Result 15774 states and 23850 transitions. [2019-10-13 19:45:10,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:45:10,204 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 107 [2019-10-13 19:45:10,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:10,232 INFO L225 Difference]: With dead ends: 15774 [2019-10-13 19:45:10,232 INFO L226 Difference]: Without dead ends: 12444 [2019-10-13 19:45:10,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-10-13 19:45:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12444 states. [2019-10-13 19:45:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12444 to 10908. [2019-10-13 19:45:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10908 states. [2019-10-13 19:45:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10908 states to 10908 states and 16052 transitions. [2019-10-13 19:45:10,877 INFO L78 Accepts]: Start accepts. Automaton has 10908 states and 16052 transitions. Word has length 107 [2019-10-13 19:45:10,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:10,878 INFO L462 AbstractCegarLoop]: Abstraction has 10908 states and 16052 transitions. [2019-10-13 19:45:10,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 19:45:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 10908 states and 16052 transitions. [2019-10-13 19:45:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 19:45:10,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:10,886 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] [2019-10-13 19:45:10,886 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:10,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:10,887 INFO L82 PathProgramCache]: Analyzing trace with hash -583385139, now seen corresponding path program 1 times [2019-10-13 19:45:10,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:10,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497037453] [2019-10-13 19:45:10,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:10,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:10,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:11,296 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:45:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:11,324 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:11,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497037453] [2019-10-13 19:45:11,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:11,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 19:45:11,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997853514] [2019-10-13 19:45:11,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:45:11,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:11,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:45:11,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:45:11,326 INFO L87 Difference]: Start difference. First operand 10908 states and 16052 transitions. Second operand 9 states. [2019-10-13 19:45:11,564 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-10-13 19:45:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:12,860 INFO L93 Difference]: Finished difference Result 15628 states and 23581 transitions. [2019-10-13 19:45:12,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:45:12,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 107 [2019-10-13 19:45:12,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:12,878 INFO L225 Difference]: With dead ends: 15628 [2019-10-13 19:45:12,879 INFO L226 Difference]: Without dead ends: 7884 [2019-10-13 19:45:12,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:45:12,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7884 states.