/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_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:15:53,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:15:53,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:15:53,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:15:53,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:15:53,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:15:53,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:15:53,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:15:53,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:15:53,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:15:53,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:15:53,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:15:53,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:15:53,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:15:53,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:15:53,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:15:53,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:15:53,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:15:53,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:15:53,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:15:53,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:15:53,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:15:53,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:15:53,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:15:53,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:15:53,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:15:53,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:15:53,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:15:53,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:15:53,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:15:53,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:15:53,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:15:53,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:15:53,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:15:53,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:15:53,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:15:53,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:15:53,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:15:53,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:15:53,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:15:53,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:15:53,347 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:15:53,367 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:15:53,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:15:53,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:15:53,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:15:53,369 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:15:53,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:15:53,370 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:15:53,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:15:53,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:15:53,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:15:53,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:15:53,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:15:53,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:15:53,372 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:15:53,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:15:53,372 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:15:53,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:15:53,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:15:53,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:15:53,373 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:15:53,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:15:53,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:15:53,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:15:53,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:15:53,374 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:15:53,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:15:53,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:15:53,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:15:53,375 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:15:53,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:15:53,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:15:53,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:15:53,680 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:15:53,680 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:15:53,681 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-11-06 22:15:53,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/683c0d640/40dac62d5cba4477a2a49ed4373c5745/FLAGf7d766c8e [2019-11-06 22:15:54,251 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:15:54,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-11-06 22:15:54,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/683c0d640/40dac62d5cba4477a2a49ed4373c5745/FLAGf7d766c8e [2019-11-06 22:15:54,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/683c0d640/40dac62d5cba4477a2a49ed4373c5745 [2019-11-06 22:15:54,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:15:54,577 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:15:54,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:15:54,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:15:54,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:15:54,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:54" (1/1) ... [2019-11-06 22:15:54,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d6f478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:54, skipping insertion in model container [2019-11-06 22:15:54,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:54" (1/1) ... [2019-11-06 22:15:54,596 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:15:54,653 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:15:55,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:15:55,039 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:15:55,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:15:55,153 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:15:55,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:55 WrapperNode [2019-11-06 22:15:55,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:15:55,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:15:55,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:15:55,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:15:55,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:55" (1/1) ... [2019-11-06 22:15:55,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:55" (1/1) ... [2019-11-06 22:15:55,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:55" (1/1) ... [2019-11-06 22:15:55,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:55" (1/1) ... [2019-11-06 22:15:55,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:55" (1/1) ... [2019-11-06 22:15:55,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:55" (1/1) ... [2019-11-06 22:15:55,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:55" (1/1) ... [2019-11-06 22:15:55,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:15:55,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:15:55,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:15:55,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:15:55,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:15:55,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:15:55,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:15:55,290 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-11-06 22:15:55,290 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-11-06 22:15:55,290 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-11-06 22:15:55,290 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-11-06 22:15:55,290 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-11-06 22:15:55,290 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-11-06 22:15:55,291 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-11-06 22:15:55,291 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-11-06 22:15:55,291 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-11-06 22:15:55,291 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-11-06 22:15:55,291 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-11-06 22:15:55,292 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-11-06 22:15:55,292 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-11-06 22:15:55,292 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-11-06 22:15:55,292 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-06 22:15:55,292 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:15:55,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-11-06 22:15:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:15:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:15:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 22:15:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-06 22:15:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-06 22:15:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-06 22:15:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:15:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-11-06 22:15:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-11-06 22:15:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-11-06 22:15:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-11-06 22:15:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-11-06 22:15:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-11-06 22:15:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-11-06 22:15:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-11-06 22:15:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 22:15:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-11-06 22:15:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-11-06 22:15:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-11-06 22:15:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-11-06 22:15:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-11-06 22:15:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 22:15:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:15:55,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:15:55,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:15:56,198 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:15:56,198 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:15:56,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:56 BoogieIcfgContainer [2019-11-06 22:15:56,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:15:56,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:15:56,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:15:56,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:15:56,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:15:54" (1/3) ... [2019-11-06 22:15:56,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243ff33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:56, skipping insertion in model container [2019-11-06 22:15:56,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:55" (2/3) ... [2019-11-06 22:15:56,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243ff33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:56, skipping insertion in model container [2019-11-06 22:15:56,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:56" (3/3) ... [2019-11-06 22:15:56,208 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2019-11-06 22:15:56,218 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:15:56,227 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:15:56,238 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:15:56,266 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:15:56,267 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:15:56,267 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:15:56,267 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:15:56,268 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:15:56,268 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:15:56,268 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:15:56,268 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:15:56,294 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-11-06 22:15:56,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-06 22:15:56,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:56,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:56,308 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:56,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:56,314 INFO L82 PathProgramCache]: Analyzing trace with hash -95402615, now seen corresponding path program 1 times [2019-11-06 22:15:56,322 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:56,322 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304547170] [2019-11-06 22:15:56,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:56,903 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:15:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:15:57,236 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304547170] [2019-11-06 22:15:57,236 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:57,237 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 22:15:57,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791888592] [2019-11-06 22:15:57,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 22:15:57,244 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:57,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 22:15:57,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-06 22:15:57,261 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 11 states. [2019-11-06 22:15:57,518 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-06 22:15:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:15:59,861 INFO L93 Difference]: Finished difference Result 448 states and 692 transitions. [2019-11-06 22:15:59,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 22:15:59,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-11-06 22:15:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:15:59,877 INFO L225 Difference]: With dead ends: 448 [2019-11-06 22:15:59,877 INFO L226 Difference]: Without dead ends: 231 [2019-11-06 22:15:59,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-06 22:15:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-06 22:15:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-11-06 22:15:59,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-06 22:15:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 323 transitions. [2019-11-06 22:15:59,970 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 323 transitions. Word has length 65 [2019-11-06 22:15:59,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:15:59,970 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 323 transitions. [2019-11-06 22:15:59,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 22:15:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions. [2019-11-06 22:15:59,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-06 22:15:59,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:59,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:15:59,975 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:59,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:59,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1971874243, now seen corresponding path program 1 times [2019-11-06 22:15:59,976 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:59,976 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460183535] [2019-11-06 22:15:59,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,314 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,539 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:00,540 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460183535] [2019-11-06 22:16:00,540 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:00,541 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 22:16:00,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886310184] [2019-11-06 22:16:00,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 22:16:00,547 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:00,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 22:16:00,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-06 22:16:00,557 INFO L87 Difference]: Start difference. First operand 231 states and 323 transitions. Second operand 11 states. [2019-11-06 22:16:01,655 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-11-06 22:16:01,793 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-06 22:16:02,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:02,953 INFO L93 Difference]: Finished difference Result 444 states and 634 transitions. [2019-11-06 22:16:02,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 22:16:02,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2019-11-06 22:16:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:02,960 INFO L225 Difference]: With dead ends: 444 [2019-11-06 22:16:02,960 INFO L226 Difference]: Without dead ends: 235 [2019-11-06 22:16:02,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:16:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-06 22:16:03,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-11-06 22:16:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-06 22:16:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 326 transitions. [2019-11-06 22:16:03,002 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 326 transitions. Word has length 76 [2019-11-06 22:16:03,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:03,003 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 326 transitions. [2019-11-06 22:16:03,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 22:16:03,003 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 326 transitions. [2019-11-06 22:16:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-06 22:16:03,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:03,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:16:03,007 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:03,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:03,008 INFO L82 PathProgramCache]: Analyzing trace with hash 350215030, now seen corresponding path program 1 times [2019-11-06 22:16:03,008 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:03,008 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721143210] [2019-11-06 22:16:03,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,259 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,560 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:03,560 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721143210] [2019-11-06 22:16:03,560 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:03,561 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-06 22:16:03,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164792710] [2019-11-06 22:16:03,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 22:16:03,562 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:03,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 22:16:03,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-06 22:16:03,562 INFO L87 Difference]: Start difference. First operand 235 states and 326 transitions. Second operand 16 states. [2019-11-06 22:16:03,780 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-06 22:16:05,065 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-06 22:16:05,198 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-06 22:16:05,745 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-06 22:16:07,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:07,899 INFO L93 Difference]: Finished difference Result 535 states and 744 transitions. [2019-11-06 22:16:07,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-06 22:16:07,900 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2019-11-06 22:16:07,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:07,906 INFO L225 Difference]: With dead ends: 535 [2019-11-06 22:16:07,906 INFO L226 Difference]: Without dead ends: 322 [2019-11-06 22:16:07,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2019-11-06 22:16:07,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-06 22:16:07,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-11-06 22:16:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-11-06 22:16:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 438 transitions. [2019-11-06 22:16:07,956 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 438 transitions. Word has length 94 [2019-11-06 22:16:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:07,957 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 438 transitions. [2019-11-06 22:16:07,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 22:16:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 438 transitions. [2019-11-06 22:16:07,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-06 22:16:07,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:07,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:16:07,960 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:07,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:07,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1125111825, now seen corresponding path program 1 times [2019-11-06 22:16:07,961 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:07,961 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372845253] [2019-11-06 22:16:07,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,249 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:16:08,547 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372845253] [2019-11-06 22:16:08,548 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:08,548 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-06 22:16:08,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926873514] [2019-11-06 22:16:08,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 22:16:08,549 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:08,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 22:16:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-06 22:16:08,551 INFO L87 Difference]: Start difference. First operand 321 states and 438 transitions. Second operand 16 states. [2019-11-06 22:16:08,717 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-06 22:16:10,664 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-06 22:16:12,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:12,708 INFO L93 Difference]: Finished difference Result 541 states and 752 transitions. [2019-11-06 22:16:12,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-06 22:16:12,709 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 95 [2019-11-06 22:16:12,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:12,713 INFO L225 Difference]: With dead ends: 541 [2019-11-06 22:16:12,713 INFO L226 Difference]: Without dead ends: 325 [2019-11-06 22:16:12,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2019-11-06 22:16:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-06 22:16:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 321. [2019-11-06 22:16:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-11-06 22:16:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 438 transitions. [2019-11-06 22:16:12,753 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 438 transitions. Word has length 95 [2019-11-06 22:16:12,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:12,753 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 438 transitions. [2019-11-06 22:16:12,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 22:16:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 438 transitions. [2019-11-06 22:16:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-06 22:16:12,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:12,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:16:12,756 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1068609311, now seen corresponding path program 1 times [2019-11-06 22:16:12,757 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:12,757 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677396804] [2019-11-06 22:16:12,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:12,968 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,239 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:13,240 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677396804] [2019-11-06 22:16:13,240 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:13,240 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-06 22:16:13,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540993620] [2019-11-06 22:16:13,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 22:16:13,241 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:13,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 22:16:13,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:16:13,242 INFO L87 Difference]: Start difference. First operand 321 states and 438 transitions. Second operand 12 states. [2019-11-06 22:16:14,055 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-06 22:16:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:17,015 INFO L93 Difference]: Finished difference Result 770 states and 1075 transitions. [2019-11-06 22:16:17,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-06 22:16:17,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-11-06 22:16:17,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:17,022 INFO L225 Difference]: With dead ends: 770 [2019-11-06 22:16:17,022 INFO L226 Difference]: Without dead ends: 554 [2019-11-06 22:16:17,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2019-11-06 22:16:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-11-06 22:16:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 537. [2019-11-06 22:16:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-11-06 22:16:17,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 745 transitions. [2019-11-06 22:16:17,126 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 745 transitions. Word has length 97 [2019-11-06 22:16:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:17,127 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 745 transitions. [2019-11-06 22:16:17,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 22:16:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 745 transitions. [2019-11-06 22:16:17,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-06 22:16:17,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,131 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:17,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:17,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2002189277, now seen corresponding path program 1 times [2019-11-06 22:16:17,132 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:17,132 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101459544] [2019-11-06 22:16:17,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,395 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,622 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:17,622 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101459544] [2019-11-06 22:16:17,623 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:17,623 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-06 22:16:17,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438319439] [2019-11-06 22:16:17,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 22:16:17,625 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:17,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 22:16:17,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:16:17,626 INFO L87 Difference]: Start difference. First operand 537 states and 745 transitions. Second operand 12 states. [2019-11-06 22:16:19,003 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-11-06 22:16:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:19,876 INFO L93 Difference]: Finished difference Result 927 states and 1308 transitions. [2019-11-06 22:16:19,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 22:16:19,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-11-06 22:16:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:19,880 INFO L225 Difference]: With dead ends: 927 [2019-11-06 22:16:19,880 INFO L226 Difference]: Without dead ends: 537 [2019-11-06 22:16:19,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-11-06 22:16:19,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-11-06 22:16:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2019-11-06 22:16:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-11-06 22:16:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 744 transitions. [2019-11-06 22:16:19,949 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 744 transitions. Word has length 98 [2019-11-06 22:16:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:19,949 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 744 transitions. [2019-11-06 22:16:19,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 22:16:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 744 transitions. [2019-11-06 22:16:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-06 22:16:19,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:19,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:16:19,952 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:19,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1591713441, now seen corresponding path program 1 times [2019-11-06 22:16:19,953 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:19,953 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733864206] [2019-11-06 22:16:19,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,149 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,381 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:20,381 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733864206] [2019-11-06 22:16:20,381 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:20,381 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-06 22:16:20,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978772943] [2019-11-06 22:16:20,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 22:16:20,383 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:20,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 22:16:20,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:16:20,384 INFO L87 Difference]: Start difference. First operand 537 states and 744 transitions. Second operand 12 states. [2019-11-06 22:16:21,558 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-06 22:16:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:24,118 INFO L93 Difference]: Finished difference Result 1168 states and 1640 transitions. [2019-11-06 22:16:24,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-06 22:16:24,119 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-11-06 22:16:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:24,125 INFO L225 Difference]: With dead ends: 1168 [2019-11-06 22:16:24,125 INFO L226 Difference]: Without dead ends: 728 [2019-11-06 22:16:24,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2019-11-06 22:16:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-11-06 22:16:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 722. [2019-11-06 22:16:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-11-06 22:16:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1008 transitions. [2019-11-06 22:16:24,199 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1008 transitions. Word has length 98 [2019-11-06 22:16:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:24,199 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1008 transitions. [2019-11-06 22:16:24,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 22:16:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1008 transitions. [2019-11-06 22:16:24,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-06 22:16:24,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:24,201 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:16:24,202 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:24,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:24,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1901314178, now seen corresponding path program 1 times [2019-11-06 22:16:24,202 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:24,202 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158184957] [2019-11-06 22:16:24,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,402 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,577 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,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,615 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:24,615 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158184957] [2019-11-06 22:16:24,616 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:24,616 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 22:16:24,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082829491] [2019-11-06 22:16:24,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 22:16:24,617 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:24,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:16:24,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-06 22:16:24,618 INFO L87 Difference]: Start difference. First operand 722 states and 1008 transitions. Second operand 13 states. [2019-11-06 22:16:26,186 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-11-06 22:16:26,342 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-06 22:16:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:27,352 INFO L93 Difference]: Finished difference Result 1308 states and 1853 transitions. [2019-11-06 22:16:27,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:16:27,354 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2019-11-06 22:16:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:27,359 INFO L225 Difference]: With dead ends: 1308 [2019-11-06 22:16:27,359 INFO L226 Difference]: Without dead ends: 737 [2019-11-06 22:16:27,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2019-11-06 22:16:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-11-06 22:16:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2019-11-06 22:16:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-06 22:16:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1020 transitions. [2019-11-06 22:16:27,438 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1020 transitions. Word has length 98 [2019-11-06 22:16:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:27,439 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1020 transitions. [2019-11-06 22:16:27,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 22:16:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1020 transitions. [2019-11-06 22:16:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:16:27,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:27,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:16:27,442 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:27,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:27,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1229557918, now seen corresponding path program 1 times [2019-11-06 22:16:27,442 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:27,443 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881035779] [2019-11-06 22:16:27,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,631 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,879 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:27,880 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881035779] [2019-11-06 22:16:27,880 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:27,880 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 22:16:27,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638567016] [2019-11-06 22:16:27,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 22:16:27,881 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:27,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:16:27,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-06 22:16:27,882 INFO L87 Difference]: Start difference. First operand 737 states and 1020 transitions. Second operand 13 states. [2019-11-06 22:16:29,573 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-11-06 22:16:29,737 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-06 22:16:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:30,632 INFO L93 Difference]: Finished difference Result 1338 states and 1886 transitions. [2019-11-06 22:16:30,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:16:30,632 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 106 [2019-11-06 22:16:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:30,639 INFO L225 Difference]: With dead ends: 1338 [2019-11-06 22:16:30,639 INFO L226 Difference]: Without dead ends: 752 [2019-11-06 22:16:30,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2019-11-06 22:16:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-11-06 22:16:30,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2019-11-06 22:16:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-11-06 22:16:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1032 transitions. [2019-11-06 22:16:30,712 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1032 transitions. Word has length 106 [2019-11-06 22:16:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:30,712 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 1032 transitions. [2019-11-06 22:16:30,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 22:16:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1032 transitions. [2019-11-06 22:16:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-06 22:16:30,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:30,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,715 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:30,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:30,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1709526252, now seen corresponding path program 1 times [2019-11-06 22:16:30,716 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:30,716 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477596835] [2019-11-06 22:16:30,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,920 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:31,135 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:31,136 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477596835] [2019-11-06 22:16:31,136 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:31,136 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 22:16:31,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752608402] [2019-11-06 22:16:31,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 22:16:31,137 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:31,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:16:31,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-06 22:16:31,138 INFO L87 Difference]: Start difference. First operand 752 states and 1032 transitions. Second operand 13 states. [2019-11-06 22:16:32,736 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 133