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.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:44:49,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:44:49,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:44:49,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:44:49,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:44:49,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:44:49,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:44:49,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:44:49,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:44:49,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:44:49,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:44:49,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:44:49,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:44:49,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:44:49,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:44:49,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:44:49,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:44:49,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:44:49,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:44:49,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:44:49,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:44:49,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:44:49,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:44:49,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:44:49,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:44:49,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:44:49,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:44:49,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:44:49,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:44:49,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:44:49,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:44:49,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:44:49,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:44:49,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:44:49,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:44:49,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:44:49,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:44:49,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:44:49,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:44:49,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:44:49,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:44:49,750 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:49,768 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:44:49,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:44:49,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:44:49,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:44:49,770 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:44:49,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:44:49,771 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:44:49,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:44:49,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:44:49,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:44:49,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:44:49,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:44:49,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:44:49,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:44:49,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:44:49,774 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:44:49,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:44:49,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:44:49,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:44:49,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:44:49,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:44:49,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:44:49,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:44:49,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:44:49,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:44:49,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:44:49,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:44:49,777 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:44:49,777 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:44:50,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:44:50,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:44:50,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:44:50,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:44:50,107 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:44:50,108 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 19:44:50,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d4626d0/581b535c88524a5d9c5e937e7bb28f60/FLAG851fee55f [2019-10-13 19:44:50,770 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:44:50,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 19:44:50,788 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d4626d0/581b535c88524a5d9c5e937e7bb28f60/FLAG851fee55f [2019-10-13 19:44:51,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d4626d0/581b535c88524a5d9c5e937e7bb28f60 [2019-10-13 19:44:51,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:44:51,057 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:44:51,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:44:51,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:44:51,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:44:51,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:44:51" (1/1) ... [2019-10-13 19:44:51,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59906cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:51, skipping insertion in model container [2019-10-13 19:44:51,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:44:51" (1/1) ... [2019-10-13 19:44:51,079 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:44:51,151 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:44:51,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:44:51,824 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:44:51,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:44:51,978 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:44:51,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:51 WrapperNode [2019-10-13 19:44:51,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:44:51,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:44:51,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:44:51,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:44:51,992 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:51" (1/1) ... [2019-10-13 19:44:51,992 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:51" (1/1) ... [2019-10-13 19:44:52,006 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:51" (1/1) ... [2019-10-13 19:44:52,007 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:51" (1/1) ... [2019-10-13 19:44:52,029 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:51" (1/1) ... [2019-10-13 19:44:52,048 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:51" (1/1) ... [2019-10-13 19:44:52,053 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:51" (1/1) ... [2019-10-13 19:44:52,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:44:52,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:44:52,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:44:52,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:44:52,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:51" (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:52,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:44:52,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:44:52,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:44:52,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:44:52,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:44:52,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 19:44:52,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 19:44:52,143 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 19:44:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:44:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 19:44:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 19:44:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 19:44:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 19:44:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 19:44:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 19:44:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 19:44:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:44:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:44:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:44:53,595 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:44:53,596 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 19:44:53,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:44:53 BoogieIcfgContainer [2019-10-13 19:44:53,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:44:53,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:44:53,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:44:53,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:44:53,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:44:51" (1/3) ... [2019-10-13 19:44:53,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae5f0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:44:53, skipping insertion in model container [2019-10-13 19:44:53,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:51" (2/3) ... [2019-10-13 19:44:53,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae5f0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:44:53, skipping insertion in model container [2019-10-13 19:44:53,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:44:53" (3/3) ... [2019-10-13 19:44:53,606 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 19:44:53,616 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:44:53,623 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-13 19:44:53,635 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-13 19:44:53,663 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:44:53,663 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:44:53,663 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:44:53,663 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:44:53,663 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:44:53,664 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:44:53,664 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:44:53,664 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:44:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states. [2019-10-13 19:44:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 19:44:53,700 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:53,702 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:53,704 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:53,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:53,710 INFO L82 PathProgramCache]: Analyzing trace with hash -953301641, now seen corresponding path program 1 times [2019-10-13 19:44:53,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:53,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819682930] [2019-10-13 19:44:53,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:53,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:53,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:54,707 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-13 19:44:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:54,797 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:54,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819682930] [2019-10-13 19:44:54,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:54,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:54,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710894223] [2019-10-13 19:44:54,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:44:54,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:54,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:44:54,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:54,829 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 5 states. [2019-10-13 19:44:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:57,251 INFO L93 Difference]: Finished difference Result 716 states and 1269 transitions. [2019-10-13 19:44:57,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:44:57,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-10-13 19:44:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:57,271 INFO L225 Difference]: With dead ends: 716 [2019-10-13 19:44:57,272 INFO L226 Difference]: Without dead ends: 471 [2019-10-13 19:44:57,277 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:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-10-13 19:44:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 450. [2019-10-13 19:44:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-13 19:44:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 654 transitions. [2019-10-13 19:44:57,365 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 654 transitions. Word has length 96 [2019-10-13 19:44:57,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:57,366 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 654 transitions. [2019-10-13 19:44:57,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:44:57,366 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 654 transitions. [2019-10-13 19:44:57,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 19:44:57,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:57,372 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:57,372 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:57,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:57,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2115143577, now seen corresponding path program 1 times [2019-10-13 19:44:57,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:57,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369724825] [2019-10-13 19:44:57,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:57,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:57,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:57,687 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-13 19:44:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:57,711 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,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369724825] [2019-10-13 19:44:57,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:57,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:44:57,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599166565] [2019-10-13 19:44:57,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:44:57,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:57,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:44:57,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:57,715 INFO L87 Difference]: Start difference. First operand 450 states and 654 transitions. Second operand 4 states. [2019-10-13 19:44:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:59,599 INFO L93 Difference]: Finished difference Result 1304 states and 1892 transitions. [2019-10-13 19:44:59,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:44:59,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-13 19:44:59,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:59,605 INFO L225 Difference]: With dead ends: 1304 [2019-10-13 19:44:59,605 INFO L226 Difference]: Without dead ends: 886 [2019-10-13 19:44:59,609 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,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-10-13 19:44:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 452. [2019-10-13 19:44:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-13 19:44:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 656 transitions. [2019-10-13 19:44:59,651 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 656 transitions. Word has length 97 [2019-10-13 19:44:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:59,652 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 656 transitions. [2019-10-13 19:44:59,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:44:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 656 transitions. [2019-10-13 19:44:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 19:44:59,655 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:59,655 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] [2019-10-13 19:44:59,656 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash 37790134, now seen corresponding path program 1 times [2019-10-13 19:44:59,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:59,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579385467] [2019-10-13 19:44:59,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:59,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:59,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:59,985 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-13 19:44:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:00,015 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:00,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579385467] [2019-10-13 19:45:00,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:00,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:00,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964370777] [2019-10-13 19:45:00,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:00,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:00,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:00,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:00,018 INFO L87 Difference]: Start difference. First operand 452 states and 656 transitions. Second operand 4 states. [2019-10-13 19:45:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:01,724 INFO L93 Difference]: Finished difference Result 1141 states and 1673 transitions. [2019-10-13 19:45:01,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:01,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-13 19:45:01,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:01,733 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 19:45:01,734 INFO L226 Difference]: Without dead ends: 869 [2019-10-13 19:45:01,735 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:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2019-10-13 19:45:01,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 850. [2019-10-13 19:45:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-10-13 19:45:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1230 transitions. [2019-10-13 19:45:01,789 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1230 transitions. Word has length 98 [2019-10-13 19:45:01,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:01,790 INFO L462 AbstractCegarLoop]: Abstraction has 850 states and 1230 transitions. [2019-10-13 19:45:01,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1230 transitions. [2019-10-13 19:45:01,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 19:45:01,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:01,797 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] [2019-10-13 19:45:01,797 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:01,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:01,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1441582317, now seen corresponding path program 1 times [2019-10-13 19:45:01,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:01,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266014082] [2019-10-13 19:45:01,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:01,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:01,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:02,193 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-13 19:45:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:02,221 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:02,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266014082] [2019-10-13 19:45:02,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:02,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:02,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932762523] [2019-10-13 19:45:02,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:02,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:02,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:02,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:02,225 INFO L87 Difference]: Start difference. First operand 850 states and 1230 transitions. Second operand 5 states. [2019-10-13 19:45:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:03,218 INFO L93 Difference]: Finished difference Result 1334 states and 1945 transitions. [2019-10-13 19:45:03,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:03,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-13 19:45:03,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:03,223 INFO L225 Difference]: With dead ends: 1334 [2019-10-13 19:45:03,224 INFO L226 Difference]: Without dead ends: 654 [2019-10-13 19:45:03,225 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:03,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-10-13 19:45:03,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2019-10-13 19:45:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-10-13 19:45:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 940 transitions. [2019-10-13 19:45:03,256 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 940 transitions. Word has length 98 [2019-10-13 19:45:03,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:03,256 INFO L462 AbstractCegarLoop]: Abstraction has 654 states and 940 transitions. [2019-10-13 19:45:03,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:03,257 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 940 transitions. [2019-10-13 19:45:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 19:45:03,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:03,260 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] [2019-10-13 19:45:03,261 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:03,261 INFO L82 PathProgramCache]: Analyzing trace with hash 407293187, now seen corresponding path program 1 times [2019-10-13 19:45:03,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:03,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60920298] [2019-10-13 19:45:03,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:03,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:03,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:03,780 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-13 19:45:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:03,827 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,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60920298] [2019-10-13 19:45:03,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:03,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:03,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833396396] [2019-10-13 19:45:03,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:03,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:03,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:03,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:03,834 INFO L87 Difference]: Start difference. First operand 654 states and 940 transitions. Second operand 5 states. [2019-10-13 19:45:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:05,590 INFO L93 Difference]: Finished difference Result 1607 states and 2308 transitions. [2019-10-13 19:45:05,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:05,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-13 19:45:05,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:05,597 INFO L225 Difference]: With dead ends: 1607 [2019-10-13 19:45:05,597 INFO L226 Difference]: Without dead ends: 976 [2019-10-13 19:45:05,600 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:45:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-10-13 19:45:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 962. [2019-10-13 19:45:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-10-13 19:45:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1371 transitions. [2019-10-13 19:45:05,675 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1371 transitions. Word has length 100 [2019-10-13 19:45:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:05,676 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 1371 transitions. [2019-10-13 19:45:05,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:05,678 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1371 transitions. [2019-10-13 19:45:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 19:45:05,682 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:05,682 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] [2019-10-13 19:45:05,683 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:05,685 INFO L82 PathProgramCache]: Analyzing trace with hash 987827892, now seen corresponding path program 1 times [2019-10-13 19:45:05,686 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:05,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580740250] [2019-10-13 19:45:05,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:05,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:05,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:06,106 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-13 19:45:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:06,189 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:06,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580740250] [2019-10-13 19:45:06,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:06,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:06,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464767072] [2019-10-13 19:45:06,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:06,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:06,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:06,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:06,200 INFO L87 Difference]: Start difference. First operand 962 states and 1371 transitions. Second operand 4 states. [2019-10-13 19:45:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:08,121 INFO L93 Difference]: Finished difference Result 2376 states and 3448 transitions. [2019-10-13 19:45:08,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:08,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-13 19:45:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:08,132 INFO L225 Difference]: With dead ends: 2376 [2019-10-13 19:45:08,132 INFO L226 Difference]: Without dead ends: 1742 [2019-10-13 19:45:08,134 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:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-10-13 19:45:08,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1730. [2019-10-13 19:45:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1730 states. [2019-10-13 19:45:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2469 transitions. [2019-10-13 19:45:08,242 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2469 transitions. Word has length 102 [2019-10-13 19:45:08,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:08,243 INFO L462 AbstractCegarLoop]: Abstraction has 1730 states and 2469 transitions. [2019-10-13 19:45:08,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2469 transitions. [2019-10-13 19:45:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 19:45:08,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:08,247 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] [2019-10-13 19:45:08,248 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:08,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:08,248 INFO L82 PathProgramCache]: Analyzing trace with hash 945077457, now seen corresponding path program 1 times [2019-10-13 19:45:08,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:08,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553973548] [2019-10-13 19:45:08,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:08,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:08,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:08,617 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-13 19:45:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:08,642 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:08,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553973548] [2019-10-13 19:45:08,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:08,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:08,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169540054] [2019-10-13 19:45:08,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:08,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:08,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:08,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:08,644 INFO L87 Difference]: Start difference. First operand 1730 states and 2469 transitions. Second operand 5 states. [2019-10-13 19:45:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:09,610 INFO L93 Difference]: Finished difference Result 2605 states and 3741 transitions. [2019-10-13 19:45:09,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:09,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 19:45:09,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:09,618 INFO L225 Difference]: With dead ends: 2605 [2019-10-13 19:45:09,618 INFO L226 Difference]: Without dead ends: 1420 [2019-10-13 19:45:09,622 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:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2019-10-13 19:45:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2019-10-13 19:45:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2019-10-13 19:45:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2016 transitions. [2019-10-13 19:45:09,688 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2016 transitions. Word has length 102 [2019-10-13 19:45:09,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:09,689 INFO L462 AbstractCegarLoop]: Abstraction has 1420 states and 2016 transitions. [2019-10-13 19:45:09,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:09,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2016 transitions. [2019-10-13 19:45:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:45:09,691 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:09,691 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:09,692 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:09,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:09,692 INFO L82 PathProgramCache]: Analyzing trace with hash -250804370, now seen corresponding path program 1 times [2019-10-13 19:45:09,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:09,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434046335] [2019-10-13 19:45:09,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:09,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:09,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:09,952 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-13 19:45:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:09,970 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:09,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434046335] [2019-10-13 19:45:09,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:09,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:09,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322884450] [2019-10-13 19:45:09,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:09,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:09,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:09,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:09,973 INFO L87 Difference]: Start difference. First operand 1420 states and 2016 transitions. Second operand 4 states. [2019-10-13 19:45:10,184 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2019-10-13 19:45:11,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:11,346 INFO L93 Difference]: Finished difference Result 3489 states and 5085 transitions. [2019-10-13 19:45:11,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:11,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-13 19:45:11,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:11,366 INFO L225 Difference]: With dead ends: 3489 [2019-10-13 19:45:11,366 INFO L226 Difference]: Without dead ends: 2583 [2019-10-13 19:45:11,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-10-13 19:45:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2515. [2019-10-13 19:45:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2515 states. [2019-10-13 19:45:11,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 3610 transitions. [2019-10-13 19:45:11,489 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 3610 transitions. Word has length 104 [2019-10-13 19:45:11,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:11,490 INFO L462 AbstractCegarLoop]: Abstraction has 2515 states and 3610 transitions. [2019-10-13 19:45:11,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 3610 transitions. [2019-10-13 19:45:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:45:11,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:11,494 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:11,495 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:11,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:11,495 INFO L82 PathProgramCache]: Analyzing trace with hash 858846089, now seen corresponding path program 1 times [2019-10-13 19:45:11,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:11,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903172517] [2019-10-13 19:45:11,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:11,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:11,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:11,865 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-13 19:45:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:11,910 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,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903172517] [2019-10-13 19:45:11,911 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:11,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:11,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332587076] [2019-10-13 19:45:11,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:11,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:11,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:11,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:11,917 INFO L87 Difference]: Start difference. First operand 2515 states and 3610 transitions. Second operand 5 states. [2019-10-13 19:45:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:13,613 INFO L93 Difference]: Finished difference Result 7288 states and 10449 transitions. [2019-10-13 19:45:13,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:13,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-13 19:45:13,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:13,636 INFO L225 Difference]: With dead ends: 7288 [2019-10-13 19:45:13,636 INFO L226 Difference]: Without dead ends: 4816 [2019-10-13 19:45:13,641 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:13,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-10-13 19:45:13,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4748. [2019-10-13 19:45:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4748 states. [2019-10-13 19:45:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 6753 transitions. [2019-10-13 19:45:13,950 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 6753 transitions. Word has length 104 [2019-10-13 19:45:13,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:13,951 INFO L462 AbstractCegarLoop]: Abstraction has 4748 states and 6753 transitions. [2019-10-13 19:45:13,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:13,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 6753 transitions. [2019-10-13 19:45:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:45:13,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:13,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] [2019-10-13 19:45:13,961 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:13,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:13,962 INFO L82 PathProgramCache]: Analyzing trace with hash 870236013, now seen corresponding path program 1 times [2019-10-13 19:45:13,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:13,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997504564] [2019-10-13 19:45:13,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:13,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:13,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:14,221 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-13 19:45:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:14,240 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:14,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997504564] [2019-10-13 19:45:14,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:14,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:14,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156782976] [2019-10-13 19:45:14,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:14,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:14,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:14,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:14,243 INFO L87 Difference]: Start difference. First operand 4748 states and 6753 transitions. Second operand 4 states. [2019-10-13 19:45:15,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:15,618 INFO L93 Difference]: Finished difference Result 14046 states and 20004 transitions. [2019-10-13 19:45:15,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:15,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-13 19:45:15,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:15,662 INFO L225 Difference]: With dead ends: 14046 [2019-10-13 19:45:15,662 INFO L226 Difference]: Without dead ends: 9406 [2019-10-13 19:45:15,672 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:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9406 states. [2019-10-13 19:45:15,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9406 to 4754. [2019-10-13 19:45:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4754 states. [2019-10-13 19:45:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6759 transitions. [2019-10-13 19:45:15,971 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 6759 transitions. Word has length 105 [2019-10-13 19:45:15,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:15,971 INFO L462 AbstractCegarLoop]: Abstraction has 4754 states and 6759 transitions. [2019-10-13 19:45:15,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 6759 transitions. [2019-10-13 19:45:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:45:15,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:15,978 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:45:15,978 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:15,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:15,979 INFO L82 PathProgramCache]: Analyzing trace with hash -95586230, now seen corresponding path program 1 times [2019-10-13 19:45:15,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:15,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277531066] [2019-10-13 19:45:15,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:15,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:15,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:16,265 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-13 19:45:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:16,293 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:16,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277531066] [2019-10-13 19:45:16,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:16,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:16,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806207525] [2019-10-13 19:45:16,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:16,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:16,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:16,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:16,296 INFO L87 Difference]: Start difference. First operand 4754 states and 6759 transitions. Second operand 5 states. [2019-10-13 19:45:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:17,684 INFO L93 Difference]: Finished difference Result 9466 states and 13462 transitions. [2019-10-13 19:45:17,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:17,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 19:45:17,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:17,721 INFO L225 Difference]: With dead ends: 9466 [2019-10-13 19:45:17,722 INFO L226 Difference]: Without dead ends: 4748 [2019-10-13 19:45:17,736 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:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2019-10-13 19:45:17,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 4748. [2019-10-13 19:45:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4748 states. [2019-10-13 19:45:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 6747 transitions. [2019-10-13 19:45:17,959 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 6747 transitions. Word has length 106 [2019-10-13 19:45:17,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:17,959 INFO L462 AbstractCegarLoop]: Abstraction has 4748 states and 6747 transitions. [2019-10-13 19:45:17,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 6747 transitions. [2019-10-13 19:45:17,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:45:17,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:17,966 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:45:17,966 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:17,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:17,966 INFO L82 PathProgramCache]: Analyzing trace with hash -500434516, now seen corresponding path program 1 times [2019-10-13 19:45:17,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:17,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346122001] [2019-10-13 19:45:17,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:17,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:17,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:18,250 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-13 19:45:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:18,294 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:18,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346122001] [2019-10-13 19:45:18,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:18,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:18,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227574121] [2019-10-13 19:45:18,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:18,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:18,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:18,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:18,298 INFO L87 Difference]: Start difference. First operand 4748 states and 6747 transitions. Second operand 4 states. [2019-10-13 19:45:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:20,227 INFO L93 Difference]: Finished difference Result 10891 states and 15571 transitions. [2019-10-13 19:45:20,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:20,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 19:45:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:20,244 INFO L225 Difference]: With dead ends: 10891 [2019-10-13 19:45:20,244 INFO L226 Difference]: Without dead ends: 7075 [2019-10-13 19:45:20,252 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:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2019-10-13 19:45:20,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 7007. [2019-10-13 19:45:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7007 states. [2019-10-13 19:45:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7007 states to 7007 states and 9789 transitions. [2019-10-13 19:45:20,623 INFO L78 Accepts]: Start accepts. Automaton has 7007 states and 9789 transitions. Word has length 106 [2019-10-13 19:45:20,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:20,623 INFO L462 AbstractCegarLoop]: Abstraction has 7007 states and 9789 transitions. [2019-10-13 19:45:20,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:20,624 INFO L276 IsEmpty]: Start isEmpty. Operand 7007 states and 9789 transitions. [2019-10-13 19:45:20,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 19:45:20,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:20,632 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:45:20,633 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:20,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:20,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1963079784, now seen corresponding path program 1 times [2019-10-13 19:45:20,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:20,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026782804] [2019-10-13 19:45:20,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:20,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:20,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:21,051 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-10-13 19:45:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:21,089 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:21,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026782804] [2019-10-13 19:45:21,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:21,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 19:45:21,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718685511] [2019-10-13 19:45:21,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 19:45:21,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:21,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 19:45:21,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-10-13 19:45:21,092 INFO L87 Difference]: Start difference. First operand 7007 states and 9789 transitions. Second operand 13 states. [2019-10-13 19:45:21,373 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-10-13 19:45:24,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:24,075 INFO L93 Difference]: Finished difference Result 22484 states and 33494 transitions. [2019-10-13 19:45:24,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:45:24,075 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2019-10-13 19:45:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:24,112 INFO L225 Difference]: With dead ends: 22484 [2019-10-13 19:45:24,112 INFO L226 Difference]: Without dead ends: 18976 [2019-10-13 19:45:24,123 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:24,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18976 states.