/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/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:16:05,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:16:05,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:16:05,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:16:05,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:16:05,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:16:05,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:16:05,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:16:05,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:16:05,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:16:05,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:16:05,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:16:05,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:16:05,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:16:05,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:16:05,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:16:05,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:16:05,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:16:05,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:16:05,308 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:16:05,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:16:05,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:16:05,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:16:05,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:16:05,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:16:05,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:16:05,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:16:05,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:16:05,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:16:05,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:16:05,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:16:05,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:16:05,328 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:16:05,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:16:05,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:16:05,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:16:05,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:16:05,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:16:05,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:16:05,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:16:05,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:16:05,334 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:16:05,348 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:16:05,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:16:05,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:16:05,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:16:05,350 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:16:05,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:16:05,350 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:16:05,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:16:05,350 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:16:05,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:16:05,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:16:05,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:16:05,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:16:05,351 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:16:05,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:16:05,352 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:16:05,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:16:05,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:16:05,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:16:05,352 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:16:05,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:16:05,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:16:05,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:16:05,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:16:05,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:16:05,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:16:05,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:16:05,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:16:05,354 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:16:05,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:16:05,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:16:05,663 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:16:05,664 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:16:05,665 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:16:05,665 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-06 22:16:05,727 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1edaf0b77/c42bc6223202437eb3640e36bd57fb02/FLAG8601db3a6 [2019-11-06 22:16:06,202 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:16:06,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-06 22:16:06,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1edaf0b77/c42bc6223202437eb3640e36bd57fb02/FLAG8601db3a6 [2019-11-06 22:16:06,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1edaf0b77/c42bc6223202437eb3640e36bd57fb02 [2019-11-06 22:16:06,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:16:06,567 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:16:06,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:16:06,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:16:06,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:16:06,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:16:06" (1/1) ... [2019-11-06 22:16:06,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6731947f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:06, skipping insertion in model container [2019-11-06 22:16:06,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:16:06" (1/1) ... [2019-11-06 22:16:06,583 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:16:06,631 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:16:06,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:16:06,994 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:16:07,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:16:07,077 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:16:07,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:07 WrapperNode [2019-11-06 22:16:07,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:16:07,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:16:07,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:16:07,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:16:07,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:07" (1/1) ... [2019-11-06 22:16:07,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:07" (1/1) ... [2019-11-06 22:16:07,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:07" (1/1) ... [2019-11-06 22:16:07,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:07" (1/1) ... [2019-11-06 22:16:07,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:07" (1/1) ... [2019-11-06 22:16:07,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:07" (1/1) ... [2019-11-06 22:16:07,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:07" (1/1) ... [2019-11-06 22:16:07,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:16:07,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:16:07,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:16:07,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:16:07,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:07" (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:16:07,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:16:07,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:16:07,200 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-11-06 22:16:07,200 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-11-06 22:16:07,200 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-11-06 22:16:07,201 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-11-06 22:16:07,201 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-11-06 22:16:07,201 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-11-06 22:16:07,201 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-06 22:16:07,201 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-11-06 22:16:07,201 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-11-06 22:16:07,202 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-11-06 22:16:07,202 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-11-06 22:16:07,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:16:07,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-11-06 22:16:07,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:16:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:16:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 22:16:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-06 22:16:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-06 22:16:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:16:07,203 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-06 22:16:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-11-06 22:16:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-11-06 22:16:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-11-06 22:16:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-11-06 22:16:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-11-06 22:16:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 22:16:07,205 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 22:16:07,205 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-11-06 22:16:07,205 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-11-06 22:16:07,205 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-11-06 22:16:07,205 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-11-06 22:16:07,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:16:07,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:16:07,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:16:08,030 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:16:08,031 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 22:16:08,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:16:08 BoogieIcfgContainer [2019-11-06 22:16:08,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:16:08,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:16:08,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:16:08,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:16:08,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:16:06" (1/3) ... [2019-11-06 22:16:08,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b3cfc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:16:08, skipping insertion in model container [2019-11-06 22:16:08,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:16:07" (2/3) ... [2019-11-06 22:16:08,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b3cfc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:16:08, skipping insertion in model container [2019-11-06 22:16:08,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:16:08" (3/3) ... [2019-11-06 22:16:08,040 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-11-06 22:16:08,050 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:16:08,058 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:16:08,069 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:16:08,095 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:16:08,095 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:16:08,096 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:16:08,096 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:16:08,096 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:16:08,096 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:16:08,096 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:16:08,097 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:16:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states. [2019-11-06 22:16:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 22:16:08,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:08,131 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] [2019-11-06 22:16:08,135 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:08,141 INFO L82 PathProgramCache]: Analyzing trace with hash 310880814, now seen corresponding path program 1 times [2019-11-06 22:16:08,149 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:08,150 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851172596] [2019-11-06 22:16:08,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,619 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-06 22:16:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,646 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:16:08,646 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851172596] [2019-11-06 22:16:08,647 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:08,648 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:08,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671511277] [2019-11-06 22:16:08,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:08,654 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:08,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:08,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:08,671 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 5 states. [2019-11-06 22:16:09,014 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-06 22:16:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:10,310 INFO L93 Difference]: Finished difference Result 416 states and 679 transitions. [2019-11-06 22:16:10,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:10,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-06 22:16:10,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:10,328 INFO L225 Difference]: With dead ends: 416 [2019-11-06 22:16:10,328 INFO L226 Difference]: Without dead ends: 216 [2019-11-06 22:16:10,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-06 22:16:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2019-11-06 22:16:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-06 22:16:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 313 transitions. [2019-11-06 22:16:10,415 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 313 transitions. Word has length 21 [2019-11-06 22:16:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:10,416 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 313 transitions. [2019-11-06 22:16:10,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 313 transitions. [2019-11-06 22:16:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 22:16:10,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:10,420 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] [2019-11-06 22:16:10,420 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:10,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1405375627, now seen corresponding path program 1 times [2019-11-06 22:16:10,421 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:10,422 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60905318] [2019-11-06 22:16:10,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:16:10,664 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60905318] [2019-11-06 22:16:10,664 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:10,665 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:10,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781125232] [2019-11-06 22:16:10,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:10,667 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:10,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:10,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:10,668 INFO L87 Difference]: Start difference. First operand 210 states and 313 transitions. Second operand 5 states. [2019-11-06 22:16:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:12,065 INFO L93 Difference]: Finished difference Result 431 states and 649 transitions. [2019-11-06 22:16:12,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:12,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-06 22:16:12,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:12,070 INFO L225 Difference]: With dead ends: 431 [2019-11-06 22:16:12,070 INFO L226 Difference]: Without dead ends: 230 [2019-11-06 22:16:12,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-06 22:16:12,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2019-11-06 22:16:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-06 22:16:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 329 transitions. [2019-11-06 22:16:12,106 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 329 transitions. Word has length 22 [2019-11-06 22:16:12,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:12,106 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 329 transitions. [2019-11-06 22:16:12,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 329 transitions. [2019-11-06 22:16:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 22:16:12,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:12,109 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 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:16:12,109 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:12,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:12,110 INFO L82 PathProgramCache]: Analyzing trace with hash -152672816, now seen corresponding path program 1 times [2019-11-06 22:16:12,110 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:12,110 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325622854] [2019-11-06 22:16:12,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:16:12,284 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325622854] [2019-11-06 22:16:12,284 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:12,284 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:16:12,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509558967] [2019-11-06 22:16:12,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:16:12,285 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:12,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:16:12,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:16:12,286 INFO L87 Difference]: Start difference. First operand 223 states and 329 transitions. Second operand 4 states. [2019-11-06 22:16:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:13,382 INFO L93 Difference]: Finished difference Result 463 states and 695 transitions. [2019-11-06 22:16:13,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:16:13,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-06 22:16:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:13,388 INFO L225 Difference]: With dead ends: 463 [2019-11-06 22:16:13,388 INFO L226 Difference]: Without dead ends: 256 [2019-11-06 22:16:13,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-06 22:16:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 225. [2019-11-06 22:16:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-06 22:16:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 331 transitions. [2019-11-06 22:16:13,443 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 331 transitions. Word has length 30 [2019-11-06 22:16:13,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:13,444 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 331 transitions. [2019-11-06 22:16:13,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:16:13,444 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 331 transitions. [2019-11-06 22:16:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 22:16:13,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:13,446 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:13,446 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:13,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:13,447 INFO L82 PathProgramCache]: Analyzing trace with hash 279611359, now seen corresponding path program 1 times [2019-11-06 22:16:13,447 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:13,447 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135300803] [2019-11-06 22:16:13,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:16:13,667 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135300803] [2019-11-06 22:16:13,667 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:13,667 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:16:13,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448998687] [2019-11-06 22:16:13,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:16:13,668 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:13,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:16:13,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:16:13,669 INFO L87 Difference]: Start difference. First operand 225 states and 331 transitions. Second operand 6 states. [2019-11-06 22:16:15,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:15,178 INFO L93 Difference]: Finished difference Result 440 states and 653 transitions. [2019-11-06 22:16:15,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:15,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-11-06 22:16:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:15,181 INFO L225 Difference]: With dead ends: 440 [2019-11-06 22:16:15,181 INFO L226 Difference]: Without dead ends: 237 [2019-11-06 22:16:15,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:16:15,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-06 22:16:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 229. [2019-11-06 22:16:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-06 22:16:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 335 transitions. [2019-11-06 22:16:15,225 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 335 transitions. Word has length 38 [2019-11-06 22:16:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:15,225 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 335 transitions. [2019-11-06 22:16:15,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:16:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 335 transitions. [2019-11-06 22:16:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 22:16:15,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:15,234 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] [2019-11-06 22:16:15,234 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:15,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:15,235 INFO L82 PathProgramCache]: Analyzing trace with hash -955467248, now seen corresponding path program 1 times [2019-11-06 22:16:15,235 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:15,235 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403345181] [2019-11-06 22:16:15,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:15,449 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:16:15,449 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403345181] [2019-11-06 22:16:15,450 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:15,450 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:15,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783886974] [2019-11-06 22:16:15,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:15,451 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:15,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:15,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:15,452 INFO L87 Difference]: Start difference. First operand 229 states and 335 transitions. Second operand 5 states. [2019-11-06 22:16:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:16,649 INFO L93 Difference]: Finished difference Result 401 states and 592 transitions. [2019-11-06 22:16:16,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:16:16,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-06 22:16:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:16,657 INFO L225 Difference]: With dead ends: 401 [2019-11-06 22:16:16,657 INFO L226 Difference]: Without dead ends: 229 [2019-11-06 22:16:16,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:16:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-06 22:16:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2019-11-06 22:16:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-06 22:16:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 326 transitions. [2019-11-06 22:16:16,689 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 326 transitions. Word has length 39 [2019-11-06 22:16:16,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:16,690 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 326 transitions. [2019-11-06 22:16:16,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 326 transitions. [2019-11-06 22:16:16,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 22:16:16,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:16,693 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:16,693 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:16,694 INFO L82 PathProgramCache]: Analyzing trace with hash -13889788, now seen corresponding path program 1 times [2019-11-06 22:16:16,694 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:16,694 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373428852] [2019-11-06 22:16:16,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 22:16:16,878 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373428852] [2019-11-06 22:16:16,878 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:16,878 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:16,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712477658] [2019-11-06 22:16:16,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:16,879 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:16,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:16,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:16,881 INFO L87 Difference]: Start difference. First operand 225 states and 326 transitions. Second operand 5 states. [2019-11-06 22:16:18,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:18,232 INFO L93 Difference]: Finished difference Result 450 states and 662 transitions. [2019-11-06 22:16:18,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:18,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-06 22:16:18,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:18,236 INFO L225 Difference]: With dead ends: 450 [2019-11-06 22:16:18,236 INFO L226 Difference]: Without dead ends: 248 [2019-11-06 22:16:18,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-06 22:16:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 241. [2019-11-06 22:16:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-06 22:16:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 345 transitions. [2019-11-06 22:16:18,261 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 345 transitions. Word has length 41 [2019-11-06 22:16:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:18,262 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 345 transitions. [2019-11-06 22:16:18,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 345 transitions. [2019-11-06 22:16:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 22:16:18,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:18,263 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:18,263 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:18,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:18,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1194739861, now seen corresponding path program 1 times [2019-11-06 22:16:18,264 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:18,264 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857119720] [2019-11-06 22:16:18,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-06 22:16:18,400 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857119720] [2019-11-06 22:16:18,400 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:18,400 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:18,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375061802] [2019-11-06 22:16:18,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:18,401 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:18,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:18,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:18,402 INFO L87 Difference]: Start difference. First operand 241 states and 345 transitions. Second operand 5 states. [2019-11-06 22:16:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:19,716 INFO L93 Difference]: Finished difference Result 470 states and 690 transitions. [2019-11-06 22:16:19,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:19,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-06 22:16:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:19,719 INFO L225 Difference]: With dead ends: 470 [2019-11-06 22:16:19,720 INFO L226 Difference]: Without dead ends: 254 [2019-11-06 22:16:19,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-06 22:16:19,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2019-11-06 22:16:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-06 22:16:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 353 transitions. [2019-11-06 22:16:19,753 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 353 transitions. Word has length 41 [2019-11-06 22:16:19,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:19,755 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 353 transitions. [2019-11-06 22:16:19,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 353 transitions. [2019-11-06 22:16:19,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-06 22:16:19,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:19,759 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:19,759 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:19,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:19,759 INFO L82 PathProgramCache]: Analyzing trace with hash -291623798, now seen corresponding path program 1 times [2019-11-06 22:16:19,760 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:19,760 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224813034] [2019-11-06 22:16:19,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-06 22:16:19,933 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224813034] [2019-11-06 22:16:19,933 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:19,933 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:16:19,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149506576] [2019-11-06 22:16:19,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:16:19,935 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:19,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:16:19,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:16:19,937 INFO L87 Difference]: Start difference. First operand 248 states and 353 transitions. Second operand 6 states. [2019-11-06 22:16:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:21,459 INFO L93 Difference]: Finished difference Result 469 states and 677 transitions. [2019-11-06 22:16:21,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:21,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-11-06 22:16:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:21,462 INFO L225 Difference]: With dead ends: 469 [2019-11-06 22:16:21,462 INFO L226 Difference]: Without dead ends: 254 [2019-11-06 22:16:21,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:16:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-06 22:16:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2019-11-06 22:16:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-06 22:16:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 352 transitions. [2019-11-06 22:16:21,492 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 352 transitions. Word has length 59 [2019-11-06 22:16:21,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:21,495 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 352 transitions. [2019-11-06 22:16:21,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:16:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 352 transitions. [2019-11-06 22:16:21,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-06 22:16:21,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:21,497 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:21,498 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:21,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:21,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1361992071, now seen corresponding path program 1 times [2019-11-06 22:16:21,498 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:21,500 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527921789] [2019-11-06 22:16:21,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:21,692 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-06 22:16:21,693 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527921789] [2019-11-06 22:16:21,693 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:21,693 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:21,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642411122] [2019-11-06 22:16:21,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:21,698 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:21,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:21,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:21,699 INFO L87 Difference]: Start difference. First operand 248 states and 352 transitions. Second operand 5 states. [2019-11-06 22:16:22,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:22,961 INFO L93 Difference]: Finished difference Result 483 states and 699 transitions. [2019-11-06 22:16:22,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:22,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-11-06 22:16:22,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:22,965 INFO L225 Difference]: With dead ends: 483 [2019-11-06 22:16:22,965 INFO L226 Difference]: Without dead ends: 273 [2019-11-06 22:16:22,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-06 22:16:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 266. [2019-11-06 22:16:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-06 22:16:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2019-11-06 22:16:23,002 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 62 [2019-11-06 22:16:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:23,002 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2019-11-06 22:16:23,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2019-11-06 22:16:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-06 22:16:23,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:23,003 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:23,004 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:23,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:23,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1503019715, now seen corresponding path program 1 times [2019-11-06 22:16:23,004 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:23,005 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802273697] [2019-11-06 22:16:23,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-06 22:16:23,166 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802273697] [2019-11-06 22:16:23,166 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:23,166 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:23,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188247806] [2019-11-06 22:16:23,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:23,168 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:23,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:23,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:23,172 INFO L87 Difference]: Start difference. First operand 266 states and 373 transitions. Second operand 5 states. [2019-11-06 22:16:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:24,417 INFO L93 Difference]: Finished difference Result 490 states and 703 transitions. [2019-11-06 22:16:24,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:16:24,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-06 22:16:24,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:24,420 INFO L225 Difference]: With dead ends: 490 [2019-11-06 22:16:24,420 INFO L226 Difference]: Without dead ends: 264 [2019-11-06 22:16:24,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:16:24,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-11-06 22:16:24,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2019-11-06 22:16:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-06 22:16:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 359 transitions. [2019-11-06 22:16:24,443 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 359 transitions. Word has length 63 [2019-11-06 22:16:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:24,443 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 359 transitions. [2019-11-06 22:16:24,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:24,443 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 359 transitions. [2019-11-06 22:16:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-06 22:16:24,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:24,445 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:24,445 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:24,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:24,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1498693946, now seen corresponding path program 1 times [2019-11-06 22:16:24,446 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:24,446 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496431958] [2019-11-06 22:16:24,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-06 22:16:24,607 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496431958] [2019-11-06 22:16:24,607 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:24,607 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:16:24,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463754098] [2019-11-06 22:16:24,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:16:24,609 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:24,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:16:24,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:16:24,609 INFO L87 Difference]: Start difference. First operand 260 states and 359 transitions. Second operand 6 states. [2019-11-06 22:16:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:25,984 INFO L93 Difference]: Finished difference Result 477 states and 670 transitions. [2019-11-06 22:16:25,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:25,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-06 22:16:25,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:25,989 INFO L225 Difference]: With dead ends: 477 [2019-11-06 22:16:25,989 INFO L226 Difference]: Without dead ends: 266 [2019-11-06 22:16:25,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:16:25,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-06 22:16:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2019-11-06 22:16:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-06 22:16:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 358 transitions. [2019-11-06 22:16:26,011 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 358 transitions. Word has length 82 [2019-11-06 22:16:26,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:26,011 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 358 transitions. [2019-11-06 22:16:26,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:16:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 358 transitions. [2019-11-06 22:16:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-06 22:16:26,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:26,012 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:26,013 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:26,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:26,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1251929143, now seen corresponding path program 1 times [2019-11-06 22:16:26,013 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:26,014 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906110320] [2019-11-06 22:16:26,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-06 22:16:26,174 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906110320] [2019-11-06 22:16:26,174 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:26,175 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:26,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715336915] [2019-11-06 22:16:26,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:26,175 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:26,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:26,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:26,176 INFO L87 Difference]: Start difference. First operand 260 states and 358 transitions. Second operand 5 states. [2019-11-06 22:16:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:27,348 INFO L93 Difference]: Finished difference Result 466 states and 668 transitions. [2019-11-06 22:16:27,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:16:27,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-06 22:16:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:27,352 INFO L225 Difference]: With dead ends: 466 [2019-11-06 22:16:27,352 INFO L226 Difference]: Without dead ends: 262 [2019-11-06 22:16:27,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:16:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-06 22:16:27,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2019-11-06 22:16:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-06 22:16:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 354 transitions. [2019-11-06 22:16:27,373 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 354 transitions. Word has length 85 [2019-11-06 22:16:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:27,373 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 354 transitions. [2019-11-06 22:16:27,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 354 transitions. [2019-11-06 22:16:27,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-06 22:16:27,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:27,375 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:27,375 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:27,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:27,376 INFO L82 PathProgramCache]: Analyzing trace with hash 599019244, now seen corresponding path program 1 times [2019-11-06 22:16:27,376 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:27,376 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629529877] [2019-11-06 22:16:27,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-06 22:16:27,557 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629529877] [2019-11-06 22:16:27,558 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547882416] [2019-11-06 22:16:27,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:16:27,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:16:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-06 22:16:27,788 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:16:27,788 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-06 22:16:27,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973463608] [2019-11-06 22:16:27,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:27,789 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:27,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:27,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:27,790 INFO L87 Difference]: Start difference. First operand 258 states and 354 transitions. Second operand 5 states. [2019-11-06 22:16:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:29,030 INFO L93 Difference]: Finished difference Result 596 states and 828 transitions. [2019-11-06 22:16:29,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:16:29,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-11-06 22:16:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:29,033 INFO L225 Difference]: With dead ends: 596 [2019-11-06 22:16:29,034 INFO L226 Difference]: Without dead ends: 355 [2019-11-06 22:16:29,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:16:29,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-11-06 22:16:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 303. [2019-11-06 22:16:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-11-06 22:16:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 414 transitions. [2019-11-06 22:16:29,063 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 414 transitions. Word has length 100 [2019-11-06 22:16:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:29,064 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 414 transitions. [2019-11-06 22:16:29,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:29,064 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 414 transitions. [2019-11-06 22:16:29,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-06 22:16:29,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:29,066 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:29,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:29,273 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:29,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:29,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1779021272, now seen corresponding path program 1 times [2019-11-06 22:16:29,274 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:29,274 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468691852] [2019-11-06 22:16:29,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-11-06 22:16:29,504 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468691852] [2019-11-06 22:16:29,504 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:29,505 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:29,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083877480] [2019-11-06 22:16:29,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:29,506 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:29,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:29,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:29,507 INFO L87 Difference]: Start difference. First operand 303 states and 414 transitions. Second operand 5 states. [2019-11-06 22:16:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:30,892 INFO L93 Difference]: Finished difference Result 479 states and 666 transitions. [2019-11-06 22:16:30,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:30,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-11-06 22:16:30,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:30,897 INFO L225 Difference]: With dead ends: 479 [2019-11-06 22:16:30,897 INFO L226 Difference]: Without dead ends: 296 [2019-11-06 22:16:30,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-06 22:16:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-11-06 22:16:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-11-06 22:16:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 396 transitions. [2019-11-06 22:16:30,925 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 396 transitions. Word has length 141 [2019-11-06 22:16:30,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:30,925 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 396 transitions. [2019-11-06 22:16:30,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:30,926 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 396 transitions. [2019-11-06 22:16:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-06 22:16:30,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:30,929 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:30,929 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:30,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:30,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1060309692, now seen corresponding path program 1 times [2019-11-06 22:16:30,929 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:30,929 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455036874] [2019-11-06 22:16:30,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-11-06 22:16:31,137 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455036874] [2019-11-06 22:16:31,138 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:31,138 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:16:31,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889904007] [2019-11-06 22:16:31,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:16:31,139 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:31,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:16:31,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:16:31,139 INFO L87 Difference]: Start difference. First operand 292 states and 396 transitions. Second operand 5 states. [2019-11-06 22:16:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:32,453 INFO L93 Difference]: Finished difference Result 468 states and 648 transitions. [2019-11-06 22:16:32,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:32,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-11-06 22:16:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:32,457 INFO L225 Difference]: With dead ends: 468 [2019-11-06 22:16:32,457 INFO L226 Difference]: Without dead ends: 284 [2019-11-06 22:16:32,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-06 22:16:32,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 280. [2019-11-06 22:16:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-06 22:16:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 377 transitions. [2019-11-06 22:16:32,480 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 377 transitions. Word has length 143 [2019-11-06 22:16:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:32,480 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 377 transitions. [2019-11-06 22:16:32,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:16:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 377 transitions. [2019-11-06 22:16:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-06 22:16:32,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:32,482 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:32,483 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:32,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:32,483 INFO L82 PathProgramCache]: Analyzing trace with hash 158839533, now seen corresponding path program 1 times [2019-11-06 22:16:32,483 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:32,483 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199312302] [2019-11-06 22:16:32,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-06 22:16:32,704 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199312302] [2019-11-06 22:16:32,704 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938017962] [2019-11-06 22:16:32,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:32,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 22:16:32,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:16:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 74 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-06 22:16:32,911 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:16:32,911 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-11-06 22:16:32,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190034678] [2019-11-06 22:16:32,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:16:32,913 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:32,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:16:32,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:16:32,913 INFO L87 Difference]: Start difference. First operand 280 states and 377 transitions. Second operand 6 states. [2019-11-06 22:16:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:34,197 INFO L93 Difference]: Finished difference Result 585 states and 795 transitions. [2019-11-06 22:16:34,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:34,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-11-06 22:16:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:34,200 INFO L225 Difference]: With dead ends: 585 [2019-11-06 22:16:34,201 INFO L226 Difference]: Without dead ends: 328 [2019-11-06 22:16:34,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:16:34,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-06 22:16:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 318. [2019-11-06 22:16:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-06 22:16:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 424 transitions. [2019-11-06 22:16:34,228 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 424 transitions. Word has length 144 [2019-11-06 22:16:34,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:34,228 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 424 transitions. [2019-11-06 22:16:34,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:16:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 424 transitions. [2019-11-06 22:16:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-06 22:16:34,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:34,231 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:34,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:34,436 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:34,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:34,436 INFO L82 PathProgramCache]: Analyzing trace with hash 978746992, now seen corresponding path program 2 times [2019-11-06 22:16:34,436 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:34,436 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597310930] [2019-11-06 22:16:34,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2019-11-06 22:16:34,778 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597310930] [2019-11-06 22:16:34,778 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:34,779 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:16:34,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405576961] [2019-11-06 22:16:34,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:16:34,780 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:34,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:16:34,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:16:34,780 INFO L87 Difference]: Start difference. First operand 318 states and 424 transitions. Second operand 6 states. [2019-11-06 22:16:35,342 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-06 22:16:35,470 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-06 22:16:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:36,261 INFO L93 Difference]: Finished difference Result 493 states and 675 transitions. [2019-11-06 22:16:36,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:16:36,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-11-06 22:16:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:36,264 INFO L225 Difference]: With dead ends: 493 [2019-11-06 22:16:36,265 INFO L226 Difference]: Without dead ends: 322 [2019-11-06 22:16:36,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:16:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-06 22:16:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 318. [2019-11-06 22:16:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-06 22:16:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 418 transitions. [2019-11-06 22:16:36,291 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 418 transitions. Word has length 183 [2019-11-06 22:16:36,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:36,292 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 418 transitions. [2019-11-06 22:16:36,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:16:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 418 transitions. [2019-11-06 22:16:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-06 22:16:36,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:36,295 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:36,295 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:36,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:36,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1851165220, now seen corresponding path program 2 times [2019-11-06 22:16:36,296 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:36,296 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333426127] [2019-11-06 22:16:36,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-11-06 22:16:36,552 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333426127] [2019-11-06 22:16:36,553 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918157861] [2019-11-06 22:16:36,553 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:36,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-06 22:16:36,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 22:16:36,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 22:16:36,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:16:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-11-06 22:16:36,764 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:16:36,764 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-06 22:16:36,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38343441] [2019-11-06 22:16:36,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:16:36,765 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:36,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:16:36,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:16:36,766 INFO L87 Difference]: Start difference. First operand 318 states and 418 transitions. Second operand 4 states. [2019-11-06 22:16:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:36,819 INFO L93 Difference]: Finished difference Result 488 states and 665 transitions. [2019-11-06 22:16:36,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:16:36,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-06 22:16:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:36,821 INFO L225 Difference]: With dead ends: 488 [2019-11-06 22:16:36,822 INFO L226 Difference]: Without dead ends: 324 [2019-11-06 22:16:36,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-06 22:16:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2019-11-06 22:16:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-06 22:16:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 421 transitions. [2019-11-06 22:16:36,849 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 421 transitions. Word has length 190 [2019-11-06 22:16:36,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:36,851 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 421 transitions. [2019-11-06 22:16:36,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:16:36,852 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 421 transitions. [2019-11-06 22:16:36,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-06 22:16:36,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:36,855 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:37,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:37,068 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:37,068 INFO L82 PathProgramCache]: Analyzing trace with hash -55995379, now seen corresponding path program 1 times [2019-11-06 22:16:37,068 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:37,068 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44042111] [2019-11-06 22:16:37,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 140 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-11-06 22:16:37,438 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44042111] [2019-11-06 22:16:37,439 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932949219] [2019-11-06 22:16:37,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:37,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 22:16:37,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:16:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-11-06 22:16:37,626 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:16:37,626 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 7 [2019-11-06 22:16:37,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041845518] [2019-11-06 22:16:37,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:16:37,627 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:37,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:16:37,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:16:37,628 INFO L87 Difference]: Start difference. First operand 322 states and 421 transitions. Second operand 7 states. [2019-11-06 22:16:37,870 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-06 22:16:39,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:39,523 INFO L93 Difference]: Finished difference Result 563 states and 758 transitions. [2019-11-06 22:16:39,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 22:16:39,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2019-11-06 22:16:39,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:39,527 INFO L225 Difference]: With dead ends: 563 [2019-11-06 22:16:39,527 INFO L226 Difference]: Without dead ends: 327 [2019-11-06 22:16:39,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:16:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-11-06 22:16:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 301. [2019-11-06 22:16:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-11-06 22:16:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 390 transitions. [2019-11-06 22:16:39,564 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 390 transitions. Word has length 202 [2019-11-06 22:16:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:39,565 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 390 transitions. [2019-11-06 22:16:39,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:16:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 390 transitions. [2019-11-06 22:16:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-06 22:16:39,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:39,571 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:39,785 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:39,786 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:39,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1204328224, now seen corresponding path program 1 times [2019-11-06 22:16:39,787 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:39,787 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055514480] [2019-11-06 22:16:39,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,001 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-06 22:16:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-11-06 22:16:40,258 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055514480] [2019-11-06 22:16:40,258 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301165075] [2019-11-06 22:16:40,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:40,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 22:16:40,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:16:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-11-06 22:16:40,602 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:16:40,602 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2019-11-06 22:16:40,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776345842] [2019-11-06 22:16:40,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:16:40,604 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:40,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:16:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:16:40,604 INFO L87 Difference]: Start difference. First operand 301 states and 390 transitions. Second operand 4 states. [2019-11-06 22:16:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:40,675 INFO L93 Difference]: Finished difference Result 476 states and 641 transitions. [2019-11-06 22:16:40,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:16:40,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-11-06 22:16:40,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:40,679 INFO L225 Difference]: With dead ends: 476 [2019-11-06 22:16:40,679 INFO L226 Difference]: Without dead ends: 308 [2019-11-06 22:16:40,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-06 22:16:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2019-11-06 22:16:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-11-06 22:16:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 394 transitions. [2019-11-06 22:16:40,716 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 394 transitions. Word has length 226 [2019-11-06 22:16:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:40,716 INFO L462 AbstractCegarLoop]: Abstraction has 306 states and 394 transitions. [2019-11-06 22:16:40,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:16:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 394 transitions. [2019-11-06 22:16:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-06 22:16:40,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:40,723 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:40,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:40,930 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:40,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:40,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1446004142, now seen corresponding path program 1 times [2019-11-06 22:16:40,931 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:40,931 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354257928] [2019-11-06 22:16:40,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,170 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-06 22:16:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-11-06 22:16:41,498 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354257928] [2019-11-06 22:16:41,499 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190369096] [2019-11-06 22:16:41,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:41,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 22:16:41,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:16:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-11-06 22:16:41,855 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:16:41,856 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2019-11-06 22:16:41,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295882863] [2019-11-06 22:16:41,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:16:41,857 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:41,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:16:41,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:16:41,858 INFO L87 Difference]: Start difference. First operand 306 states and 394 transitions. Second operand 4 states. [2019-11-06 22:16:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:41,929 INFO L93 Difference]: Finished difference Result 478 states and 639 transitions. [2019-11-06 22:16:41,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:16:41,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-11-06 22:16:41,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:41,933 INFO L225 Difference]: With dead ends: 478 [2019-11-06 22:16:41,933 INFO L226 Difference]: Without dead ends: 305 [2019-11-06 22:16:41,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:16:41,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-06 22:16:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-11-06 22:16:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-06 22:16:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 389 transitions. [2019-11-06 22:16:41,972 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 389 transitions. Word has length 239 [2019-11-06 22:16:41,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:41,973 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 389 transitions. [2019-11-06 22:16:41,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:16:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 389 transitions. [2019-11-06 22:16:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-06 22:16:41,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:41,979 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:42,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:16:42,194 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:42,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:42,194 INFO L82 PathProgramCache]: Analyzing trace with hash -949228423, now seen corresponding path program 1 times [2019-11-06 22:16:42,194 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:42,195 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064159252] [2019-11-06 22:16:42,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat