/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_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:15:05,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:15:05,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:15:05,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:15:05,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:15:05,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:15:05,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:15:05,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:15:05,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:15:05,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:15:05,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:15:05,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:15:05,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:15:05,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:15:05,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:15:05,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:15:05,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:15:05,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:15:05,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:15:05,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:15:05,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:15:05,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:15:05,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:15:05,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:15:05,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:15:05,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:15:05,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:15:05,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:15:05,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:15:05,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:15:05,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:15:05,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:15:05,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:15:05,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:15:05,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:15:05,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:15:05,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:15:05,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:15:05,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:15:05,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:15:05,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:15:05,723 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:15:05,737 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:15:05,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:15:05,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:15:05,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:15:05,739 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:15:05,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:15:05,739 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:15:05,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:15:05,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:15:05,740 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:15:05,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:15:05,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:15:05,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:15:05,741 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:15:05,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:15:05,741 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:15:05,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:15:05,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:15:05,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:15:05,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:15:05,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:15:05,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:15:05,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:15:05,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:15:05,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:15:05,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:15:05,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:15:05,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:15:05,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:15:06,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:15:06,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:15:06,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:15:06,040 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:15:06,040 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:15:06,041 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-06 22:15:06,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69478459b/d9a76b540f1640078b49af26c9e5758b/FLAG4650fa5c4 [2019-11-06 22:15:06,679 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:15:06,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-06 22:15:06,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69478459b/d9a76b540f1640078b49af26c9e5758b/FLAG4650fa5c4 [2019-11-06 22:15:06,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69478459b/d9a76b540f1640078b49af26c9e5758b [2019-11-06 22:15:06,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:15:06,943 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:15:06,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:15:06,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:15:06,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:15:06,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:06" (1/1) ... [2019-11-06 22:15:06,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6689ec52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:06, skipping insertion in model container [2019-11-06 22:15:06,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:06" (1/1) ... [2019-11-06 22:15:06,965 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:15:07,025 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:15:07,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:15:07,588 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:15:07,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:15:08,022 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:15:08,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:08 WrapperNode [2019-11-06 22:15:08,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:15:08,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:15:08,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:15:08,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:15:08,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:08" (1/1) ... [2019-11-06 22:15:08,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:08" (1/1) ... [2019-11-06 22:15:08,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:08" (1/1) ... [2019-11-06 22:15:08,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:08" (1/1) ... [2019-11-06 22:15:08,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:08" (1/1) ... [2019-11-06 22:15:08,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:08" (1/1) ... [2019-11-06 22:15:08,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:08" (1/1) ... [2019-11-06 22:15:08,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:15:08,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:15:08,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:15:08,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:15:08,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:08" (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:15:08,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:15:08,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:15:08,200 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:15:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:15:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:15:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 22:15:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-06 22:15:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:15:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-06 22:15:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-06 22:15:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-06 22:15:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-06 22:15:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-06 22:15:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 22:15:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 22:15:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:15:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:15:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:15:09,814 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:15:09,815 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 22:15:09,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:09 BoogieIcfgContainer [2019-11-06 22:15:09,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:15:09,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:15:09,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:15:09,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:15:09,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:15:06" (1/3) ... [2019-11-06 22:15:09,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53af0a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:09, skipping insertion in model container [2019-11-06 22:15:09,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:08" (2/3) ... [2019-11-06 22:15:09,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53af0a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:09, skipping insertion in model container [2019-11-06 22:15:09,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:09" (3/3) ... [2019-11-06 22:15:09,826 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-06 22:15:09,838 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:15:09,849 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:15:09,863 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:15:09,904 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:15:09,904 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:15:09,904 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:15:09,904 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:15:09,905 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:15:09,905 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:15:09,905 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:15:09,905 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:15:09,946 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states. [2019-11-06 22:15:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-06 22:15:09,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:09,970 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] [2019-11-06 22:15:09,974 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:09,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:09,980 INFO L82 PathProgramCache]: Analyzing trace with hash 424996304, now seen corresponding path program 1 times [2019-11-06 22:15:09,989 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:09,990 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328030392] [2019-11-06 22:15:09,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:11,040 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:11,122 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:15:11,123 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328030392] [2019-11-06 22:15:11,123 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:11,124 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:11,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318664103] [2019-11-06 22:15:11,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:11,131 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:11,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:11,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:11,147 INFO L87 Difference]: Start difference. First operand 342 states. Second operand 4 states. [2019-11-06 22:15:11,465 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-11-06 22:15:13,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:13,247 INFO L93 Difference]: Finished difference Result 655 states and 1134 transitions. [2019-11-06 22:15:13,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:13,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-06 22:15:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:13,270 INFO L225 Difference]: With dead ends: 655 [2019-11-06 22:15:13,271 INFO L226 Difference]: Without dead ends: 540 [2019-11-06 22:15:13,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:13,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-06 22:15:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2019-11-06 22:15:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-06 22:15:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 803 transitions. [2019-11-06 22:15:13,392 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 803 transitions. Word has length 157 [2019-11-06 22:15:13,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:13,396 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 803 transitions. [2019-11-06 22:15:13,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 803 transitions. [2019-11-06 22:15:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-06 22:15:13,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:13,403 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] [2019-11-06 22:15:13,403 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:13,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:13,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1469457116, now seen corresponding path program 1 times [2019-11-06 22:15:13,404 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:13,404 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655053593] [2019-11-06 22:15:13,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:14,093 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:14,146 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:15:14,146 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655053593] [2019-11-06 22:15:14,146 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:14,147 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:14,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979490750] [2019-11-06 22:15:14,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:14,149 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:14,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:14,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:14,150 INFO L87 Difference]: Start difference. First operand 538 states and 803 transitions. Second operand 5 states. [2019-11-06 22:15:16,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:16,475 INFO L93 Difference]: Finished difference Result 1561 states and 2326 transitions. [2019-11-06 22:15:16,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:16,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-11-06 22:15:16,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:16,489 INFO L225 Difference]: With dead ends: 1561 [2019-11-06 22:15:16,489 INFO L226 Difference]: Without dead ends: 1036 [2019-11-06 22:15:16,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:15:16,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-11-06 22:15:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2019-11-06 22:15:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2019-11-06 22:15:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1529 transitions. [2019-11-06 22:15:16,568 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1529 transitions. Word has length 157 [2019-11-06 22:15:16,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:16,569 INFO L462 AbstractCegarLoop]: Abstraction has 1034 states and 1529 transitions. [2019-11-06 22:15:16,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:16,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1529 transitions. [2019-11-06 22:15:16,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-06 22:15:16,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:16,573 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:15:16,573 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:16,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:16,574 INFO L82 PathProgramCache]: Analyzing trace with hash -790671312, now seen corresponding path program 1 times [2019-11-06 22:15:16,574 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:16,574 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146587933] [2019-11-06 22:15:16,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:16,939 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:17,004 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:15:17,005 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146587933] [2019-11-06 22:15:17,005 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:17,006 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:17,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420208554] [2019-11-06 22:15:17,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:17,014 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:17,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:17,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:17,016 INFO L87 Difference]: Start difference. First operand 1034 states and 1529 transitions. Second operand 4 states. [2019-11-06 22:15:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:19,045 INFO L93 Difference]: Finished difference Result 3056 states and 4517 transitions. [2019-11-06 22:15:19,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:19,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-06 22:15:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:19,058 INFO L225 Difference]: With dead ends: 3056 [2019-11-06 22:15:19,058 INFO L226 Difference]: Without dead ends: 2054 [2019-11-06 22:15:19,062 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:15:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2019-11-06 22:15:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1036. [2019-11-06 22:15:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-11-06 22:15:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1531 transitions. [2019-11-06 22:15:19,124 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1531 transitions. Word has length 158 [2019-11-06 22:15:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:19,125 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 1531 transitions. [2019-11-06 22:15:19,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:19,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1531 transitions. [2019-11-06 22:15:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-06 22:15:19,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:19,129 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] [2019-11-06 22:15:19,129 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:19,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:19,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1966932605, now seen corresponding path program 1 times [2019-11-06 22:15:19,130 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:19,130 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320646333] [2019-11-06 22:15:19,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:19,579 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:19,625 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:15:19,625 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320646333] [2019-11-06 22:15:19,625 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:19,626 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:19,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362763151] [2019-11-06 22:15:19,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:19,627 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:19,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:19,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:19,628 INFO L87 Difference]: Start difference. First operand 1036 states and 1531 transitions. Second operand 5 states. [2019-11-06 22:15:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:21,149 INFO L93 Difference]: Finished difference Result 2054 states and 3037 transitions. [2019-11-06 22:15:21,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:21,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-11-06 22:15:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:21,158 INFO L225 Difference]: With dead ends: 2054 [2019-11-06 22:15:21,158 INFO L226 Difference]: Without dead ends: 1036 [2019-11-06 22:15:21,161 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:15:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-11-06 22:15:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1035. [2019-11-06 22:15:21,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-11-06 22:15:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1528 transitions. [2019-11-06 22:15:21,226 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1528 transitions. Word has length 159 [2019-11-06 22:15:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:21,227 INFO L462 AbstractCegarLoop]: Abstraction has 1035 states and 1528 transitions. [2019-11-06 22:15:21,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1528 transitions. [2019-11-06 22:15:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-06 22:15:21,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:21,232 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] [2019-11-06 22:15:21,233 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:21,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:21,233 INFO L82 PathProgramCache]: Analyzing trace with hash 745680526, now seen corresponding path program 1 times [2019-11-06 22:15:21,234 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:21,234 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479046135] [2019-11-06 22:15:21,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:21,620 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:21,675 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:15:21,676 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479046135] [2019-11-06 22:15:21,677 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:21,677 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:21,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125385633] [2019-11-06 22:15:21,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:21,678 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:21,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:21,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:21,679 INFO L87 Difference]: Start difference. First operand 1035 states and 1528 transitions. Second operand 4 states. [2019-11-06 22:15:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:24,189 INFO L93 Difference]: Finished difference Result 2834 states and 4197 transitions. [2019-11-06 22:15:24,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:24,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-06 22:15:24,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:24,201 INFO L225 Difference]: With dead ends: 2834 [2019-11-06 22:15:24,201 INFO L226 Difference]: Without dead ends: 1997 [2019-11-06 22:15:24,204 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:15:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-11-06 22:15:24,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1995. [2019-11-06 22:15:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2019-11-06 22:15:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2918 transitions. [2019-11-06 22:15:24,323 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2918 transitions. Word has length 159 [2019-11-06 22:15:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:24,325 INFO L462 AbstractCegarLoop]: Abstraction has 1995 states and 2918 transitions. [2019-11-06 22:15:24,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2918 transitions. [2019-11-06 22:15:24,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-06 22:15:24,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:24,330 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] [2019-11-06 22:15:24,330 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:24,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:24,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1379415471, now seen corresponding path program 1 times [2019-11-06 22:15:24,331 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:24,331 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221021306] [2019-11-06 22:15:24,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:24,711 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:24,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-11-06 22:15:24,751 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221021306] [2019-11-06 22:15:24,751 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:24,751 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:24,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730775288] [2019-11-06 22:15:24,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:24,752 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:24,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:24,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:24,753 INFO L87 Difference]: Start difference. First operand 1995 states and 2918 transitions. Second operand 5 states. [2019-11-06 22:15:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:26,211 INFO L93 Difference]: Finished difference Result 3337 states and 4898 transitions. [2019-11-06 22:15:26,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:26,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-11-06 22:15:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:26,220 INFO L225 Difference]: With dead ends: 3337 [2019-11-06 22:15:26,221 INFO L226 Difference]: Without dead ends: 1528 [2019-11-06 22:15:26,224 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:15:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2019-11-06 22:15:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1528. [2019-11-06 22:15:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-11-06 22:15:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2228 transitions. [2019-11-06 22:15:26,281 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2228 transitions. Word has length 159 [2019-11-06 22:15:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:26,281 INFO L462 AbstractCegarLoop]: Abstraction has 1528 states and 2228 transitions. [2019-11-06 22:15:26,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2228 transitions. [2019-11-06 22:15:26,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-06 22:15:26,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:26,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, 1, 1, 1, 1, 1] [2019-11-06 22:15:26,285 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:26,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:26,285 INFO L82 PathProgramCache]: Analyzing trace with hash -51426036, now seen corresponding path program 1 times [2019-11-06 22:15:26,286 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:26,286 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636312225] [2019-11-06 22:15:26,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:26,552 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:26,585 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:15:26,586 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636312225] [2019-11-06 22:15:26,586 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:26,586 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:26,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158757267] [2019-11-06 22:15:26,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:26,587 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:26,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:26,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:26,589 INFO L87 Difference]: Start difference. First operand 1528 states and 2228 transitions. Second operand 4 states. [2019-11-06 22:15:28,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:28,428 INFO L93 Difference]: Finished difference Result 3607 states and 5375 transitions. [2019-11-06 22:15:28,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:28,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-06 22:15:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:28,440 INFO L225 Difference]: With dead ends: 3607 [2019-11-06 22:15:28,440 INFO L226 Difference]: Without dead ends: 2268 [2019-11-06 22:15:28,443 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:15:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2019-11-06 22:15:28,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1952. [2019-11-06 22:15:28,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-11-06 22:15:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 2916 transitions. [2019-11-06 22:15:28,523 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 2916 transitions. Word has length 161 [2019-11-06 22:15:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:28,524 INFO L462 AbstractCegarLoop]: Abstraction has 1952 states and 2916 transitions. [2019-11-06 22:15:28,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2916 transitions. [2019-11-06 22:15:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-06 22:15:28,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:28,528 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] [2019-11-06 22:15:28,528 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:28,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:28,528 INFO L82 PathProgramCache]: Analyzing trace with hash -541662678, now seen corresponding path program 1 times [2019-11-06 22:15:28,529 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:28,529 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145996287] [2019-11-06 22:15:28,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:28,810 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:28,846 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:15:28,846 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145996287] [2019-11-06 22:15:28,847 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:28,847 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:28,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870071397] [2019-11-06 22:15:28,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:28,848 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:28,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:28,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:28,850 INFO L87 Difference]: Start difference. First operand 1952 states and 2916 transitions. Second operand 4 states. [2019-11-06 22:15:30,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:30,702 INFO L93 Difference]: Finished difference Result 4665 states and 7121 transitions. [2019-11-06 22:15:30,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:30,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-06 22:15:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:30,715 INFO L225 Difference]: With dead ends: 4665 [2019-11-06 22:15:30,715 INFO L226 Difference]: Without dead ends: 2986 [2019-11-06 22:15:30,719 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:15:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2019-11-06 22:15:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2706. [2019-11-06 22:15:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2019-11-06 22:15:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4137 transitions. [2019-11-06 22:15:30,842 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4137 transitions. Word has length 163 [2019-11-06 22:15:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:30,842 INFO L462 AbstractCegarLoop]: Abstraction has 2706 states and 4137 transitions. [2019-11-06 22:15:30,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4137 transitions. [2019-11-06 22:15:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-06 22:15:30,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:30,846 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:15:30,847 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:30,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:30,847 INFO L82 PathProgramCache]: Analyzing trace with hash 911873176, now seen corresponding path program 1 times [2019-11-06 22:15:30,847 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:30,847 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244773435] [2019-11-06 22:15:30,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:31,252 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:31,301 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:15:31,302 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244773435] [2019-11-06 22:15:31,303 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:31,303 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:31,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475077320] [2019-11-06 22:15:31,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:15:31,304 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:31,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:15:31,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:15:31,305 INFO L87 Difference]: Start difference. First operand 2706 states and 4137 transitions. Second operand 6 states. [2019-11-06 22:15:31,582 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2019-11-06 22:15:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:33,070 INFO L93 Difference]: Finished difference Result 7601 states and 11754 transitions. [2019-11-06 22:15:33,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:15:33,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-11-06 22:15:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:33,093 INFO L225 Difference]: With dead ends: 7601 [2019-11-06 22:15:33,093 INFO L226 Difference]: Without dead ends: 5078 [2019-11-06 22:15:33,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:15:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2019-11-06 22:15:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 5076. [2019-11-06 22:15:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2019-11-06 22:15:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7791 transitions. [2019-11-06 22:15:33,395 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7791 transitions. Word has length 164 [2019-11-06 22:15:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:33,395 INFO L462 AbstractCegarLoop]: Abstraction has 5076 states and 7791 transitions. [2019-11-06 22:15:33,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:15:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7791 transitions. [2019-11-06 22:15:33,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-06 22:15:33,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:33,405 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:15:33,405 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:33,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:33,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2112908957, now seen corresponding path program 1 times [2019-11-06 22:15:33,414 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:33,415 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825334944] [2019-11-06 22:15:33,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:33,863 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:33,906 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:15:33,907 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825334944] [2019-11-06 22:15:33,907 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:33,907 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:15:33,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196684269] [2019-11-06 22:15:33,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:15:33,908 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:33,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:15:33,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:15:33,909 INFO L87 Difference]: Start difference. First operand 5076 states and 7791 transitions. Second operand 5 states. [2019-11-06 22:15:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:36,315 INFO L93 Difference]: Finished difference Result 13239 states and 20333 transitions. [2019-11-06 22:15:36,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:15:36,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-11-06 22:15:36,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:36,356 INFO L225 Difference]: With dead ends: 13239 [2019-11-06 22:15:36,356 INFO L226 Difference]: Without dead ends: 8194 [2019-11-06 22:15:36,366 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:15:36,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8194 states. [2019-11-06 22:15:36,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8194 to 8192. [2019-11-06 22:15:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8192 states. [2019-11-06 22:15:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 12471 transitions. [2019-11-06 22:15:36,743 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 12471 transitions. Word has length 164 [2019-11-06 22:15:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:36,746 INFO L462 AbstractCegarLoop]: Abstraction has 8192 states and 12471 transitions. [2019-11-06 22:15:36,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:15:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 12471 transitions. [2019-11-06 22:15:36,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-06 22:15:36,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:36,753 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, 1, 1] [2019-11-06 22:15:36,754 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:36,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:36,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1008257189, now seen corresponding path program 1 times [2019-11-06 22:15:36,754 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:36,755 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367861974] [2019-11-06 22:15:36,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:37,116 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:37,158 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:15:37,158 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367861974] [2019-11-06 22:15:37,159 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:37,159 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:37,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170796915] [2019-11-06 22:15:37,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:37,160 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:37,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:37,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:37,160 INFO L87 Difference]: Start difference. First operand 8192 states and 12471 transitions. Second operand 4 states. [2019-11-06 22:15:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:38,996 INFO L93 Difference]: Finished difference Result 20555 states and 31330 transitions. [2019-11-06 22:15:38,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:15:38,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-06 22:15:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:39,025 INFO L225 Difference]: With dead ends: 20555 [2019-11-06 22:15:39,026 INFO L226 Difference]: Without dead ends: 12739 [2019-11-06 22:15:39,039 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:15:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12739 states. [2019-11-06 22:15:39,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12739 to 12737. [2019-11-06 22:15:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12737 states. [2019-11-06 22:15:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12737 states to 12737 states and 19158 transitions. [2019-11-06 22:15:39,651 INFO L78 Accepts]: Start accepts. Automaton has 12737 states and 19158 transitions. Word has length 166 [2019-11-06 22:15:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:39,651 INFO L462 AbstractCegarLoop]: Abstraction has 12737 states and 19158 transitions. [2019-11-06 22:15:39,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:15:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 12737 states and 19158 transitions. [2019-11-06 22:15:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-06 22:15:39,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:39,661 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, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:39,661 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:39,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1356015054, now seen corresponding path program 1 times [2019-11-06 22:15:39,662 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:39,662 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546898199] [2019-11-06 22:15:39,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:40,110 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2019-11-06 22:15:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:40,170 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:15:40,171 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546898199] [2019-11-06 22:15:40,171 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:40,171 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:15:40,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284975293] [2019-11-06 22:15:40,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:15:40,178 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:40,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:15:40,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:15:40,178 INFO L87 Difference]: Start difference. First operand 12737 states and 19158 transitions. Second operand 4 states.