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_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:19:39,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:19:39,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:19:39,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:19:39,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:19:39,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:19:39,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:19:39,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:19:39,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:19:39,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:19:39,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:19:39,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:19:39,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:19:39,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:19:39,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:19:39,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:19:39,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:19:39,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:19:39,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:19:39,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:19:39,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:19:39,822 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:19:39,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:19:39,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:19:39,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:19:39,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:19:39,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:19:39,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:19:39,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:19:39,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:19:39,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:19:39,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:19:39,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:19:39,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:19:39,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:19:39,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:19:39,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:19:39,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:19:39,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:19:39,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:19:39,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:19:39,843 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-09-08 11:19:39,868 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:19:39,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:19:39,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:19:39,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:19:39,870 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:19:39,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:19:39,871 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:19:39,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:19:39,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:19:39,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:19:39,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:19:39,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:19:39,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:19:39,873 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:19:39,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:19:39,874 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:19:39,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:19:39,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:19:39,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:19:39,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:19:39,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:19:39,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:19:39,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:19:39,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:19:39,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:19:39,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:19:39,876 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:19:39,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:19:39,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:19:39,913 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:19:39,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:19:39,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:19:39,935 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:19:39,935 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:19:39,936 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:19:40,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364ce6237/9dade02a15454b269699da7a956e211c/FLAG63b97bc0a [2019-09-08 11:19:40,528 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:19:40,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:19:40,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364ce6237/9dade02a15454b269699da7a956e211c/FLAG63b97bc0a [2019-09-08 11:19:40,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364ce6237/9dade02a15454b269699da7a956e211c [2019-09-08 11:19:40,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:19:40,864 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:19:40,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:19:40,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:19:40,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:19:40,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:19:40" (1/1) ... [2019-09-08 11:19:40,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b28937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:19:40, skipping insertion in model container [2019-09-08 11:19:40,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:19:40" (1/1) ... [2019-09-08 11:19:40,878 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:19:40,951 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:19:41,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:19:41,432 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:19:41,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:19:41,596 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:19:41,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:19:41 WrapperNode [2019-09-08 11:19:41,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:19:41,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:19:41,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:19:41,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:19:41,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:19:41" (1/1) ... [2019-09-08 11:19:41,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:19:41" (1/1) ... [2019-09-08 11:19:41,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:19:41" (1/1) ... [2019-09-08 11:19:41,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:19:41" (1/1) ... [2019-09-08 11:19:41,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:19:41" (1/1) ... [2019-09-08 11:19:41,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:19:41" (1/1) ... [2019-09-08 11:19:41,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:19:41" (1/1) ... [2019-09-08 11:19:41,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:19:41,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:19:41,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:19:41,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:19:41,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:19:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:19:41,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:19:41,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:19:41,751 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:19:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:19:41,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:19:41,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:19:41,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:19:41,752 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:19:41,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:19:41,752 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:19:41,753 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:19:41,753 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:19:41,753 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:19:41,753 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:19:41,754 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:19:41,754 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:19:41,758 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 11:19:41,758 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:19:41,758 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:19:41,758 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:19:41,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:19:41,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:19:43,137 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:19:43,138 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:19:43,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:19:43 BoogieIcfgContainer [2019-09-08 11:19:43,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:19:43,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:19:43,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:19:43,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:19:43,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:19:40" (1/3) ... [2019-09-08 11:19:43,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b483399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:19:43, skipping insertion in model container [2019-09-08 11:19:43,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:19:41" (2/3) ... [2019-09-08 11:19:43,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b483399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:19:43, skipping insertion in model container [2019-09-08 11:19:43,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:19:43" (3/3) ... [2019-09-08 11:19:43,147 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 11:19:43,157 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:19:43,166 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:19:43,182 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:19:43,216 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:19:43,216 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:19:43,217 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:19:43,217 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:19:43,217 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:19:43,217 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:19:43,217 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:19:43,217 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:19:43,217 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:19:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states. [2019-09-08 11:19:43,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:19:43,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:43,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:19:43,256 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:43,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:43,263 INFO L82 PathProgramCache]: Analyzing trace with hash -681392809, now seen corresponding path program 1 times [2019-09-08 11:19:43,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:43,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:43,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:43,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:43,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:19:43,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:43,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:19:43,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:19:43,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:19:43,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:19:43,775 INFO L87 Difference]: Start difference. First operand 263 states. Second operand 3 states. [2019-09-08 11:19:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:43,944 INFO L93 Difference]: Finished difference Result 528 states and 869 transitions. [2019-09-08 11:19:43,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:19:43,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 11:19:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:43,978 INFO L225 Difference]: With dead ends: 528 [2019-09-08 11:19:43,978 INFO L226 Difference]: Without dead ends: 399 [2019-09-08 11:19:43,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:19:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-08 11:19:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-09-08 11:19:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-08 11:19:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 595 transitions. [2019-09-08 11:19:44,117 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 595 transitions. Word has length 100 [2019-09-08 11:19:44,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:44,119 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 595 transitions. [2019-09-08 11:19:44,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:19:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 595 transitions. [2019-09-08 11:19:44,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:19:44,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:44,126 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:19:44,126 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:44,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:44,127 INFO L82 PathProgramCache]: Analyzing trace with hash 8970956, now seen corresponding path program 1 times [2019-09-08 11:19:44,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:44,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:44,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:44,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:44,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:19:44,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:44,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:19:44,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:19:44,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:19:44,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:19:44,637 INFO L87 Difference]: Start difference. First operand 397 states and 595 transitions. Second operand 8 states. [2019-09-08 11:19:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:45,154 INFO L93 Difference]: Finished difference Result 1962 states and 3053 transitions. [2019-09-08 11:19:45,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:19:45,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2019-09-08 11:19:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:45,163 INFO L225 Difference]: With dead ends: 1962 [2019-09-08 11:19:45,164 INFO L226 Difference]: Without dead ends: 1668 [2019-09-08 11:19:45,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:19:45,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2019-09-08 11:19:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1658. [2019-09-08 11:19:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2019-09-08 11:19:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2573 transitions. [2019-09-08 11:19:45,253 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2573 transitions. Word has length 101 [2019-09-08 11:19:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:45,254 INFO L475 AbstractCegarLoop]: Abstraction has 1658 states and 2573 transitions. [2019-09-08 11:19:45,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:19:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2573 transitions. [2019-09-08 11:19:45,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:19:45,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:45,259 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:19:45,259 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:45,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:45,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1048744752, now seen corresponding path program 1 times [2019-09-08 11:19:45,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:45,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:45,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:45,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:45,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:19:45,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:45,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:19:45,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:19:45,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:19:45,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:19:45,422 INFO L87 Difference]: Start difference. First operand 1658 states and 2573 transitions. Second operand 6 states. [2019-09-08 11:19:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:46,125 INFO L93 Difference]: Finished difference Result 5767 states and 9074 transitions. [2019-09-08 11:19:46,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:19:46,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-09-08 11:19:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:46,155 INFO L225 Difference]: With dead ends: 5767 [2019-09-08 11:19:46,155 INFO L226 Difference]: Without dead ends: 4180 [2019-09-08 11:19:46,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:19:46,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4180 states. [2019-09-08 11:19:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4180 to 4176. [2019-09-08 11:19:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4176 states. [2019-09-08 11:19:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 6558 transitions. [2019-09-08 11:19:46,432 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 6558 transitions. Word has length 102 [2019-09-08 11:19:46,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:46,433 INFO L475 AbstractCegarLoop]: Abstraction has 4176 states and 6558 transitions. [2019-09-08 11:19:46,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:19:46,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 6558 transitions. [2019-09-08 11:19:46,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:19:46,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:46,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:19:46,438 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:46,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:46,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1678520225, now seen corresponding path program 1 times [2019-09-08 11:19:46,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:46,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:46,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:46,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:46,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:19:46,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:46,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:19:46,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:19:46,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:19:46,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:19:46,549 INFO L87 Difference]: Start difference. First operand 4176 states and 6558 transitions. Second operand 5 states. [2019-09-08 11:19:47,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:47,324 INFO L93 Difference]: Finished difference Result 11868 states and 18729 transitions. [2019-09-08 11:19:47,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:19:47,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:19:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:47,366 INFO L225 Difference]: With dead ends: 11868 [2019-09-08 11:19:47,366 INFO L226 Difference]: Without dead ends: 7786 [2019-09-08 11:19:47,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:19:47,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7786 states. [2019-09-08 11:19:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7786 to 7784. [2019-09-08 11:19:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7784 states. [2019-09-08 11:19:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7784 states to 7784 states and 12224 transitions. [2019-09-08 11:19:47,829 INFO L78 Accepts]: Start accepts. Automaton has 7784 states and 12224 transitions. Word has length 102 [2019-09-08 11:19:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:47,830 INFO L475 AbstractCegarLoop]: Abstraction has 7784 states and 12224 transitions. [2019-09-08 11:19:47,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:19:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 7784 states and 12224 transitions. [2019-09-08 11:19:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:19:47,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:47,836 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:19:47,836 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:47,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:47,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1939688579, now seen corresponding path program 1 times [2019-09-08 11:19:47,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:47,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:47,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:19:47,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:47,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:19:47,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:19:47,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:19:47,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:19:47,946 INFO L87 Difference]: Start difference. First operand 7784 states and 12224 transitions. Second operand 5 states. [2019-09-08 11:19:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:48,858 INFO L93 Difference]: Finished difference Result 22083 states and 34769 transitions. [2019-09-08 11:19:48,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:19:48,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:19:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:48,925 INFO L225 Difference]: With dead ends: 22083 [2019-09-08 11:19:48,926 INFO L226 Difference]: Without dead ends: 14460 [2019-09-08 11:19:48,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:19:48,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14460 states. [2019-09-08 11:19:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14460 to 14458. [2019-09-08 11:19:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14458 states. [2019-09-08 11:19:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14458 states to 14458 states and 22658 transitions. [2019-09-08 11:19:49,654 INFO L78 Accepts]: Start accepts. Automaton has 14458 states and 22658 transitions. Word has length 102 [2019-09-08 11:19:49,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:49,654 INFO L475 AbstractCegarLoop]: Abstraction has 14458 states and 22658 transitions. [2019-09-08 11:19:49,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:19:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 14458 states and 22658 transitions. [2019-09-08 11:19:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:19:49,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:49,662 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:19:49,663 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:49,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:49,663 INFO L82 PathProgramCache]: Analyzing trace with hash 806073100, now seen corresponding path program 1 times [2019-09-08 11:19:49,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:49,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:49,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:49,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:49,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:19:49,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:49,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:19:49,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:19:49,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:19:49,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:19:49,759 INFO L87 Difference]: Start difference. First operand 14458 states and 22658 transitions. Second operand 5 states. [2019-09-08 11:19:51,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:51,685 INFO L93 Difference]: Finished difference Result 41972 states and 65934 transitions. [2019-09-08 11:19:51,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:19:51,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:19:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:51,757 INFO L225 Difference]: With dead ends: 41972 [2019-09-08 11:19:51,757 INFO L226 Difference]: Without dead ends: 27716 [2019-09-08 11:19:51,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:19:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27716 states. [2019-09-08 11:19:52,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27716 to 27714. [2019-09-08 11:19:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27714 states. [2019-09-08 11:19:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27714 states to 27714 states and 43380 transitions. [2019-09-08 11:19:52,817 INFO L78 Accepts]: Start accepts. Automaton has 27714 states and 43380 transitions. Word has length 102 [2019-09-08 11:19:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:52,818 INFO L475 AbstractCegarLoop]: Abstraction has 27714 states and 43380 transitions. [2019-09-08 11:19:52,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:19:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 27714 states and 43380 transitions. [2019-09-08 11:19:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:19:52,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:52,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:19:52,827 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:52,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:52,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1339566062, now seen corresponding path program 1 times [2019-09-08 11:19:52,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:52,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:52,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:52,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:52,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:19:52,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:52,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:19:52,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:19:52,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:19:52,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:19:52,932 INFO L87 Difference]: Start difference. First operand 27714 states and 43380 transitions. Second operand 5 states. [2019-09-08 11:19:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:55,470 INFO L93 Difference]: Finished difference Result 82130 states and 128662 transitions. [2019-09-08 11:19:55,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:19:55,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:19:55,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:55,600 INFO L225 Difference]: With dead ends: 82130 [2019-09-08 11:19:55,600 INFO L226 Difference]: Without dead ends: 54540 [2019-09-08 11:19:55,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:19:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54540 states. [2019-09-08 11:19:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54540 to 54538. [2019-09-08 11:19:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54538 states. [2019-09-08 11:19:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54538 states to 54538 states and 85043 transitions. [2019-09-08 11:19:57,828 INFO L78 Accepts]: Start accepts. Automaton has 54538 states and 85043 transitions. Word has length 102 [2019-09-08 11:19:57,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:57,828 INFO L475 AbstractCegarLoop]: Abstraction has 54538 states and 85043 transitions. [2019-09-08 11:19:57,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:19:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 54538 states and 85043 transitions. [2019-09-08 11:19:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:19:57,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:57,840 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:19:57,840 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:57,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:57,841 INFO L82 PathProgramCache]: Analyzing trace with hash 276610369, now seen corresponding path program 1 times [2019-09-08 11:19:57,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:57,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:57,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:57,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:57,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:19:57,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:57,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:19:57,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:19:57,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:19:57,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:19:57,920 INFO L87 Difference]: Start difference. First operand 54538 states and 85043 transitions. Second operand 5 states. [2019-09-08 11:20:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:20:02,346 INFO L93 Difference]: Finished difference Result 163039 states and 254348 transitions. [2019-09-08 11:20:02,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:20:02,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-08 11:20:02,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:20:02,621 INFO L225 Difference]: With dead ends: 163039 [2019-09-08 11:20:02,621 INFO L226 Difference]: Without dead ends: 108556 [2019-09-08 11:20:02,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:20:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108556 states. [2019-09-08 11:20:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108556 to 108554. [2019-09-08 11:20:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108554 states. [2019-09-08 11:20:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108554 states to 108554 states and 168305 transitions. [2019-09-08 11:20:08,636 INFO L78 Accepts]: Start accepts. Automaton has 108554 states and 168305 transitions. Word has length 102 [2019-09-08 11:20:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:20:08,636 INFO L475 AbstractCegarLoop]: Abstraction has 108554 states and 168305 transitions. [2019-09-08 11:20:08,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:20:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 108554 states and 168305 transitions. [2019-09-08 11:20:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:20:08,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:20:08,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:20:08,655 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:20:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:20:08,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1183562943, now seen corresponding path program 1 times [2019-09-08 11:20:08,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:20:08,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:20:08,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:08,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:20:08,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:20:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:20:08,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:20:08,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:20:08,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:20:08,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:20:08,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:20:08,757 INFO L87 Difference]: Start difference. First operand 108554 states and 168305 transitions. Second operand 5 states. [2019-09-08 11:20:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:20:17,079 INFO L93 Difference]: Finished difference Result 205292 states and 316898 transitions. [2019-09-08 11:20:17,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:20:17,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 11:20:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:20:17,714 INFO L225 Difference]: With dead ends: 205292 [2019-09-08 11:20:17,715 INFO L226 Difference]: Without dead ends: 205290 [2019-09-08 11:20:17,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:20:17,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205290 states. [2019-09-08 11:20:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205290 to 109706. [2019-09-08 11:20:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109706 states. [2019-09-08 11:20:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109706 states to 109706 states and 169457 transitions. [2019-09-08 11:20:25,962 INFO L78 Accepts]: Start accepts. Automaton has 109706 states and 169457 transitions. Word has length 103 [2019-09-08 11:20:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:20:25,962 INFO L475 AbstractCegarLoop]: Abstraction has 109706 states and 169457 transitions. [2019-09-08 11:20:25,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:20:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 109706 states and 169457 transitions. [2019-09-08 11:20:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:20:25,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:20:25,980 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:20:25,980 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:20:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:20:25,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1986480432, now seen corresponding path program 1 times [2019-09-08 11:20:25,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:20:25,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:20:25,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:25,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:20:25,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:20:26,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-09-08 11:20:26,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:20:26,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:20:26,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:20:26,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:20:26,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:20:26,242 INFO L87 Difference]: Start difference. First operand 109706 states and 169457 transitions. Second operand 10 states. [2019-09-08 11:21:12,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:12,716 INFO L93 Difference]: Finished difference Result 971172 states and 1500221 transitions. [2019-09-08 11:21:12,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 11:21:12,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-08 11:21:12,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:21,019 INFO L225 Difference]: With dead ends: 971172 [2019-09-08 11:21:21,020 INFO L226 Difference]: Without dead ends: 883592 [2019-09-08 11:21:21,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=1012, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 11:21:21,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883592 states. [2019-09-08 11:21:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883592 to 110023. [2019-09-08 11:21:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110023 states. [2019-09-08 11:21:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110023 states to 110023 states and 169858 transitions. [2019-09-08 11:21:33,142 INFO L78 Accepts]: Start accepts. Automaton has 110023 states and 169858 transitions. Word has length 104 [2019-09-08 11:21:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:33,142 INFO L475 AbstractCegarLoop]: Abstraction has 110023 states and 169858 transitions. [2019-09-08 11:21:33,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:21:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 110023 states and 169858 transitions. [2019-09-08 11:21:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:21:33,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:33,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:21:33,156 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:33,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1395487120, now seen corresponding path program 1 times [2019-09-08 11:21:33,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:33,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:33,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:33,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:33,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:21:33,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:33,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:21:33,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:21:33,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:21:33,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:21:33,366 INFO L87 Difference]: Start difference. First operand 110023 states and 169858 transitions. Second operand 10 states. [2019-09-08 11:22:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:22:31,263 INFO L93 Difference]: Finished difference Result 788178 states and 1209152 transitions. [2019-09-08 11:22:31,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:22:31,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-08 11:22:31,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:22:32,373 INFO L225 Difference]: With dead ends: 788178 [2019-09-08 11:22:32,374 INFO L226 Difference]: Without dead ends: 720470 [2019-09-08 11:22:32,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 11:22:38,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720470 states. [2019-09-08 11:22:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720470 to 110790. [2019-09-08 11:22:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110790 states. [2019-09-08 11:22:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110790 states to 110790 states and 170877 transitions. [2019-09-08 11:22:56,207 INFO L78 Accepts]: Start accepts. Automaton has 110790 states and 170877 transitions. Word has length 104 [2019-09-08 11:22:56,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:22:56,207 INFO L475 AbstractCegarLoop]: Abstraction has 110790 states and 170877 transitions. [2019-09-08 11:22:56,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:22:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 110790 states and 170877 transitions. [2019-09-08 11:22:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:22:56,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:22:56,222 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:22:56,222 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:22:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:22:56,222 INFO L82 PathProgramCache]: Analyzing trace with hash 842726832, now seen corresponding path program 1 times [2019-09-08 11:22:56,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:22:56,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:22:56,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:56,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:22:56,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:22:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:22:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:22:56,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:22:56,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:22:56,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:22:56,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:22:56,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:22:56,494 INFO L87 Difference]: Start difference. First operand 110790 states and 170877 transitions. Second operand 10 states. [2019-09-08 11:23:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:53,803 INFO L93 Difference]: Finished difference Result 583940 states and 893609 transitions. [2019-09-08 11:23:53,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 11:23:53,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-08 11:23:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:54,573 INFO L225 Difference]: With dead ends: 583940 [2019-09-08 11:23:54,573 INFO L226 Difference]: Without dead ends: 553506 [2019-09-08 11:23:54,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 11:23:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553506 states. [2019-09-08 11:24:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553506 to 112316. [2019-09-08 11:24:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112316 states. [2019-09-08 11:24:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112316 states to 112316 states and 173097 transitions. [2019-09-08 11:24:09,096 INFO L78 Accepts]: Start accepts. Automaton has 112316 states and 173097 transitions. Word has length 104 [2019-09-08 11:24:09,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:09,097 INFO L475 AbstractCegarLoop]: Abstraction has 112316 states and 173097 transitions. [2019-09-08 11:24:09,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:24:09,097 INFO L276 IsEmpty]: Start isEmpty. Operand 112316 states and 173097 transitions. [2019-09-08 11:24:09,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:24:09,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:09,114 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:09,114 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:09,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1327076688, now seen corresponding path program 1 times [2019-09-08 11:24:09,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:09,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:09,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:09,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:09,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:09,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:24:09,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:24:09,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:24:09,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:24:09,904 INFO L87 Difference]: Start difference. First operand 112316 states and 173097 transitions. Second operand 10 states. [2019-09-08 11:24:42,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:42,540 INFO L93 Difference]: Finished difference Result 277373 states and 425105 transitions. [2019-09-08 11:24:42,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 11:24:42,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-08 11:24:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:42,911 INFO L225 Difference]: With dead ends: 277373 [2019-09-08 11:24:42,911 INFO L226 Difference]: Without dead ends: 266169 [2019-09-08 11:24:42,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-09-08 11:24:43,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266169 states. [2019-09-08 11:24:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266169 to 112316. [2019-09-08 11:24:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112316 states. [2019-09-08 11:24:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112316 states to 112316 states and 173089 transitions. [2019-09-08 11:24:56,434 INFO L78 Accepts]: Start accepts. Automaton has 112316 states and 173089 transitions. Word has length 104 [2019-09-08 11:24:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:56,435 INFO L475 AbstractCegarLoop]: Abstraction has 112316 states and 173089 transitions. [2019-09-08 11:24:56,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:24:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 112316 states and 173089 transitions. [2019-09-08 11:24:56,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:24:56,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:56,450 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:56,450 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:56,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:56,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1732290064, now seen corresponding path program 1 times [2019-09-08 11:24:56,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:56,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:56,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:56,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:56,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:24:56,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:24:56,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:24:56,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:24:56,666 INFO L87 Difference]: Start difference. First operand 112316 states and 173089 transitions. Second operand 10 states. [2019-09-08 11:25:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:44,245 INFO L93 Difference]: Finished difference Result 419737 states and 642671 transitions. [2019-09-08 11:25:44,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:25:44,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-08 11:25:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:44,764 INFO L225 Difference]: With dead ends: 419737 [2019-09-08 11:25:44,764 INFO L226 Difference]: Without dead ends: 369899 [2019-09-08 11:25:44,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:25:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369899 states. [2019-09-08 11:26:05,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369899 to 114459. [2019-09-08 11:26:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114459 states. [2019-09-08 11:26:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114459 states to 114459 states and 175973 transitions. [2019-09-08 11:26:06,012 INFO L78 Accepts]: Start accepts. Automaton has 114459 states and 175973 transitions. Word has length 104 [2019-09-08 11:26:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:06,013 INFO L475 AbstractCegarLoop]: Abstraction has 114459 states and 175973 transitions. [2019-09-08 11:26:06,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:26:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 114459 states and 175973 transitions. [2019-09-08 11:26:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:26:06,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:06,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:26:06,027 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:06,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:06,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1278943024, now seen corresponding path program 1 times [2019-09-08 11:26:06,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:06,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:06,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:06,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:06,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:26:06,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:06,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:26:06,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:26:06,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:26:06,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:26:06,267 INFO L87 Difference]: Start difference. First operand 114459 states and 175973 transitions. Second operand 10 states. [2019-09-08 11:27:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:48,461 INFO L93 Difference]: Finished difference Result 840366 states and 1285613 transitions. [2019-09-08 11:27:48,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 11:27:48,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-08 11:27:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:49,503 INFO L225 Difference]: With dead ends: 840366 [2019-09-08 11:27:49,503 INFO L226 Difference]: Without dead ends: 731244 [2019-09-08 11:27:49,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 11:27:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731244 states. [2019-09-08 11:28:16,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731244 to 115215. [2019-09-08 11:28:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115215 states. [2019-09-08 11:28:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115215 states to 115215 states and 176843 transitions. [2019-09-08 11:28:16,523 INFO L78 Accepts]: Start accepts. Automaton has 115215 states and 176843 transitions. Word has length 104 [2019-09-08 11:28:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:16,523 INFO L475 AbstractCegarLoop]: Abstraction has 115215 states and 176843 transitions. [2019-09-08 11:28:16,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:28:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 115215 states and 176843 transitions. [2019-09-08 11:28:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:28:16,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:16,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:28:16,539 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:16,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:16,539 INFO L82 PathProgramCache]: Analyzing trace with hash -837692424, now seen corresponding path program 1 times [2019-09-08 11:28:16,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:16,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:16,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:16,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:16,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:28:16,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:16,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:28:16,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:28:16,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:28:16,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:28:16,666 INFO L87 Difference]: Start difference. First operand 115215 states and 176843 transitions. Second operand 4 states. [2019-09-08 11:28:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:28:46,557 INFO L93 Difference]: Finished difference Result 318707 states and 489773 transitions. [2019-09-08 11:28:46,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:28:46,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-08 11:28:46,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:28:46,814 INFO L225 Difference]: With dead ends: 318707 [2019-09-08 11:28:46,814 INFO L226 Difference]: Without dead ends: 211505 [2019-09-08 11:28:46,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:28:47,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211505 states. [2019-09-08 11:29:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211505 to 210399. [2019-09-08 11:29:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210399 states. [2019-09-08 11:29:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210399 states to 210399 states and 321259 transitions. [2019-09-08 11:29:20,008 INFO L78 Accepts]: Start accepts. Automaton has 210399 states and 321259 transitions. Word has length 105 [2019-09-08 11:29:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:20,009 INFO L475 AbstractCegarLoop]: Abstraction has 210399 states and 321259 transitions. [2019-09-08 11:29:20,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:29:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 210399 states and 321259 transitions. [2019-09-08 11:29:20,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:29:20,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:20,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:29:20,027 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:20,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:20,027 INFO L82 PathProgramCache]: Analyzing trace with hash 737938638, now seen corresponding path program 1 times [2019-09-08 11:29:20,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:20,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:20,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:20,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:20,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:20,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-09-08 11:29:20,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:20,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:29:20,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:29:20,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:29:20,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:29:20,090 INFO L87 Difference]: Start difference. First operand 210399 states and 321259 transitions. Second operand 3 states. [2019-09-08 11:30:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:30:03,685 INFO L93 Difference]: Finished difference Result 419775 states and 641643 transitions. [2019-09-08 11:30:03,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:30:03,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 11:30:03,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:30:04,069 INFO L225 Difference]: With dead ends: 419775 [2019-09-08 11:30:04,069 INFO L226 Difference]: Without dead ends: 271889 [2019-09-08 11:30:04,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:30:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271889 states. [2019-09-08 11:30:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271889 to 270183. [2019-09-08 11:30:43,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270183 states. [2019-09-08 11:30:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270183 states to 270183 states and 408598 transitions. [2019-09-08 11:30:43,933 INFO L78 Accepts]: Start accepts. Automaton has 270183 states and 408598 transitions. Word has length 105 [2019-09-08 11:30:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:30:43,934 INFO L475 AbstractCegarLoop]: Abstraction has 270183 states and 408598 transitions. [2019-09-08 11:30:43,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:30:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 270183 states and 408598 transitions. [2019-09-08 11:30:43,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:30:43,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:30:43,954 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:30:43,955 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:30:43,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:30:43,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1199316624, now seen corresponding path program 1 times [2019-09-08 11:30:43,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:30:43,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:30:43,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:30:43,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:30:43,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:30:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:30:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:30:44,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:30:44,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:30:44,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:30:44,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:30:44,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:30:44,029 INFO L87 Difference]: Start difference. First operand 270183 states and 408598 transitions. Second operand 3 states. [2019-09-08 11:31:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:31:38,009 INFO L93 Difference]: Finished difference Result 481033 states and 727516 transitions. [2019-09-08 11:31:38,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:31:38,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 11:31:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:31:38,470 INFO L225 Difference]: With dead ends: 481033 [2019-09-08 11:31:38,470 INFO L226 Difference]: Without dead ends: 320467 [2019-09-08 11:31:38,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:31:38,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320467 states.