/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.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:15:53,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:15:53,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:15:53,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:15:53,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:15:53,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:15:53,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:15:53,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:15:53,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:15:53,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:15:53,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:15:53,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:15:53,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:15:53,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:15:53,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:15:53,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:15:53,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:15:53,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:15:53,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:15:53,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:15:53,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:15:53,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:15:53,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:15:53,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:15:53,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:15:53,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:15:53,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:15:53,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:15:53,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:15:53,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:15:53,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:15:53,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:15:53,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:15:53,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:15:53,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:15:53,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:15:53,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:15:53,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:15:53,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:15:53,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:15:53,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:15:53,241 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,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:15:53,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:15:53,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:15:53,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:15:53,265 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:15:53,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:15:53,265 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:15:53,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:15:53,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:15:53,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:15:53,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:15:53,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:15:53,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:15:53,267 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:15:53,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:15:53,267 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:15:53,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:15:53,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:15:53,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:15:53,268 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:15:53,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:15:53,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:15:53,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:15:53,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:15:53,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:15:53,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:15:53,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:15:53,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:15:53,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:15:53,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:15:53,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:15:53,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:15:53,575 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:15:53,575 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:15:53,576 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.BOUNDED-10.pals.c [2019-11-06 22:15:53,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57194d05/d7cd256561c24a418682407b670b5cff/FLAGd87f2450a [2019-11-06 22:15:54,146 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:15:54,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-11-06 22:15:54,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57194d05/d7cd256561c24a418682407b670b5cff/FLAGd87f2450a [2019-11-06 22:15:54,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57194d05/d7cd256561c24a418682407b670b5cff [2019-11-06 22:15:54,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:15:54,528 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:15:54,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:15:54,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:15:54,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:15:54,533 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,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199fd355 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,537 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,544 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:15:54,596 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:15:54,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:15:54,996 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:15:55,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:15:55,094 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:15:55,095 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,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:15:55,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:15:55,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:15:55,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:15:55,110 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,111 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,125 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,125 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,146 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,167 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,175 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,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:15:55,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:15:55,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:15:55,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:15:55,185 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,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:15:55,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:15:55,236 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-11-06 22:15:55,236 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-11-06 22:15:55,236 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-11-06 22:15:55,236 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-11-06 22:15:55,236 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-11-06 22:15:55,237 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-11-06 22:15:55,237 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-11-06 22:15:55,237 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-11-06 22:15:55,237 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-11-06 22:15:55,237 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-11-06 22:15:55,237 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-11-06 22:15:55,238 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-11-06 22:15:55,238 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-11-06 22:15:55,238 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-11-06 22:15:55,238 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-06 22:15:55,238 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:15:55,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-11-06 22:15:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:15:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:15:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-06 22:15:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-06 22:15:55,239 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-06 22:15:55,240 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-06 22:15:55,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:15:55,240 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-11-06 22:15:55,240 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-11-06 22:15:55,240 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-11-06 22:15:55,240 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-11-06 22:15:55,240 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-11-06 22:15:55,241 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-11-06 22:15:55,241 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-11-06 22:15:55,241 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-11-06 22:15:55,241 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-06 22:15:55,241 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-11-06 22:15:55,241 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-11-06 22:15:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-11-06 22:15:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-11-06 22:15:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-11-06 22:15:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 22:15:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:15:55,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:15:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:15:56,192 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:15:56,192 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:15:56,194 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,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:15:56,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:15:56,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:15:56,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:15:56,199 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,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fec2568 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,200 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,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fec2568 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,201 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,203 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-11-06 22:15:56,213 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:15:56,222 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:15:56,234 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:15:56,260 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:15:56,260 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:15:56,260 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:15:56,260 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:15:56,261 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:15:56,261 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:15:56,261 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:15:56,261 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:15:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2019-11-06 22:15:56,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-06 22:15:56,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:15:56,295 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,297 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:15:56,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:15:56,304 INFO L82 PathProgramCache]: Analyzing trace with hash -512765460, now seen corresponding path program 1 times [2019-11-06 22:15:56,313 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:15:56,314 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829933191] [2019-11-06 22:15:56,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:15:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:56,871 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:15:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:15:57,243 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,244 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829933191] [2019-11-06 22:15:57,245 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:15:57,245 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 22:15:57,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112362204] [2019-11-06 22:15:57,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 22:15:57,252 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:15:57,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 22:15:57,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-06 22:15:57,269 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 11 states. [2019-11-06 22:15:57,539 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-06 22:16:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:00,011 INFO L93 Difference]: Finished difference Result 455 states and 698 transitions. [2019-11-06 22:16:00,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 22:16:00,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-11-06 22:16:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:00,028 INFO L225 Difference]: With dead ends: 455 [2019-11-06 22:16:00,028 INFO L226 Difference]: Without dead ends: 232 [2019-11-06 22:16:00,036 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:16:00,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-06 22:16:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-11-06 22:16:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-06 22:16:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 324 transitions. [2019-11-06 22:16:00,142 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 324 transitions. Word has length 65 [2019-11-06 22:16:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:00,143 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 324 transitions. [2019-11-06 22:16:00,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 22:16:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 324 transitions. [2019-11-06 22:16:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-06 22:16:00,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:00,153 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:16:00,153 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:00,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1221172995, now seen corresponding path program 1 times [2019-11-06 22:16:00,155 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:00,155 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397918295] [2019-11-06 22:16:00,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,494 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:00,695 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,696 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397918295] [2019-11-06 22:16:00,696 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:00,696 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-06 22:16:00,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343457209] [2019-11-06 22:16:00,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 22:16:00,699 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:00,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 22:16:00,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-06 22:16:00,699 INFO L87 Difference]: Start difference. First operand 232 states and 324 transitions. Second operand 11 states. [2019-11-06 22:16:01,765 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-11-06 22:16:01,901 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-06 22:16:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:03,177 INFO L93 Difference]: Finished difference Result 446 states and 636 transitions. [2019-11-06 22:16:03,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 22:16:03,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2019-11-06 22:16:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:03,183 INFO L225 Difference]: With dead ends: 446 [2019-11-06 22:16:03,184 INFO L226 Difference]: Without dead ends: 236 [2019-11-06 22:16:03,186 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:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-06 22:16:03,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-11-06 22:16:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-06 22:16:03,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 327 transitions. [2019-11-06 22:16:03,221 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 327 transitions. Word has length 76 [2019-11-06 22:16:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:03,222 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 327 transitions. [2019-11-06 22:16:03,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 22:16:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 327 transitions. [2019-11-06 22:16:03,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-06 22:16:03,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:03,224 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,224 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:03,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2093661207, now seen corresponding path program 1 times [2019-11-06 22:16:03,225 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:03,225 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014209650] [2019-11-06 22:16:03,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,456 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:03,751 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,751 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014209650] [2019-11-06 22:16:03,752 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:03,752 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-06 22:16:03,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15647650] [2019-11-06 22:16:03,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 22:16:03,753 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:03,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 22:16:03,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-06 22:16:03,754 INFO L87 Difference]: Start difference. First operand 236 states and 327 transitions. Second operand 16 states. [2019-11-06 22:16:03,966 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-06 22:16:05,369 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-06 22:16:06,084 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-06 22:16:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:08,124 INFO L93 Difference]: Finished difference Result 537 states and 746 transitions. [2019-11-06 22:16:08,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-06 22:16:08,125 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2019-11-06 22:16:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:08,130 INFO L225 Difference]: With dead ends: 537 [2019-11-06 22:16:08,130 INFO L226 Difference]: Without dead ends: 323 [2019-11-06 22:16:08,132 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:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-06 22:16:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2019-11-06 22:16:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-06 22:16:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 439 transitions. [2019-11-06 22:16:08,182 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 439 transitions. Word has length 94 [2019-11-06 22:16:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:08,183 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 439 transitions. [2019-11-06 22:16:08,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 22:16:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 439 transitions. [2019-11-06 22:16:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-06 22:16:08,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:08,185 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:08,186 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:08,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:08,186 INFO L82 PathProgramCache]: Analyzing trace with hash 130349043, now seen corresponding path program 1 times [2019-11-06 22:16:08,186 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:08,187 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883570920] [2019-11-06 22:16:08,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,428 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:08,733 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,734 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883570920] [2019-11-06 22:16:08,734 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:08,734 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-06 22:16:08,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156050934] [2019-11-06 22:16:08,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 22:16:08,735 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:08,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 22:16:08,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-06 22:16:08,736 INFO L87 Difference]: Start difference. First operand 322 states and 439 transitions. Second operand 16 states. [2019-11-06 22:16:08,941 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-06 22:16:10,949 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-06 22:16:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:13,032 INFO L93 Difference]: Finished difference Result 543 states and 754 transitions. [2019-11-06 22:16:13,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-06 22:16:13,033 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 95 [2019-11-06 22:16:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:13,037 INFO L225 Difference]: With dead ends: 543 [2019-11-06 22:16:13,037 INFO L226 Difference]: Without dead ends: 326 [2019-11-06 22:16:13,039 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:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-06 22:16:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 322. [2019-11-06 22:16:13,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-06 22:16:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 439 transitions. [2019-11-06 22:16:13,075 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 439 transitions. Word has length 95 [2019-11-06 22:16:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:13,075 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 439 transitions. [2019-11-06 22:16:13,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 22:16:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 439 transitions. [2019-11-06 22:16:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-06 22:16:13,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:13,077 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:13,078 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:13,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:13,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1810109727, now seen corresponding path program 1 times [2019-11-06 22:16:13,078 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:13,079 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993152428] [2019-11-06 22:16:13,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,292 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:13,556 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,557 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993152428] [2019-11-06 22:16:13,558 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:13,558 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-06 22:16:13,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771982243] [2019-11-06 22:16:13,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 22:16:13,559 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:13,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 22:16:13,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:16:13,560 INFO L87 Difference]: Start difference. First operand 322 states and 439 transitions. Second operand 12 states. [2019-11-06 22:16:14,305 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-06 22:16:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:17,196 INFO L93 Difference]: Finished difference Result 773 states and 1078 transitions. [2019-11-06 22:16:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-06 22:16:17,197 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-11-06 22:16:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:17,203 INFO L225 Difference]: With dead ends: 773 [2019-11-06 22:16:17,203 INFO L226 Difference]: Without dead ends: 556 [2019-11-06 22:16:17,204 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,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-11-06 22:16:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 538. [2019-11-06 22:16:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-06 22:16:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 746 transitions. [2019-11-06 22:16:17,270 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 746 transitions. Word has length 97 [2019-11-06 22:16:17,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:17,270 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 746 transitions. [2019-11-06 22:16:17,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 22:16:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 746 transitions. [2019-11-06 22:16:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-06 22:16:17,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:17,272 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,273 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:17,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:17,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1438423074, now seen corresponding path program 1 times [2019-11-06 22:16:17,273 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:17,273 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015197671] [2019-11-06 22:16:17,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,470 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,539 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,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:17,693 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,694 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015197671] [2019-11-06 22:16:17,694 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:17,694 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-06 22:16:17,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512581022] [2019-11-06 22:16:17,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 22:16:17,695 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:17,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 22:16:17,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:16:17,696 INFO L87 Difference]: Start difference. First operand 538 states and 746 transitions. Second operand 12 states. [2019-11-06 22:16:19,049 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-11-06 22:16:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:19,917 INFO L93 Difference]: Finished difference Result 929 states and 1310 transitions. [2019-11-06 22:16:19,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 22:16:19,918 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-11-06 22:16:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:19,928 INFO L225 Difference]: With dead ends: 929 [2019-11-06 22:16:19,928 INFO L226 Difference]: Without dead ends: 538 [2019-11-06 22:16:19,930 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,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-06 22:16:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-06 22:16:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-06 22:16:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 745 transitions. [2019-11-06 22:16:20,009 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 745 transitions. Word has length 98 [2019-11-06 22:16:20,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:20,011 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 745 transitions. [2019-11-06 22:16:20,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 22:16:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 745 transitions. [2019-11-06 22:16:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-06 22:16:20,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:20,013 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:20,013 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:20,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash 737358496, now seen corresponding path program 1 times [2019-11-06 22:16:20,014 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:20,014 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85508551] [2019-11-06 22:16:20,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,203 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:20,424 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,424 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85508551] [2019-11-06 22:16:20,424 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:20,425 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-06 22:16:20,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603989324] [2019-11-06 22:16:20,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 22:16:20,426 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:20,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 22:16:20,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:16:20,426 INFO L87 Difference]: Start difference. First operand 538 states and 745 transitions. Second operand 12 states. [2019-11-06 22:16:21,468 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-06 22:16:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:23,948 INFO L93 Difference]: Finished difference Result 1171 states and 1643 transitions. [2019-11-06 22:16:23,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-06 22:16:23,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-11-06 22:16:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:23,956 INFO L225 Difference]: With dead ends: 1171 [2019-11-06 22:16:23,957 INFO L226 Difference]: Without dead ends: 730 [2019-11-06 22:16:23,960 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:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-11-06 22:16:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 724. [2019-11-06 22:16:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-11-06 22:16:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1010 transitions. [2019-11-06 22:16:24,047 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1010 transitions. Word has length 98 [2019-11-06 22:16:24,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:24,047 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1010 transitions. [2019-11-06 22:16:24,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 22:16:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1010 transitions. [2019-11-06 22:16:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-06 22:16:24,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:24,049 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,050 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:24,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash -638890142, now seen corresponding path program 1 times [2019-11-06 22:16:24,050 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:24,051 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538401854] [2019-11-06 22:16:24,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,291 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:24,504 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,505 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538401854] [2019-11-06 22:16:24,505 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:24,505 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 22:16:24,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679572041] [2019-11-06 22:16:24,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 22:16:24,506 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:24,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:16:24,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-06 22:16:24,507 INFO L87 Difference]: Start difference. First operand 724 states and 1010 transitions. Second operand 13 states. [2019-11-06 22:16:24,739 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-06 22:16:26,189 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-11-06 22:16:26,336 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-06 22:16:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:27,325 INFO L93 Difference]: Finished difference Result 1312 states and 1857 transitions. [2019-11-06 22:16:27,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:16:27,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2019-11-06 22:16:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:27,331 INFO L225 Difference]: With dead ends: 1312 [2019-11-06 22:16:27,331 INFO L226 Difference]: Without dead ends: 739 [2019-11-06 22:16:27,334 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,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-11-06 22:16:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2019-11-06 22:16:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-11-06 22:16:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1022 transitions. [2019-11-06 22:16:27,407 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1022 transitions. Word has length 98 [2019-11-06 22:16:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:27,408 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 1022 transitions. [2019-11-06 22:16:27,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 22:16:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1022 transitions. [2019-11-06 22:16:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:16:27,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:27,410 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,410 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:27,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:27,411 INFO L82 PathProgramCache]: Analyzing trace with hash -397676862, now seen corresponding path program 1 times [2019-11-06 22:16:27,411 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:27,411 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692712246] [2019-11-06 22:16:27,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,612 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,701 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,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:27,850 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,850 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692712246] [2019-11-06 22:16:27,850 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:27,851 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 22:16:27,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989522989] [2019-11-06 22:16:27,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 22:16:27,853 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:27,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:16:27,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-06 22:16:27,853 INFO L87 Difference]: Start difference. First operand 739 states and 1022 transitions. Second operand 13 states. [2019-11-06 22:16:29,303 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-11-06 22:16:29,502 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-06 22:16:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:16:30,395 INFO L93 Difference]: Finished difference Result 1342 states and 1890 transitions. [2019-11-06 22:16:30,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:16:30,396 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 106 [2019-11-06 22:16:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:16:30,402 INFO L225 Difference]: With dead ends: 1342 [2019-11-06 22:16:30,402 INFO L226 Difference]: Without dead ends: 754 [2019-11-06 22:16:30,405 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,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-11-06 22:16:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-11-06 22:16:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-11-06 22:16:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1034 transitions. [2019-11-06 22:16:30,473 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1034 transitions. Word has length 106 [2019-11-06 22:16:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:16:30,474 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1034 transitions. [2019-11-06 22:16:30,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 22:16:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1034 transitions. [2019-11-06 22:16:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-06 22:16:30,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:16:30,477 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,477 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:16:30,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:16:30,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1572879564, now seen corresponding path program 1 times [2019-11-06 22:16:30,477 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:16:30,478 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225488292] [2019-11-06 22:16:30,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:16:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,709 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-06 22:16:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:16:30,961 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:30,961 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225488292] [2019-11-06 22:16:30,962 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:16:30,962 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-06 22:16:30,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690403453] [2019-11-06 22:16:30,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 22:16:30,963 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:16:30,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:16:30,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-06 22:16:30,964 INFO L87 Difference]: Start difference. First operand 754 states and 1034 transitions. Second operand 13 states.