/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:12:53,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:12:53,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:12:53,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:12:53,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:12:53,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:12:53,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:12:53,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:12:53,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:12:53,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:12:53,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:12:53,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:12:53,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:12:53,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:12:53,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:12:53,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:12:53,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:12:53,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:12:53,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:12:53,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:12:53,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:12:53,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:12:53,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:12:53,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:12:53,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:12:53,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:12:53,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:12:53,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:12:53,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:12:53,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:12:53,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:12:53,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:12:53,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:12:53,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:12:53,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:12:53,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:12:53,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:12:53,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:12:53,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:12:53,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:12:53,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:12:53,622 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-11-06 22:12:53,636 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:12:53,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:12:53,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:12:53,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:12:53,638 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:12:53,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:12:53,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:12:53,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:12:53,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:12:53,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:12:53,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:12:53,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:12:53,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:12:53,640 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:12:53,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:12:53,640 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:12:53,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:12:53,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:12:53,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:12:53,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:12:53,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:12:53,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:12:53,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:12:53,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:12:53,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:12:53,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:12:53,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:12:53,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:12:53,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:12:53,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:12:53,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:12:53,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:12:53,945 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:12:53,945 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:12:53,946 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-06 22:12:54,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/937f6bff0/ea9c33e5a660453693b301175c449a30/FLAG50eb4b4e4 [2019-11-06 22:12:54,562 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:12:54,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-06 22:12:54,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/937f6bff0/ea9c33e5a660453693b301175c449a30/FLAG50eb4b4e4 [2019-11-06 22:12:54,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/937f6bff0/ea9c33e5a660453693b301175c449a30 [2019-11-06 22:12:54,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:12:54,854 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:12:54,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:12:54,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:12:54,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:12:54,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:54" (1/1) ... [2019-11-06 22:12:54,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e69c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:54, skipping insertion in model container [2019-11-06 22:12:54,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:12:54" (1/1) ... [2019-11-06 22:12:54,872 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:12:54,948 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:12:55,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:12:55,692 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:12:55,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:12:55,858 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:12:55,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:55 WrapperNode [2019-11-06 22:12:55,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:12:55,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:12:55,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:12:55,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:12:55,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:55" (1/1) ... [2019-11-06 22:12:55,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:55" (1/1) ... [2019-11-06 22:12:55,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:55" (1/1) ... [2019-11-06 22:12:55,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:55" (1/1) ... [2019-11-06 22:12:55,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:55" (1/1) ... [2019-11-06 22:12:55,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:55" (1/1) ... [2019-11-06 22:12:55,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:55" (1/1) ... [2019-11-06 22:12:55,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:12:55,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:12:55,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:12:55,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:12:55,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:55" (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-11-06 22:12:56,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:12:56,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:12:56,038 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:12:56,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:12:56,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:12:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 22:12:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-06 22:12:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:12:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-06 22:12:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-06 22:12:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-06 22:12:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-06 22:12:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-06 22:12:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 22:12:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 22:12:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:12:56,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:12:56,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:12:57,534 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:12:57,534 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 22:12:57,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:57 BoogieIcfgContainer [2019-11-06 22:12:57,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:12:57,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:12:57,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:12:57,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:12:57,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:12:54" (1/3) ... [2019-11-06 22:12:57,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3800e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:57, skipping insertion in model container [2019-11-06 22:12:57,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:12:55" (2/3) ... [2019-11-06 22:12:57,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3800e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:12:57, skipping insertion in model container [2019-11-06 22:12:57,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:12:57" (3/3) ... [2019-11-06 22:12:57,551 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-06 22:12:57,561 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:12:57,577 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:12:57,589 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:12:57,622 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:12:57,622 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:12:57,622 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:12:57,622 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:12:57,623 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:12:57,623 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:12:57,623 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:12:57,623 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:12:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states. [2019-11-06 22:12:57,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-06 22:12:57,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:12:57,665 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:12:57,667 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:12:57,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:12:57,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1850165601, now seen corresponding path program 1 times [2019-11-06 22:12:57,679 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:12:57,679 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417576682] [2019-11-06 22:12:57,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:12:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:58,605 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-11-06 22:12:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:12:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:12:58,669 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417576682] [2019-11-06 22:12:58,670 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:12:58,670 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:12:58,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999226507] [2019-11-06 22:12:58,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:12:58,679 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:12:58,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:12:58,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:12:58,699 INFO L87 Difference]: Start difference. First operand 310 states. Second operand 4 states. [2019-11-06 22:12:58,986 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-11-06 22:13:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:00,644 INFO L93 Difference]: Finished difference Result 605 states and 1058 transitions. [2019-11-06 22:13:00,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:13:00,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-06 22:13:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:00,664 INFO L225 Difference]: With dead ends: 605 [2019-11-06 22:13:00,664 INFO L226 Difference]: Without dead ends: 493 [2019-11-06 22:13:00,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:13:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-11-06 22:13:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2019-11-06 22:13:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-11-06 22:13:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 730 transitions. [2019-11-06 22:13:00,765 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 730 transitions. Word has length 148 [2019-11-06 22:13:00,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:00,766 INFO L462 AbstractCegarLoop]: Abstraction has 491 states and 730 transitions. [2019-11-06 22:13:00,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:13:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 730 transitions. [2019-11-06 22:13:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-06 22:13:00,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:00,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:13:00,772 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:00,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:00,772 INFO L82 PathProgramCache]: Analyzing trace with hash -835560269, now seen corresponding path program 1 times [2019-11-06 22:13:00,773 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:00,773 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673460401] [2019-11-06 22:13:00,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:01,365 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-11-06 22:13:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:01,447 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673460401] [2019-11-06 22:13:01,448 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:01,448 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:13:01,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113896084] [2019-11-06 22:13:01,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:13:01,450 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:01,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:13:01,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:13:01,451 INFO L87 Difference]: Start difference. First operand 491 states and 730 transitions. Second operand 5 states. [2019-11-06 22:13:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:03,626 INFO L93 Difference]: Finished difference Result 1423 states and 2113 transitions. [2019-11-06 22:13:03,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:13:03,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-11-06 22:13:03,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:03,635 INFO L225 Difference]: With dead ends: 1423 [2019-11-06 22:13:03,635 INFO L226 Difference]: Without dead ends: 945 [2019-11-06 22:13:03,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:13:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-06 22:13:03,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 943. [2019-11-06 22:13:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-11-06 22:13:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1389 transitions. [2019-11-06 22:13:03,718 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1389 transitions. Word has length 148 [2019-11-06 22:13:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:03,718 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1389 transitions. [2019-11-06 22:13:03,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:13:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1389 transitions. [2019-11-06 22:13:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-06 22:13:03,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:03,732 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:13:03,732 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:03,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:03,733 INFO L82 PathProgramCache]: Analyzing trace with hash -312485947, now seen corresponding path program 1 times [2019-11-06 22:13:03,733 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:03,733 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374748948] [2019-11-06 22:13:03,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:04,103 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-11-06 22:13:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:04,198 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374748948] [2019-11-06 22:13:04,199 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:04,199 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:13:04,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305048123] [2019-11-06 22:13:04,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:13:04,208 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:04,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:13:04,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:13:04,211 INFO L87 Difference]: Start difference. First operand 943 states and 1389 transitions. Second operand 4 states. [2019-11-06 22:13:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:05,637 INFO L93 Difference]: Finished difference Result 2783 states and 4097 transitions. [2019-11-06 22:13:05,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:13:05,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-06 22:13:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:05,651 INFO L225 Difference]: With dead ends: 2783 [2019-11-06 22:13:05,652 INFO L226 Difference]: Without dead ends: 1872 [2019-11-06 22:13:05,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:13:05,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2019-11-06 22:13:05,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 945. [2019-11-06 22:13:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-11-06 22:13:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1391 transitions. [2019-11-06 22:13:05,747 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1391 transitions. Word has length 149 [2019-11-06 22:13:05,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:05,748 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1391 transitions. [2019-11-06 22:13:05,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:13:05,748 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1391 transitions. [2019-11-06 22:13:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-06 22:13:05,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:05,754 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:13:05,754 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:05,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1358823732, now seen corresponding path program 1 times [2019-11-06 22:13:05,755 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:05,755 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216616549] [2019-11-06 22:13:05,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:06,339 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-11-06 22:13:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:06,381 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216616549] [2019-11-06 22:13:06,381 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:06,381 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:13:06,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721817889] [2019-11-06 22:13:06,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:13:06,382 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:06,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:13:06,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:13:06,383 INFO L87 Difference]: Start difference. First operand 945 states and 1391 transitions. Second operand 5 states. [2019-11-06 22:13:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:07,784 INFO L93 Difference]: Finished difference Result 1876 states and 2764 transitions. [2019-11-06 22:13:07,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:13:07,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-11-06 22:13:07,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:07,790 INFO L225 Difference]: With dead ends: 1876 [2019-11-06 22:13:07,790 INFO L226 Difference]: Without dead ends: 943 [2019-11-06 22:13:07,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:13:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-11-06 22:13:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2019-11-06 22:13:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-11-06 22:13:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1387 transitions. [2019-11-06 22:13:07,855 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1387 transitions. Word has length 150 [2019-11-06 22:13:07,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:07,855 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1387 transitions. [2019-11-06 22:13:07,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:13:07,855 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1387 transitions. [2019-11-06 22:13:07,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-06 22:13:07,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:07,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:13:07,859 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:07,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:07,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1528940934, now seen corresponding path program 1 times [2019-11-06 22:13:07,860 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:07,860 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602930575] [2019-11-06 22:13:07,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:08,157 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-11-06 22:13:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:08,207 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602930575] [2019-11-06 22:13:08,207 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:08,208 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:13:08,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583538299] [2019-11-06 22:13:08,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:13:08,208 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:08,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:13:08,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:13:08,209 INFO L87 Difference]: Start difference. First operand 943 states and 1387 transitions. Second operand 4 states. [2019-11-06 22:13:10,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:10,202 INFO L93 Difference]: Finished difference Result 2159 states and 3193 transitions. [2019-11-06 22:13:10,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:13:10,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-06 22:13:10,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:10,210 INFO L225 Difference]: With dead ends: 2159 [2019-11-06 22:13:10,210 INFO L226 Difference]: Without dead ends: 1396 [2019-11-06 22:13:10,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:13:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-11-06 22:13:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1394. [2019-11-06 22:13:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2019-11-06 22:13:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2025 transitions. [2019-11-06 22:13:10,280 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2025 transitions. Word has length 150 [2019-11-06 22:13:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:10,281 INFO L462 AbstractCegarLoop]: Abstraction has 1394 states and 2025 transitions. [2019-11-06 22:13:10,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:13:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2025 transitions. [2019-11-06 22:13:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-06 22:13:10,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:10,285 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:13:10,285 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:10,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:10,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2049235060, now seen corresponding path program 1 times [2019-11-06 22:13:10,286 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:10,286 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613536086] [2019-11-06 22:13:10,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:10,645 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-11-06 22:13:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:10,693 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613536086] [2019-11-06 22:13:10,694 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:10,694 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:13:10,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525198224] [2019-11-06 22:13:10,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:13:10,695 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:10,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:13:10,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:13:10,696 INFO L87 Difference]: Start difference. First operand 1394 states and 2025 transitions. Second operand 4 states. [2019-11-06 22:13:10,928 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-11-06 22:13:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:12,596 INFO L93 Difference]: Finished difference Result 3707 states and 5443 transitions. [2019-11-06 22:13:12,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:13:12,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-06 22:13:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:12,611 INFO L225 Difference]: With dead ends: 3707 [2019-11-06 22:13:12,611 INFO L226 Difference]: Without dead ends: 2595 [2019-11-06 22:13:12,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:13:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2019-11-06 22:13:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2593. [2019-11-06 22:13:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2593 states. [2019-11-06 22:13:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3764 transitions. [2019-11-06 22:13:12,720 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3764 transitions. Word has length 156 [2019-11-06 22:13:12,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:12,721 INFO L462 AbstractCegarLoop]: Abstraction has 2593 states and 3764 transitions. [2019-11-06 22:13:12,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:13:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3764 transitions. [2019-11-06 22:13:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-06 22:13:12,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:12,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:13:12,727 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:12,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:12,727 INFO L82 PathProgramCache]: Analyzing trace with hash 327258095, now seen corresponding path program 1 times [2019-11-06 22:13:12,727 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:12,728 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868729762] [2019-11-06 22:13:12,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:13,079 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-11-06 22:13:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:13,137 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868729762] [2019-11-06 22:13:13,138 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:13,138 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 22:13:13,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551108540] [2019-11-06 22:13:13,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:13:13,139 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:13,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:13:13,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:13:13,140 INFO L87 Difference]: Start difference. First operand 2593 states and 3764 transitions. Second operand 7 states. [2019-11-06 22:13:13,380 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2019-11-06 22:13:15,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:15,796 INFO L93 Difference]: Finished difference Result 6395 states and 10006 transitions. [2019-11-06 22:13:15,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 22:13:15,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2019-11-06 22:13:15,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:15,822 INFO L225 Difference]: With dead ends: 6395 [2019-11-06 22:13:15,822 INFO L226 Difference]: Without dead ends: 5489 [2019-11-06 22:13:15,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:13:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2019-11-06 22:13:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 5453. [2019-11-06 22:13:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-11-06 22:13:16,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 8364 transitions. [2019-11-06 22:13:16,161 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 8364 transitions. Word has length 156 [2019-11-06 22:13:16,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:16,162 INFO L462 AbstractCegarLoop]: Abstraction has 5453 states and 8364 transitions. [2019-11-06 22:13:16,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:13:16,162 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 8364 transitions. [2019-11-06 22:13:16,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-06 22:13:16,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:16,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:13:16,168 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:16,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:16,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1936499521, now seen corresponding path program 1 times [2019-11-06 22:13:16,169 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:16,169 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922569538] [2019-11-06 22:13:16,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:16,618 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-11-06 22:13:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:16,666 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922569538] [2019-11-06 22:13:16,666 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:16,666 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:13:16,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579960197] [2019-11-06 22:13:16,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:13:16,667 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:16,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:13:16,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:13:16,668 INFO L87 Difference]: Start difference. First operand 5453 states and 8364 transitions. Second operand 9 states. [2019-11-06 22:13:16,892 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-11-06 22:13:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:18,774 INFO L93 Difference]: Finished difference Result 9061 states and 14264 transitions. [2019-11-06 22:13:18,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:13:18,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 156 [2019-11-06 22:13:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:18,796 INFO L225 Difference]: With dead ends: 9061 [2019-11-06 22:13:18,797 INFO L226 Difference]: Without dead ends: 5455 [2019-11-06 22:13:18,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-06 22:13:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5455 states. [2019-11-06 22:13:19,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5455 to 5453. [2019-11-06 22:13:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-11-06 22:13:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 8328 transitions. [2019-11-06 22:13:19,056 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 8328 transitions. Word has length 156 [2019-11-06 22:13:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:19,057 INFO L462 AbstractCegarLoop]: Abstraction has 5453 states and 8328 transitions. [2019-11-06 22:13:19,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:13:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 8328 transitions. [2019-11-06 22:13:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-06 22:13:19,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:19,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:13:19,063 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:19,063 INFO L82 PathProgramCache]: Analyzing trace with hash -681147618, now seen corresponding path program 1 times [2019-11-06 22:13:19,063 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:19,063 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661149608] [2019-11-06 22:13:19,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:19,505 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-11-06 22:13:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:19,574 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661149608] [2019-11-06 22:13:19,574 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:19,574 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:13:19,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058104885] [2019-11-06 22:13:19,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:13:19,575 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:19,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:13:19,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:13:19,576 INFO L87 Difference]: Start difference. First operand 5453 states and 8328 transitions. Second operand 5 states. [2019-11-06 22:13:21,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:21,858 INFO L93 Difference]: Finished difference Result 14216 states and 21721 transitions. [2019-11-06 22:13:21,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:13:21,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-11-06 22:13:21,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:21,891 INFO L225 Difference]: With dead ends: 14216 [2019-11-06 22:13:21,891 INFO L226 Difference]: Without dead ends: 8786 [2019-11-06 22:13:21,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:13:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8786 states. [2019-11-06 22:13:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8786 to 8784. [2019-11-06 22:13:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8784 states. [2019-11-06 22:13:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8784 states to 8784 states and 13279 transitions. [2019-11-06 22:13:22,304 INFO L78 Accepts]: Start accepts. Automaton has 8784 states and 13279 transitions. Word has length 156 [2019-11-06 22:13:22,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:22,308 INFO L462 AbstractCegarLoop]: Abstraction has 8784 states and 13279 transitions. [2019-11-06 22:13:22,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:13:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 8784 states and 13279 transitions. [2019-11-06 22:13:22,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-06 22:13:22,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:22,318 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:13:22,319 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:22,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:22,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1122789079, now seen corresponding path program 1 times [2019-11-06 22:13:22,319 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:22,319 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219451637] [2019-11-06 22:13:22,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:22,583 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-11-06 22:13:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:22,623 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219451637] [2019-11-06 22:13:22,625 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:22,625 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:13:22,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607444837] [2019-11-06 22:13:22,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:13:22,626 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:22,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:13:22,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:13:22,627 INFO L87 Difference]: Start difference. First operand 8784 states and 13279 transitions. Second operand 4 states. [2019-11-06 22:13:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:25,202 INFO L93 Difference]: Finished difference Result 25169 states and 38128 transitions. [2019-11-06 22:13:25,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:13:25,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-06 22:13:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:25,235 INFO L225 Difference]: With dead ends: 25169 [2019-11-06 22:13:25,236 INFO L226 Difference]: Without dead ends: 16843 [2019-11-06 22:13:25,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:13:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16843 states. [2019-11-06 22:13:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16843 to 16841. [2019-11-06 22:13:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16841 states. [2019-11-06 22:13:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16841 states to 16841 states and 25210 transitions. [2019-11-06 22:13:25,863 INFO L78 Accepts]: Start accepts. Automaton has 16841 states and 25210 transitions. Word has length 158 [2019-11-06 22:13:25,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:25,864 INFO L462 AbstractCegarLoop]: Abstraction has 16841 states and 25210 transitions. [2019-11-06 22:13:25,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:13:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 16841 states and 25210 transitions. [2019-11-06 22:13:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-06 22:13:25,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:25,877 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:13:25,877 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:25,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:25,878 INFO L82 PathProgramCache]: Analyzing trace with hash 725817844, now seen corresponding path program 1 times [2019-11-06 22:13:25,878 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:25,878 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519953464] [2019-11-06 22:13:25,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:26,369 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-11-06 22:13:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:26,426 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519953464] [2019-11-06 22:13:26,426 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:26,426 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:13:26,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875470726] [2019-11-06 22:13:26,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:13:26,428 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:26,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:13:26,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:13:26,428 INFO L87 Difference]: Start difference. First operand 16841 states and 25210 transitions. Second operand 5 states. [2019-11-06 22:13:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:13:28,010 INFO L93 Difference]: Finished difference Result 26903 states and 40236 transitions. [2019-11-06 22:13:28,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:13:28,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-11-06 22:13:28,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:13:28,041 INFO L225 Difference]: With dead ends: 26903 [2019-11-06 22:13:28,041 INFO L226 Difference]: Without dead ends: 13712 [2019-11-06 22:13:28,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:13:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13712 states. [2019-11-06 22:13:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13712 to 13712. [2019-11-06 22:13:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13712 states. [2019-11-06 22:13:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13712 states to 13712 states and 20437 transitions. [2019-11-06 22:13:28,690 INFO L78 Accepts]: Start accepts. Automaton has 13712 states and 20437 transitions. Word has length 158 [2019-11-06 22:13:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:13:28,690 INFO L462 AbstractCegarLoop]: Abstraction has 13712 states and 20437 transitions. [2019-11-06 22:13:28,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:13:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 13712 states and 20437 transitions. [2019-11-06 22:13:28,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-06 22:13:28,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:13:28,699 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:13:28,700 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:13:28,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:13:28,700 INFO L82 PathProgramCache]: Analyzing trace with hash 579616721, now seen corresponding path program 1 times [2019-11-06 22:13:28,700 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:13:28,700 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534405599] [2019-11-06 22:13:28,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:13:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:29,130 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-11-06 22:13:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:13:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:13:29,177 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534405599] [2019-11-06 22:13:29,178 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:13:29,178 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:13:29,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378704121] [2019-11-06 22:13:29,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:13:29,179 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:13:29,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:13:29,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:13:29,179 INFO L87 Difference]: Start difference. First operand 13712 states and 20437 transitions. Second operand 5 states.