/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-McrStrategy.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 11:49:50,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 11:49:50,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 11:49:50,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 11:49:50,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 11:49:50,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 11:49:50,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 11:49:50,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 11:49:50,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 11:49:50,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 11:49:50,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 11:49:50,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 11:49:50,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 11:49:50,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 11:49:50,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 11:49:50,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 11:49:50,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 11:49:50,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 11:49:50,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 11:49:50,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 11:49:50,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 11:49:50,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 11:49:50,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 11:49:50,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 11:49:50,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 11:49:50,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 11:49:50,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 11:49:50,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 11:49:50,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 11:49:50,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 11:49:50,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 11:49:50,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 11:49:50,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 11:49:50,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 11:49:50,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 11:49:50,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 11:49:50,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 11:49:50,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 11:49:50,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 11:49:50,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 11:49:50,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 11:49:50,305 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-McrStrategy.epf [2020-04-18 11:49:50,323 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 11:49:50,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 11:49:50,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 11:49:50,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 11:49:50,326 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 11:49:50,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 11:49:50,326 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 11:49:50,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 11:49:50,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 11:49:50,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 11:49:50,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 11:49:50,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 11:49:50,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 11:49:50,328 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 11:49:50,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 11:49:50,329 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 11:49:50,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 11:49:50,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 11:49:50,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 11:49:50,330 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 11:49:50,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 11:49:50,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 11:49:50,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 11:49:50,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 11:49:50,331 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 11:49:50,331 INFO L138 SettingsManager]: * Trace refinement strategy=MCR [2020-04-18 11:49:50,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 11:49:50,331 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-04-18 11:49:50,331 INFO L138 SettingsManager]: * Trace refinement strategy used in MCR=CAMEL [2020-04-18 11:49:50,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 11:49:50,333 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 11:49:50,637 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 11:49:50,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 11:49:50,659 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 11:49:50,661 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 11:49:50,661 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 11:49:50,662 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2020-04-18 11:49:50,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686dd59a6/dc1b02cc69ff484ba9fb07399d935fd2/FLAG49f5be6bd [2020-04-18 11:49:51,265 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 11:49:51,266 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2020-04-18 11:49:51,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686dd59a6/dc1b02cc69ff484ba9fb07399d935fd2/FLAG49f5be6bd [2020-04-18 11:49:51,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686dd59a6/dc1b02cc69ff484ba9fb07399d935fd2 [2020-04-18 11:49:51,548 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 11:49:51,573 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 11:49:51,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 11:49:51,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 11:49:51,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 11:49:51,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 11:49:51" (1/1) ... [2020-04-18 11:49:51,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6441d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:49:51, skipping insertion in model container [2020-04-18 11:49:51,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 11:49:51" (1/1) ... [2020-04-18 11:49:51,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 11:49:51,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 11:49:52,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 11:49:52,307 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 11:49:52,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 11:49:52,576 INFO L208 MainTranslator]: Completed translation [2020-04-18 11:49:52,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:49:52 WrapperNode [2020-04-18 11:49:52,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 11:49:52,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 11:49:52,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 11:49:52,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 11:49:52,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:49:52" (1/1) ... [2020-04-18 11:49:52,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:49:52" (1/1) ... [2020-04-18 11:49:52,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 11:49:52,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 11:49:52,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 11:49:52,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 11:49:52,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:49:52" (1/1) ... [2020-04-18 11:49:52,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:49:52" (1/1) ... [2020-04-18 11:49:52,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:49:52" (1/1) ... [2020-04-18 11:49:52,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:49:52" (1/1) ... [2020-04-18 11:49:52,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:49:52" (1/1) ... [2020-04-18 11:49:52,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:49:52" (1/1) ... [2020-04-18 11:49:52,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:49:52" (1/1) ... [2020-04-18 11:49:52,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 11:49:52,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 11:49:52,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 11:49:52,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 11:49:52,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:49:52" (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 [2020-04-18 11:49:52,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 11:49:52,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 11:49:52,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-04-18 11:49:52,731 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-04-18 11:49:52,731 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-04-18 11:49:52,731 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-04-18 11:49:52,731 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-04-18 11:49:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-04-18 11:49:52,732 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-04-18 11:49:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-04-18 11:49:52,732 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-04-18 11:49:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 11:49:52,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-04-18 11:49:52,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 11:49:52,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 11:49:52,734 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-18 11:49:53,189 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 11:49:53,189 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-04-18 11:49:53,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 11:49:53 BoogieIcfgContainer [2020-04-18 11:49:53,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 11:49:53,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 11:49:53,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 11:49:53,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 11:49:53,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 11:49:51" (1/3) ... [2020-04-18 11:49:53,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b9b956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 11:49:53, skipping insertion in model container [2020-04-18 11:49:53,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:49:52" (2/3) ... [2020-04-18 11:49:53,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b9b956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 11:49:53, skipping insertion in model container [2020-04-18 11:49:53,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 11:49:53" (3/3) ... [2020-04-18 11:49:53,203 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-04-18 11:49:53,213 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 11:49:53,214 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 11:49:53,221 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-04-18 11:49:53,222 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 11:49:53,268 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,268 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,268 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,268 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,269 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,269 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,269 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,270 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,270 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,270 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,271 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,271 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,271 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,271 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,271 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,272 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,272 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,272 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,272 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,273 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,273 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,274 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,274 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,274 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,274 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,274 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,275 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,275 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,275 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,276 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,276 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,276 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,276 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,276 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,277 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,277 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,277 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,277 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,278 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,278 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,278 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,278 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,278 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,279 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,279 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,279 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,279 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,279 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,280 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,280 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,280 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,280 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,281 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,281 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,281 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,281 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,282 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,282 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,282 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,282 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,282 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,283 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,283 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,283 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,283 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,283 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,284 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,284 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,284 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,284 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,285 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,285 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,285 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,285 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,285 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,286 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,286 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,286 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,286 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,287 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,287 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,287 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,287 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,288 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,288 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,288 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,288 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,288 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,289 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,289 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,289 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,289 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,290 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,290 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,290 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,290 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,291 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,291 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,291 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,291 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,295 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,295 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,295 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,295 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,302 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,302 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,302 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,303 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,305 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,306 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,306 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,306 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,308 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,309 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,309 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,309 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,309 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,310 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,310 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,310 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,310 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,310 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,310 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,311 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,311 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,311 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,311 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,311 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,312 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,312 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,312 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,312 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,312 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,313 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,313 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,313 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,315 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,316 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,316 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,316 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,316 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,317 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,318 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,319 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,319 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,319 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,321 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,321 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,321 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,321 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,322 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,322 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,324 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,325 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,325 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,325 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,327 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,328 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,328 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,328 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,330 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,331 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,331 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,331 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,333 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,334 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,334 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,334 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:49:53,485 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-04-18 11:49:53,505 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 11:49:53,505 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 11:49:53,505 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 11:49:53,505 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 11:49:53,505 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 11:49:53,505 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 11:49:53,506 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 11:49:53,506 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 11:49:53,525 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions, 866 flow [2020-04-18 11:49:53,527 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-04-18 11:49:53,626 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-04-18 11:49:53,626 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-04-18 11:49:53,640 INFO L80 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2020-04-18 11:49:53,653 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-04-18 11:49:53,718 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-04-18 11:49:53,718 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-04-18 11:49:53,720 INFO L80 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2020-04-18 11:49:53,729 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4038 [2020-04-18 11:49:53,732 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 11:49:55,481 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-04-18 11:49:55,606 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-04-18 11:49:55,758 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2020-04-18 11:49:55,888 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2242 [2020-04-18 11:49:55,888 INFO L214 etLargeBlockEncoding]: Total number of compositions: 75 [2020-04-18 11:49:55,892 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 173 transitions, 726 flow [2020-04-18 11:49:56,419 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-04-18 11:49:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-04-18 11:49:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 11:49:56,430 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:49:56,431 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:49:56,432 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:49:56,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:49:56,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1069688068, now seen corresponding path program 1 times [2020-04-18 11:49:56,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:49:56,451 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [694390670] [2020-04-18 11:49:56,470 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:49:56,488 INFO L259 McrAutomatonBuilder]: Finished intersection with 13 states and 15 transitions. [2020-04-18 11:49:56,489 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-04-18 11:49:56,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 11:49:56,490 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:49:56,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:49:56,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1069688068, now seen corresponding path program 2 times [2020-04-18 11:49:56,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:49:56,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279755838] [2020-04-18 11:49:56,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:49:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:49:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:49:56,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279755838] [2020-04-18 11:49:56,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:49:56,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:49:56,860 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:49:56,862 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:49:56,869 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 13 transitions. [2020-04-18 11:49:56,869 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:49:56,909 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:49:56,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:49:56,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:49:56,916 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 7 states. [2020-04-18 11:49:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:49:57,025 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-04-18 11:49:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-04-18 11:49:57,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:49:57,026 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [694390670] [2020-04-18 11:49:57,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:49:57,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:49:57,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [694390670] [2020-04-18 11:49:57,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 11:49:57,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:49:57,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:49:57,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-04-18 11:49:57,036 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 7 states. [2020-04-18 11:49:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:49:57,408 INFO L93 Difference]: Finished difference Result 4746 states and 19878 transitions. [2020-04-18 11:49:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-04-18 11:49:57,410 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2020-04-18 11:49:57,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:49:57,478 INFO L225 Difference]: With dead ends: 4746 [2020-04-18 11:49:57,479 INFO L226 Difference]: Without dead ends: 4260 [2020-04-18 11:49:57,480 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-04-18 11:49:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2020-04-18 11:49:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 3008. [2020-04-18 11:49:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-04-18 11:49:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-04-18 11:49:57,782 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-04-18 11:49:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:49:57,782 INFO L479 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-04-18 11:49:57,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 11:49:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-04-18 11:49:57,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-04-18 11:49:57,784 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:49:57,784 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:49:57,784 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:49:57,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:49:57,785 INFO L82 PathProgramCache]: Analyzing trace with hash -690496787, now seen corresponding path program 1 times [2020-04-18 11:49:57,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:49:57,785 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1896796357] [2020-04-18 11:49:57,786 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:49:57,788 INFO L259 McrAutomatonBuilder]: Finished intersection with 29 states and 41 transitions. [2020-04-18 11:49:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-04-18 11:49:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-04-18 11:49:57,791 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:49:57,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:49:57,791 INFO L82 PathProgramCache]: Analyzing trace with hash -690496787, now seen corresponding path program 2 times [2020-04-18 11:49:57,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:49:57,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476005134] [2020-04-18 11:49:57,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:49:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:49:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:49:57,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476005134] [2020-04-18 11:49:57,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:49:57,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:49:57,885 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:49:57,888 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:49:57,890 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-04-18 11:49:57,891 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:49:57,894 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:49:57,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:49:57,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:49:57,895 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2020-04-18 11:49:57,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:49:57,905 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2020-04-18 11:49:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2020-04-18 11:49:57,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:49:57,906 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1896796357] [2020-04-18 11:49:57,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:49:57,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 11:49:57,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1896796357] [2020-04-18 11:49:57,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:49:57,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:49:57,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:49:57,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:49:57,908 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-04-18 11:49:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:49:58,012 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-04-18 11:49:58,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:49:58,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-04-18 11:49:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:49:58,042 INFO L225 Difference]: With dead ends: 4848 [2020-04-18 11:49:58,043 INFO L226 Difference]: Without dead ends: 3558 [2020-04-18 11:49:58,044 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:49:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-04-18 11:49:58,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-04-18 11:49:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-04-18 11:49:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-04-18 11:49:58,171 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-04-18 11:49:58,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:49:58,171 INFO L479 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-04-18 11:49:58,172 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:49:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-04-18 11:49:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:49:58,173 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:49:58,173 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:49:58,174 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:49:58,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:49:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash 69435085, now seen corresponding path program 1 times [2020-04-18 11:49:58,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:49:58,175 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1090090481] [2020-04-18 11:49:58,175 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:49:58,177 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 60 transitions. [2020-04-18 11:49:58,178 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-04-18 11:49:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:49:58,179 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:49:58,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:49:58,179 INFO L82 PathProgramCache]: Analyzing trace with hash 69436495, now seen corresponding path program 2 times [2020-04-18 11:49:58,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:49:58,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819808369] [2020-04-18 11:49:58,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:49:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:49:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:49:58,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819808369] [2020-04-18 11:49:58,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:49:58,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:49:58,236 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:49:58,241 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:49:58,248 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 32 transitions. [2020-04-18 11:49:58,248 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:49:58,253 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:49:58,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:49:58,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:49:58,254 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-04-18 11:49:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:49:58,270 INFO L93 Difference]: Finished difference Result 43 states and 64 transitions. [2020-04-18 11:49:58,270 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2020-04-18 11:49:58,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:49:58,272 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:49:58,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:49:58,273 INFO L82 PathProgramCache]: Analyzing trace with hash 69435085, now seen corresponding path program 3 times [2020-04-18 11:49:58,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:49:58,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265571587] [2020-04-18 11:49:58,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:49:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:49:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:49:58,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265571587] [2020-04-18 11:49:58,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:49:58,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:49:58,411 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:49:58,414 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:49:58,419 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 36 transitions. [2020-04-18 11:49:58,419 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:49:58,463 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:49:58,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:49:58,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:49:58,465 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand 7 states. [2020-04-18 11:49:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:49:58,596 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2020-04-18 11:49:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2020-04-18 11:49:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:49:58,597 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:49:58,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:49:58,597 INFO L82 PathProgramCache]: Analyzing trace with hash 595444189, now seen corresponding path program 4 times [2020-04-18 11:49:58,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:49:58,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27589127] [2020-04-18 11:49:58,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:49:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:49:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:49:58,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27589127] [2020-04-18 11:49:58,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:49:58,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:49:58,687 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:49:58,689 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:49:58,759 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 27 transitions. [2020-04-18 11:49:58,759 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:49:58,835 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:49:58,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:49:58,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-04-18 11:49:58,837 INFO L87 Difference]: Start difference. First operand 60 states and 84 transitions. Second operand 7 states. [2020-04-18 11:49:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:49:58,918 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2020-04-18 11:49:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 84 transitions. [2020-04-18 11:49:58,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:49:58,919 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1090090481] [2020-04-18 11:49:58,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:49:58,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:49:58,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1090090481] [2020-04-18 11:49:58,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-18 11:49:58,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:49:58,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:49:58,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2020-04-18 11:49:58,921 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 12 states. [2020-04-18 11:49:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:49:59,524 INFO L93 Difference]: Finished difference Result 4851 states and 18552 transitions. [2020-04-18 11:49:59,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-18 11:49:59,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-04-18 11:49:59,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:49:59,565 INFO L225 Difference]: With dead ends: 4851 [2020-04-18 11:49:59,566 INFO L226 Difference]: Without dead ends: 4827 [2020-04-18 11:49:59,566 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2020-04-18 11:49:59,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2020-04-18 11:49:59,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 3573. [2020-04-18 11:49:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-04-18 11:49:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-04-18 11:49:59,716 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-04-18 11:49:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:49:59,716 INFO L479 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-04-18 11:49:59,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-18 11:49:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-04-18 11:49:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:49:59,718 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:49:59,718 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:49:59,718 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:49:59,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:49:59,719 INFO L82 PathProgramCache]: Analyzing trace with hash -687500069, now seen corresponding path program 1 times [2020-04-18 11:49:59,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:49:59,719 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1934947796] [2020-04-18 11:49:59,720 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:49:59,721 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 47 transitions. [2020-04-18 11:49:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-04-18 11:49:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:49:59,722 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:49:59,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:49:59,722 INFO L82 PathProgramCache]: Analyzing trace with hash -687500069, now seen corresponding path program 2 times [2020-04-18 11:49:59,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:49:59,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215515215] [2020-04-18 11:49:59,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:49:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:49:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:49:59,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215515215] [2020-04-18 11:49:59,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:49:59,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:49:59,799 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:49:59,801 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:49:59,805 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 33 transitions. [2020-04-18 11:49:59,805 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:49:59,837 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:49:59,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:49:59,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:49:59,838 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 7 states. [2020-04-18 11:50:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:00,032 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2020-04-18 11:50:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2020-04-18 11:50:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:50:00,033 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:50:00,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1561087029, now seen corresponding path program 3 times [2020-04-18 11:50:00,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:00,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850788908] [2020-04-18 11:50:00,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:00,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850788908] [2020-04-18 11:50:00,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:00,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:50:00,151 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:00,153 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:00,155 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 22 transitions. [2020-04-18 11:50:00,156 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:00,247 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:50:00,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 11:50:00,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2020-04-18 11:50:00,248 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 8 states. [2020-04-18 11:50:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:00,559 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2020-04-18 11:50:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2020-04-18 11:50:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:50:00,560 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:50:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:00,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1254406997, now seen corresponding path program 4 times [2020-04-18 11:50:00,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:00,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94832319] [2020-04-18 11:50:00,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:00,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94832319] [2020-04-18 11:50:00,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:00,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 11:50:00,719 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:00,721 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:00,724 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 11:50:00,724 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:00,814 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:00,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:50:00,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2020-04-18 11:50:00,816 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 10 states. [2020-04-18 11:50:01,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:01,104 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2020-04-18 11:50:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2020-04-18 11:50:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:50:01,105 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:50:01,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:01,106 INFO L82 PathProgramCache]: Analyzing trace with hash -164095139, now seen corresponding path program 5 times [2020-04-18 11:50:01,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:01,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508236079] [2020-04-18 11:50:01,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:01,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508236079] [2020-04-18 11:50:01,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:01,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 11:50:01,361 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:01,363 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:01,426 INFO L259 McrAutomatonBuilder]: Finished intersection with 20 states and 20 transitions. [2020-04-18 11:50:01,427 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:01,721 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:01,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 11:50:01,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1100, Unknown=0, NotChecked=0, Total=1332 [2020-04-18 11:50:01,722 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 11 states. [2020-04-18 11:50:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:02,255 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2020-04-18 11:50:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2020-04-18 11:50:02,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:50:02,256 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1934947796] [2020-04-18 11:50:02,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:50:02,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-04-18 11:50:02,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1934947796] [2020-04-18 11:50:02,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-04-18 11:50:02,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:50:02,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-04-18 11:50:02,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=1468, Unknown=0, NotChecked=0, Total=1806 [2020-04-18 11:50:02,258 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 23 states. [2020-04-18 11:50:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:03,611 INFO L93 Difference]: Finished difference Result 5615 states and 22431 transitions. [2020-04-18 11:50:03,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 11:50:03,611 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 18 [2020-04-18 11:50:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:50:03,636 INFO L225 Difference]: With dead ends: 5615 [2020-04-18 11:50:03,637 INFO L226 Difference]: Without dead ends: 5463 [2020-04-18 11:50:03,638 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=480, Invalid=1970, Unknown=0, NotChecked=0, Total=2450 [2020-04-18 11:50:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2020-04-18 11:50:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 4116. [2020-04-18 11:50:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2020-04-18 11:50:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2020-04-18 11:50:03,792 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2020-04-18 11:50:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:50:03,792 INFO L479 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2020-04-18 11:50:03,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-04-18 11:50:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2020-04-18 11:50:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 11:50:03,794 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:50:03,794 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:50:03,795 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:50:03,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:03,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2041625758, now seen corresponding path program 1 times [2020-04-18 11:50:03,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:50:03,795 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [858264143] [2020-04-18 11:50:03,796 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:03,797 INFO L259 McrAutomatonBuilder]: Finished intersection with 56 states and 98 transitions. [2020-04-18 11:50:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2020-04-18 11:50:03,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 11:50:03,798 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:50:03,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:03,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1990996254, now seen corresponding path program 2 times [2020-04-18 11:50:03,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:03,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532700897] [2020-04-18 11:50:03,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:03,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532700897] [2020-04-18 11:50:03,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:03,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:50:03,826 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:03,828 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:03,831 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 34 transitions. [2020-04-18 11:50:03,831 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:03,835 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:50:03,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:50:03,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:50:03,836 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2020-04-18 11:50:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:03,849 INFO L93 Difference]: Finished difference Result 71 states and 120 transitions. [2020-04-18 11:50:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 120 transitions. [2020-04-18 11:50:03,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 11:50:03,850 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:50:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1992351264, now seen corresponding path program 3 times [2020-04-18 11:50:03,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:03,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949242391] [2020-04-18 11:50:03,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:03,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949242391] [2020-04-18 11:50:03,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:03,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:03,912 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:03,914 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:03,918 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 44 transitions. [2020-04-18 11:50:03,918 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:03,951 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:50:03,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:03,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:50:03,952 INFO L87 Difference]: Start difference. First operand 71 states and 120 transitions. Second operand 7 states. [2020-04-18 11:50:04,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:04,062 INFO L93 Difference]: Finished difference Result 108 states and 176 transitions. [2020-04-18 11:50:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 176 transitions. [2020-04-18 11:50:04,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 11:50:04,063 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:50:04,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:04,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2041802788, now seen corresponding path program 4 times [2020-04-18 11:50:04,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:04,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787576874] [2020-04-18 11:50:04,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:04,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787576874] [2020-04-18 11:50:04,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:04,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:04,115 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:04,116 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:04,120 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 31 transitions. [2020-04-18 11:50:04,120 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:04,176 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:50:04,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:04,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-04-18 11:50:04,177 INFO L87 Difference]: Start difference. First operand 108 states and 176 transitions. Second operand 7 states. [2020-04-18 11:50:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:04,266 INFO L93 Difference]: Finished difference Result 110 states and 176 transitions. [2020-04-18 11:50:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 176 transitions. [2020-04-18 11:50:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 11:50:04,267 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:50:04,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:04,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2041625758, now seen corresponding path program 5 times [2020-04-18 11:50:04,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:04,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104851410] [2020-04-18 11:50:04,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:04,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104851410] [2020-04-18 11:50:04,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:04,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:04,354 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:04,356 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:04,360 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 33 transitions. [2020-04-18 11:50:04,360 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:04,464 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 11:50:04,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:50:04,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2020-04-18 11:50:04,466 INFO L87 Difference]: Start difference. First operand 110 states and 176 transitions. Second operand 9 states. [2020-04-18 11:50:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:04,682 INFO L93 Difference]: Finished difference Result 110 states and 176 transitions. [2020-04-18 11:50:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 176 transitions. [2020-04-18 11:50:04,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:50:04,683 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [858264143] [2020-04-18 11:50:04,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:50:04,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-04-18 11:50:04,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [858264143] [2020-04-18 11:50:04,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 11:50:04,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:50:04,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 11:50:04,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2020-04-18 11:50:04,684 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 17 states. [2020-04-18 11:50:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:05,347 INFO L93 Difference]: Finished difference Result 5239 states and 20352 transitions. [2020-04-18 11:50:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-18 11:50:05,348 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2020-04-18 11:50:05,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:50:05,374 INFO L225 Difference]: With dead ends: 5239 [2020-04-18 11:50:05,374 INFO L226 Difference]: Without dead ends: 5239 [2020-04-18 11:50:05,375 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2020-04-18 11:50:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5239 states. [2020-04-18 11:50:05,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5239 to 4078. [2020-04-18 11:50:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2020-04-18 11:50:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2020-04-18 11:50:05,519 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2020-04-18 11:50:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:50:05,520 INFO L479 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2020-04-18 11:50:05,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 11:50:05,520 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2020-04-18 11:50:05,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 11:50:05,522 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:50:05,522 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:50:05,522 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:50:05,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:05,523 INFO L82 PathProgramCache]: Analyzing trace with hash 898872146, now seen corresponding path program 1 times [2020-04-18 11:50:05,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:50:05,523 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [363646809] [2020-04-18 11:50:05,524 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:05,525 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 66 transitions. [2020-04-18 11:50:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-04-18 11:50:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 11:50:05,525 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:50:05,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:05,526 INFO L82 PathProgramCache]: Analyzing trace with hash 496766702, now seen corresponding path program 2 times [2020-04-18 11:50:05,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:05,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763583725] [2020-04-18 11:50:05,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:05,605 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763583725] [2020-04-18 11:50:05,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:05,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:05,605 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:05,607 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:05,610 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 36 transitions. [2020-04-18 11:50:05,610 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:05,640 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:50:05,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:05,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:50:05,641 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 7 states. [2020-04-18 11:50:05,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:05,766 INFO L93 Difference]: Finished difference Result 57 states and 85 transitions. [2020-04-18 11:50:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2020-04-18 11:50:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 11:50:05,767 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:50:05,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:05,767 INFO L82 PathProgramCache]: Analyzing trace with hash 102521118, now seen corresponding path program 3 times [2020-04-18 11:50:05,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:05,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888990193] [2020-04-18 11:50:05,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:05,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888990193] [2020-04-18 11:50:05,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:05,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 11:50:05,889 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:05,891 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:05,896 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 27 transitions. [2020-04-18 11:50:05,896 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:05,995 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:05,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:50:05,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:50:05,997 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand 10 states. [2020-04-18 11:50:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:06,329 INFO L93 Difference]: Finished difference Result 67 states and 97 transitions. [2020-04-18 11:50:06,329 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2020-04-18 11:50:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 11:50:06,330 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:50:06,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:06,331 INFO L82 PathProgramCache]: Analyzing trace with hash 898872146, now seen corresponding path program 4 times [2020-04-18 11:50:06,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:06,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854210391] [2020-04-18 11:50:06,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:06,547 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2020-04-18 11:50:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:06,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854210391] [2020-04-18 11:50:06,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:06,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 11:50:06,716 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:06,718 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:06,721 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 23 transitions. [2020-04-18 11:50:06,721 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:06,945 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:06,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 11:50:06,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2020-04-18 11:50:06,946 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand 11 states. [2020-04-18 11:50:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:07,294 INFO L93 Difference]: Finished difference Result 79 states and 113 transitions. [2020-04-18 11:50:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2020-04-18 11:50:07,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:50:07,295 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [363646809] [2020-04-18 11:50:07,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:50:07,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-04-18 11:50:07,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [363646809] [2020-04-18 11:50:07,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-18 11:50:07,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:50:07,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 11:50:07,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2020-04-18 11:50:07,297 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 19 states. [2020-04-18 11:50:08,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:08,107 INFO L93 Difference]: Finished difference Result 5191 states and 21231 transitions. [2020-04-18 11:50:08,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-04-18 11:50:08,108 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2020-04-18 11:50:08,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:50:08,128 INFO L225 Difference]: With dead ends: 5191 [2020-04-18 11:50:08,128 INFO L226 Difference]: Without dead ends: 5117 [2020-04-18 11:50:08,129 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2020-04-18 11:50:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5117 states. [2020-04-18 11:50:08,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5117 to 3978. [2020-04-18 11:50:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2020-04-18 11:50:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 16074 transitions. [2020-04-18 11:50:08,263 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 16074 transitions. Word has length 19 [2020-04-18 11:50:08,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:50:08,264 INFO L479 AbstractCegarLoop]: Abstraction has 3978 states and 16074 transitions. [2020-04-18 11:50:08,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-18 11:50:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 16074 transitions. [2020-04-18 11:50:08,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 11:50:08,266 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:50:08,267 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:50:08,267 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:50:08,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:08,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1134272272, now seen corresponding path program 1 times [2020-04-18 11:50:08,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:50:08,268 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1368509264] [2020-04-18 11:50:08,268 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:08,270 INFO L259 McrAutomatonBuilder]: Finished intersection with 65 states and 117 transitions. [2020-04-18 11:50:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-04-18 11:50:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 11:50:08,271 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:50:08,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:08,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1591346490, now seen corresponding path program 2 times [2020-04-18 11:50:08,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:08,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490820559] [2020-04-18 11:50:08,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:08,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490820559] [2020-04-18 11:50:08,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:08,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:50:08,392 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:08,394 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:08,397 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 35 transitions. [2020-04-18 11:50:08,398 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:08,405 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:50:08,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:50:08,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:50:08,406 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2020-04-18 11:50:08,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:08,439 INFO L93 Difference]: Finished difference Result 85 states and 148 transitions. [2020-04-18 11:50:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 148 transitions. [2020-04-18 11:50:08,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 11:50:08,439 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:50:08,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:08,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1633351800, now seen corresponding path program 3 times [2020-04-18 11:50:08,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:08,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235353040] [2020-04-18 11:50:08,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:08,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235353040] [2020-04-18 11:50:08,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:08,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:08,518 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:08,519 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:08,523 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 51 transitions. [2020-04-18 11:50:08,524 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:08,557 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:50:08,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:08,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:50:08,558 INFO L87 Difference]: Start difference. First operand 85 states and 148 transitions. Second operand 7 states. [2020-04-18 11:50:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:08,675 INFO L93 Difference]: Finished difference Result 132 states and 222 transitions. [2020-04-18 11:50:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 222 transitions. [2020-04-18 11:50:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 11:50:08,676 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:50:08,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:08,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1128627772, now seen corresponding path program 4 times [2020-04-18 11:50:08,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:08,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914536151] [2020-04-18 11:50:08,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:08,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914536151] [2020-04-18 11:50:08,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:08,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:08,729 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:08,731 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:08,735 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2020-04-18 11:50:08,735 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:08,795 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:50:08,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:08,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-04-18 11:50:08,796 INFO L87 Difference]: Start difference. First operand 132 states and 222 transitions. Second operand 7 states. [2020-04-18 11:50:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:08,875 INFO L93 Difference]: Finished difference Result 134 states and 222 transitions. [2020-04-18 11:50:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 222 transitions. [2020-04-18 11:50:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 11:50:08,876 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:50:08,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:08,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1134272272, now seen corresponding path program 5 times [2020-04-18 11:50:08,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:08,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635628969] [2020-04-18 11:50:08,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:08,989 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635628969] [2020-04-18 11:50:08,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:08,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 11:50:08,990 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:08,992 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:08,996 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2020-04-18 11:50:08,996 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:09,149 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:09,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:50:09,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2020-04-18 11:50:09,150 INFO L87 Difference]: Start difference. First operand 134 states and 222 transitions. Second operand 10 states. [2020-04-18 11:50:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:09,443 INFO L93 Difference]: Finished difference Result 181 states and 295 transitions. [2020-04-18 11:50:09,443 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2020-04-18 11:50:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 11:50:09,444 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:50:09,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:09,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2045819536, now seen corresponding path program 6 times [2020-04-18 11:50:09,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:09,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722931035] [2020-04-18 11:50:09,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:09,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722931035] [2020-04-18 11:50:09,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:09,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 11:50:09,653 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:09,654 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:09,658 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2020-04-18 11:50:09,658 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:09,937 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:09,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:50:09,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2020-04-18 11:50:09,938 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand 10 states. [2020-04-18 11:50:10,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:10,549 INFO L93 Difference]: Finished difference Result 222 states and 357 transitions. [2020-04-18 11:50:10,549 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 357 transitions. [2020-04-18 11:50:10,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 11:50:10,550 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 11:50:10,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:10,552 INFO L82 PathProgramCache]: Analyzing trace with hash 657525156, now seen corresponding path program 7 times [2020-04-18 11:50:10,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:10,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130707501] [2020-04-18 11:50:10,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:10,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130707501] [2020-04-18 11:50:10,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:10,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:50:10,632 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:10,634 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:10,638 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 42 transitions. [2020-04-18 11:50:10,638 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:10,781 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:10,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:50:10,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1568, Unknown=0, NotChecked=0, Total=1806 [2020-04-18 11:50:10,783 INFO L87 Difference]: Start difference. First operand 222 states and 357 transitions. Second operand 9 states. [2020-04-18 11:50:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:11,090 INFO L93 Difference]: Finished difference Result 247 states and 391 transitions. [2020-04-18 11:50:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 391 transitions. [2020-04-18 11:50:11,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:50:11,092 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1368509264] [2020-04-18 11:50:11,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:50:11,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 11:50:11,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1368509264] [2020-04-18 11:50:11,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-04-18 11:50:11,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:50:11,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-04-18 11:50:11,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1871, Unknown=0, NotChecked=0, Total=2162 [2020-04-18 11:50:11,094 INFO L87 Difference]: Start difference. First operand 3978 states and 16074 transitions. Second operand 27 states. [2020-04-18 11:50:12,471 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2020-04-18 11:50:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:13,843 INFO L93 Difference]: Finished difference Result 6696 states and 26086 transitions. [2020-04-18 11:50:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-04-18 11:50:13,843 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 20 [2020-04-18 11:50:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:50:13,865 INFO L225 Difference]: With dead ends: 6696 [2020-04-18 11:50:13,865 INFO L226 Difference]: Without dead ends: 6604 [2020-04-18 11:50:13,867 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=818, Invalid=3604, Unknown=0, NotChecked=0, Total=4422 [2020-04-18 11:50:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6604 states. [2020-04-18 11:50:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6604 to 3948. [2020-04-18 11:50:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2020-04-18 11:50:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 16005 transitions. [2020-04-18 11:50:14,021 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 16005 transitions. Word has length 20 [2020-04-18 11:50:14,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:50:14,022 INFO L479 AbstractCegarLoop]: Abstraction has 3948 states and 16005 transitions. [2020-04-18 11:50:14,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-04-18 11:50:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 16005 transitions. [2020-04-18 11:50:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:14,024 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:50:14,025 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:50:14,025 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:50:14,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:14,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1935934284, now seen corresponding path program 1 times [2020-04-18 11:50:14,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:50:14,026 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1019152107] [2020-04-18 11:50:14,026 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:14,028 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 72 transitions. [2020-04-18 11:50:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2020-04-18 11:50:14,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:14,028 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:50:14,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:14,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1964861934, now seen corresponding path program 2 times [2020-04-18 11:50:14,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:14,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574968948] [2020-04-18 11:50:14,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:14,052 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574968948] [2020-04-18 11:50:14,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:14,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:50:14,052 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:14,054 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:14,058 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2020-04-18 11:50:14,058 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:14,062 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:50:14,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:50:14,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:50:14,063 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-04-18 11:50:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:14,075 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2020-04-18 11:50:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2020-04-18 11:50:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:14,076 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:50:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:14,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1935934284, now seen corresponding path program 3 times [2020-04-18 11:50:14,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:14,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675998966] [2020-04-18 11:50:14,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:14,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675998966] [2020-04-18 11:50:14,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:14,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:14,127 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:14,129 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:14,133 INFO L259 McrAutomatonBuilder]: Finished intersection with 31 states and 40 transitions. [2020-04-18 11:50:14,133 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:14,164 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:50:14,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:14,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:50:14,164 INFO L87 Difference]: Start difference. First operand 51 states and 76 transitions. Second operand 7 states. [2020-04-18 11:50:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:14,296 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2020-04-18 11:50:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2020-04-18 11:50:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:14,297 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:50:14,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:14,297 INFO L82 PathProgramCache]: Analyzing trace with hash 536754116, now seen corresponding path program 4 times [2020-04-18 11:50:14,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:14,297 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829603020] [2020-04-18 11:50:14,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:14,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829603020] [2020-04-18 11:50:14,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:14,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:50:14,356 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:14,358 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:14,362 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 29 transitions. [2020-04-18 11:50:14,362 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:14,423 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:50:14,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:14,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-04-18 11:50:14,424 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand 7 states. [2020-04-18 11:50:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:14,498 INFO L93 Difference]: Finished difference Result 72 states and 100 transitions. [2020-04-18 11:50:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2020-04-18 11:50:14,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:50:14,499 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1019152107] [2020-04-18 11:50:14,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:50:14,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:50:14,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1019152107] [2020-04-18 11:50:14,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-04-18 11:50:14,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:50:14,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:50:14,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2020-04-18 11:50:14,501 INFO L87 Difference]: Start difference. First operand 3948 states and 16005 transitions. Second operand 12 states. [2020-04-18 11:50:15,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:15,064 INFO L93 Difference]: Finished difference Result 5703 states and 21873 transitions. [2020-04-18 11:50:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-04-18 11:50:15,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-04-18 11:50:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:50:15,079 INFO L225 Difference]: With dead ends: 5703 [2020-04-18 11:50:15,079 INFO L226 Difference]: Without dead ends: 5056 [2020-04-18 11:50:15,080 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2020-04-18 11:50:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5056 states. [2020-04-18 11:50:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5056 to 3901. [2020-04-18 11:50:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2020-04-18 11:50:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 15421 transitions. [2020-04-18 11:50:15,201 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 15421 transitions. Word has length 21 [2020-04-18 11:50:15,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:50:15,202 INFO L479 AbstractCegarLoop]: Abstraction has 3901 states and 15421 transitions. [2020-04-18 11:50:15,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-04-18 11:50:15,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 15421 transitions. [2020-04-18 11:50:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:15,205 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:50:15,205 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:50:15,205 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:50:15,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:15,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1183087759, now seen corresponding path program 1 times [2020-04-18 11:50:15,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:50:15,206 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1224289593] [2020-04-18 11:50:15,207 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:15,209 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 136 transitions. [2020-04-18 11:50:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-04-18 11:50:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:15,210 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:50:15,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:15,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2086944531, now seen corresponding path program 2 times [2020-04-18 11:50:15,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:15,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405870527] [2020-04-18 11:50:15,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:15,232 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405870527] [2020-04-18 11:50:15,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:15,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:50:15,233 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:15,235 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:15,238 INFO L259 McrAutomatonBuilder]: Finished intersection with 29 states and 36 transitions. [2020-04-18 11:50:15,239 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:15,243 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:50:15,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:50:15,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:50:15,243 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-04-18 11:50:15,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:15,264 INFO L93 Difference]: Finished difference Result 99 states and 176 transitions. [2020-04-18 11:50:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 176 transitions. [2020-04-18 11:50:15,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:15,265 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:50:15,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash 905858155, now seen corresponding path program 3 times [2020-04-18 11:50:15,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:15,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620626261] [2020-04-18 11:50:15,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:15,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620626261] [2020-04-18 11:50:15,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:15,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:15,314 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:15,316 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:15,320 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 46 transitions. [2020-04-18 11:50:15,320 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:15,353 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:50:15,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:50:15,353 INFO L87 Difference]: Start difference. First operand 99 states and 176 transitions. Second operand 7 states. [2020-04-18 11:50:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:15,477 INFO L93 Difference]: Finished difference Result 156 states and 268 transitions. [2020-04-18 11:50:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 268 transitions. [2020-04-18 11:50:15,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:15,478 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:50:15,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:15,478 INFO L82 PathProgramCache]: Analyzing trace with hash -828967921, now seen corresponding path program 4 times [2020-04-18 11:50:15,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:15,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600989519] [2020-04-18 11:50:15,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:15,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600989519] [2020-04-18 11:50:15,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:15,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:15,539 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:15,542 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:15,548 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 31 transitions. [2020-04-18 11:50:15,549 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:15,690 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:15,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:50:15,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:50:15,691 INFO L87 Difference]: Start difference. First operand 156 states and 268 transitions. Second operand 6 states. [2020-04-18 11:50:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:15,769 INFO L93 Difference]: Finished difference Result 162 states and 272 transitions. [2020-04-18 11:50:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 272 transitions. [2020-04-18 11:50:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:15,770 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:50:15,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:15,770 INFO L82 PathProgramCache]: Analyzing trace with hash -999269101, now seen corresponding path program 5 times [2020-04-18 11:50:15,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:15,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370681830] [2020-04-18 11:50:15,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:15,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370681830] [2020-04-18 11:50:15,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:15,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:50:15,890 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:15,892 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:15,897 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 41 transitions. [2020-04-18 11:50:15,897 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:16,069 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 11:50:16,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:50:16,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2020-04-18 11:50:16,070 INFO L87 Difference]: Start difference. First operand 162 states and 272 transitions. Second operand 10 states. [2020-04-18 11:50:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:16,251 INFO L93 Difference]: Finished difference Result 162 states and 272 transitions. [2020-04-18 11:50:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 272 transitions. [2020-04-18 11:50:16,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:50:16,252 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1224289593] [2020-04-18 11:50:16,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:50:16,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 11:50:16,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1224289593] [2020-04-18 11:50:16,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-04-18 11:50:16,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:50:16,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-18 11:50:16,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2020-04-18 11:50:16,255 INFO L87 Difference]: Start difference. First operand 3901 states and 15421 transitions. Second operand 18 states. [2020-04-18 11:50:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:16,965 INFO L93 Difference]: Finished difference Result 4517 states and 17318 transitions. [2020-04-18 11:50:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-18 11:50:16,965 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2020-04-18 11:50:16,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:50:16,975 INFO L225 Difference]: With dead ends: 4517 [2020-04-18 11:50:16,975 INFO L226 Difference]: Without dead ends: 4362 [2020-04-18 11:50:16,976 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:50:16,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4362 states. [2020-04-18 11:50:17,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4362 to 3680. [2020-04-18 11:50:17,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2020-04-18 11:50:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 14531 transitions. [2020-04-18 11:50:17,073 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 14531 transitions. Word has length 21 [2020-04-18 11:50:17,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:50:17,074 INFO L479 AbstractCegarLoop]: Abstraction has 3680 states and 14531 transitions. [2020-04-18 11:50:17,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-04-18 11:50:17,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 14531 transitions. [2020-04-18 11:50:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:17,077 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:50:17,077 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:50:17,077 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:50:17,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:17,077 INFO L82 PathProgramCache]: Analyzing trace with hash 558787563, now seen corresponding path program 1 times [2020-04-18 11:50:17,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:50:17,078 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1155020760] [2020-04-18 11:50:17,078 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:17,081 INFO L259 McrAutomatonBuilder]: Finished intersection with 92 states and 192 transitions. [2020-04-18 11:50:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2020-04-18 11:50:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:17,082 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:50:17,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:17,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2086945207, now seen corresponding path program 2 times [2020-04-18 11:50:17,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:17,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511466463] [2020-04-18 11:50:17,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:17,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511466463] [2020-04-18 11:50:17,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:17,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:50:17,103 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:17,105 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:17,108 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2020-04-18 11:50:17,108 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:17,115 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:50:17,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:50:17,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:50:17,116 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 3 states. [2020-04-18 11:50:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:17,133 INFO L93 Difference]: Finished difference Result 127 states and 260 transitions. [2020-04-18 11:50:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 260 transitions. [2020-04-18 11:50:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:17,133 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:50:17,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:17,134 INFO L82 PathProgramCache]: Analyzing trace with hash 905857479, now seen corresponding path program 3 times [2020-04-18 11:50:17,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:17,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580497725] [2020-04-18 11:50:17,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:17,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580497725] [2020-04-18 11:50:17,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:17,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:17,181 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:17,183 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:17,188 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 54 transitions. [2020-04-18 11:50:17,188 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:17,221 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:50:17,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:17,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:50:17,222 INFO L87 Difference]: Start difference. First operand 127 states and 260 transitions. Second operand 7 states. [2020-04-18 11:50:17,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:17,348 INFO L93 Difference]: Finished difference Result 204 states and 408 transitions. [2020-04-18 11:50:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 408 transitions. [2020-04-18 11:50:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:17,349 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:50:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:17,349 INFO L82 PathProgramCache]: Analyzing trace with hash -828968597, now seen corresponding path program 4 times [2020-04-18 11:50:17,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:17,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182553281] [2020-04-18 11:50:17,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:17,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182553281] [2020-04-18 11:50:17,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:17,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:17,405 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:17,408 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:17,416 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 41 transitions. [2020-04-18 11:50:17,416 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:17,480 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:17,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:50:17,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:50:17,481 INFO L87 Difference]: Start difference. First operand 204 states and 408 transitions. Second operand 6 states. [2020-04-18 11:50:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:17,579 INFO L93 Difference]: Finished difference Result 212 states and 414 transitions. [2020-04-18 11:50:17,580 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 414 transitions. [2020-04-18 11:50:17,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:17,580 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:50:17,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:17,581 INFO L82 PathProgramCache]: Analyzing trace with hash -999290057, now seen corresponding path program 5 times [2020-04-18 11:50:17,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:17,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267861006] [2020-04-18 11:50:17,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:17,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267861006] [2020-04-18 11:50:17,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:17,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 11:50:17,801 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:17,803 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:17,809 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 51 transitions. [2020-04-18 11:50:17,809 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:18,051 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:18,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:50:18,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2020-04-18 11:50:18,052 INFO L87 Difference]: Start difference. First operand 212 states and 414 transitions. Second operand 10 states. [2020-04-18 11:50:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:18,886 INFO L93 Difference]: Finished difference Result 286 states and 553 transitions. [2020-04-18 11:50:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 553 transitions. [2020-04-18 11:50:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:18,887 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:50:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash 558787563, now seen corresponding path program 6 times [2020-04-18 11:50:18,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:18,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471433380] [2020-04-18 11:50:18,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:19,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471433380] [2020-04-18 11:50:19,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:19,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 11:50:19,206 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:19,207 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:19,210 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 25 transitions. [2020-04-18 11:50:19,211 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:19,602 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:19,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:50:19,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2020-04-18 11:50:19,604 INFO L87 Difference]: Start difference. First operand 286 states and 553 transitions. Second operand 12 states. [2020-04-18 11:50:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:20,404 INFO L93 Difference]: Finished difference Result 366 states and 703 transitions. [2020-04-18 11:50:20,404 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 703 transitions. [2020-04-18 11:50:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:20,406 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 11:50:20,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:20,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1086742877, now seen corresponding path program 7 times [2020-04-18 11:50:20,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:20,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952570300] [2020-04-18 11:50:20,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:20,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952570300] [2020-04-18 11:50:20,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:20,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:50:20,489 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:20,491 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:20,496 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 55 transitions. [2020-04-18 11:50:20,497 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:20,586 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:20,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:50:20,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1897, Unknown=0, NotChecked=0, Total=2162 [2020-04-18 11:50:20,588 INFO L87 Difference]: Start difference. First operand 366 states and 703 transitions. Second operand 9 states. [2020-04-18 11:50:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:20,909 INFO L93 Difference]: Finished difference Result 424 states and 799 transitions. [2020-04-18 11:50:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 799 transitions. [2020-04-18 11:50:20,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:50:20,911 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1155020760] [2020-04-18 11:50:20,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:50:20,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 11:50:20,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1155020760] [2020-04-18 11:50:20,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-04-18 11:50:20,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:50:20,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-04-18 11:50:20,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2232, Unknown=0, NotChecked=0, Total=2550 [2020-04-18 11:50:20,913 INFO L87 Difference]: Start difference. First operand 3680 states and 14531 transitions. Second operand 29 states. [2020-04-18 11:50:21,689 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 39 [2020-04-18 11:50:21,848 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 41 [2020-04-18 11:50:22,029 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2020-04-18 11:50:22,202 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2020-04-18 11:50:23,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:23,235 INFO L93 Difference]: Finished difference Result 5059 states and 19398 transitions. [2020-04-18 11:50:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 11:50:23,235 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 21 [2020-04-18 11:50:23,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:50:23,246 INFO L225 Difference]: With dead ends: 5059 [2020-04-18 11:50:23,246 INFO L226 Difference]: Without dead ends: 5010 [2020-04-18 11:50:23,248 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=651, Invalid=3131, Unknown=0, NotChecked=0, Total=3782 [2020-04-18 11:50:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5010 states. [2020-04-18 11:50:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5010 to 3330. [2020-04-18 11:50:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2020-04-18 11:50:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 12802 transitions. [2020-04-18 11:50:23,336 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 12802 transitions. Word has length 21 [2020-04-18 11:50:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:50:23,336 INFO L479 AbstractCegarLoop]: Abstraction has 3330 states and 12802 transitions. [2020-04-18 11:50:23,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-04-18 11:50:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 12802 transitions. [2020-04-18 11:50:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:23,339 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:50:23,339 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:50:23,339 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:50:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:23,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2087336367, now seen corresponding path program 1 times [2020-04-18 11:50:23,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:50:23,340 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1061951193] [2020-04-18 11:50:23,341 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:23,342 INFO L259 McrAutomatonBuilder]: Finished intersection with 60 states and 104 transitions. [2020-04-18 11:50:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2020-04-18 11:50:23,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:23,343 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:50:23,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:23,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1705083825, now seen corresponding path program 2 times [2020-04-18 11:50:23,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:23,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395439628] [2020-04-18 11:50:23,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:23,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:23,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395439628] [2020-04-18 11:50:23,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:23,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:23,399 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:23,401 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:23,405 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 50 transitions. [2020-04-18 11:50:23,405 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:23,434 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:50:23,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:23,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:50:23,435 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 7 states. [2020-04-18 11:50:23,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:23,559 INFO L93 Difference]: Finished difference Result 87 states and 145 transitions. [2020-04-18 11:50:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 145 transitions. [2020-04-18 11:50:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:23,560 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:50:23,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:23,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1676999295, now seen corresponding path program 3 times [2020-04-18 11:50:23,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:23,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638843299] [2020-04-18 11:50:23,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:23,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638843299] [2020-04-18 11:50:23,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:23,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 11:50:23,704 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:23,706 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:23,711 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 41 transitions. [2020-04-18 11:50:23,711 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:23,771 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:50:23,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:50:23,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:50:23,772 INFO L87 Difference]: Start difference. First operand 87 states and 145 transitions. Second operand 10 states. [2020-04-18 11:50:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:24,103 INFO L93 Difference]: Finished difference Result 109 states and 179 transitions. [2020-04-18 11:50:24,103 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 179 transitions. [2020-04-18 11:50:24,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:24,104 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:50:24,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:24,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2087336367, now seen corresponding path program 4 times [2020-04-18 11:50:24,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:24,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100010769] [2020-04-18 11:50:24,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:24,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100010769] [2020-04-18 11:50:24,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:24,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 11:50:24,430 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:24,433 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:24,439 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 29 transitions. [2020-04-18 11:50:24,439 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:24,933 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:24,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:50:24,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2020-04-18 11:50:24,934 INFO L87 Difference]: Start difference. First operand 109 states and 179 transitions. Second operand 12 states. [2020-04-18 11:50:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:25,644 INFO L93 Difference]: Finished difference Result 115 states and 184 transitions. [2020-04-18 11:50:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 184 transitions. [2020-04-18 11:50:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 11:50:25,644 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:50:25,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:25,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2100148047, now seen corresponding path program 5 times [2020-04-18 11:50:25,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:25,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351592253] [2020-04-18 11:50:25,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:25,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351592253] [2020-04-18 11:50:25,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:25,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 11:50:25,905 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:25,906 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:25,911 INFO L259 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2020-04-18 11:50:25,911 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:26,317 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:50:26,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:50:26,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1568, Unknown=0, NotChecked=0, Total=1806 [2020-04-18 11:50:26,318 INFO L87 Difference]: Start difference. First operand 115 states and 184 transitions. Second operand 12 states. [2020-04-18 11:50:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:27,050 INFO L93 Difference]: Finished difference Result 139 states and 222 transitions. [2020-04-18 11:50:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 222 transitions. [2020-04-18 11:50:27,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:50:27,051 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1061951193] [2020-04-18 11:50:27,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:50:27,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-04-18 11:50:27,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1061951193] [2020-04-18 11:50:27,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-04-18 11:50:27,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:50:27,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-04-18 11:50:27,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=2013, Unknown=0, NotChecked=0, Total=2352 [2020-04-18 11:50:27,054 INFO L87 Difference]: Start difference. First operand 3330 states and 12802 transitions. Second operand 29 states. [2020-04-18 11:50:27,954 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 46 [2020-04-18 11:50:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:28,772 INFO L93 Difference]: Finished difference Result 3499 states and 13062 transitions. [2020-04-18 11:50:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-04-18 11:50:28,772 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 21 [2020-04-18 11:50:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:50:28,781 INFO L225 Difference]: With dead ends: 3499 [2020-04-18 11:50:28,781 INFO L226 Difference]: Without dead ends: 3343 [2020-04-18 11:50:28,782 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=635, Invalid=3025, Unknown=0, NotChecked=0, Total=3660 [2020-04-18 11:50:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2020-04-18 11:50:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 2831. [2020-04-18 11:50:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-04-18 11:50:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-04-18 11:50:28,843 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-04-18 11:50:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:50:28,843 INFO L479 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-04-18 11:50:28,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-04-18 11:50:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-04-18 11:50:28,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:50:28,846 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:50:28,846 INFO L425 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] [2020-04-18 11:50:28,847 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:50:28,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:28,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1396456954, now seen corresponding path program 1 times [2020-04-18 11:50:28,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:50:28,847 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [540528291] [2020-04-18 11:50:28,848 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:28,850 INFO L259 McrAutomatonBuilder]: Finished intersection with 63 states and 111 transitions. [2020-04-18 11:50:28,850 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2020-04-18 11:50:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:50:28,851 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:50:28,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:28,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1118891378, now seen corresponding path program 2 times [2020-04-18 11:50:28,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:28,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930209596] [2020-04-18 11:50:28,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:28,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:28,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930209596] [2020-04-18 11:50:28,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:28,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:50:28,875 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:28,877 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:28,882 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 47 transitions. [2020-04-18 11:50:28,882 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:28,889 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:50:28,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:50:28,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:50:28,889 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 3 states. [2020-04-18 11:50:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:28,903 INFO L93 Difference]: Finished difference Result 68 states and 115 transitions. [2020-04-18 11:50:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 115 transitions. [2020-04-18 11:50:28,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:50:28,903 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:50:28,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:28,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1120678838, now seen corresponding path program 3 times [2020-04-18 11:50:28,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:28,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425137277] [2020-04-18 11:50:28,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:28,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425137277] [2020-04-18 11:50:28,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:28,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:28,953 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:28,955 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:28,960 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-04-18 11:50:28,960 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:29,011 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:50:29,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:29,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:50:29,012 INFO L87 Difference]: Start difference. First operand 68 states and 115 transitions. Second operand 7 states. [2020-04-18 11:50:29,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:29,191 INFO L93 Difference]: Finished difference Result 99 states and 158 transitions. [2020-04-18 11:50:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 158 transitions. [2020-04-18 11:50:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:50:29,192 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:50:29,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:29,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1396456954, now seen corresponding path program 4 times [2020-04-18 11:50:29,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:29,193 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895542267] [2020-04-18 11:50:29,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:29,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895542267] [2020-04-18 11:50:29,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:29,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:50:29,324 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:29,327 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:29,333 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 42 transitions. [2020-04-18 11:50:29,333 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:29,440 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:50:29,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 11:50:29,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2020-04-18 11:50:29,441 INFO L87 Difference]: Start difference. First operand 99 states and 158 transitions. Second operand 8 states. [2020-04-18 11:50:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:29,756 INFO L93 Difference]: Finished difference Result 128 states and 199 transitions. [2020-04-18 11:50:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 199 transitions. [2020-04-18 11:50:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:50:29,757 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:50:29,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:29,757 INFO L82 PathProgramCache]: Analyzing trace with hash 644682778, now seen corresponding path program 5 times [2020-04-18 11:50:29,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:29,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885904678] [2020-04-18 11:50:29,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:29,908 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885904678] [2020-04-18 11:50:29,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:29,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 11:50:29,909 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:29,913 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:29,921 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 44 transitions. [2020-04-18 11:50:29,921 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:30,163 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:50:30,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:50:30,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2020-04-18 11:50:30,164 INFO L87 Difference]: Start difference. First operand 128 states and 199 transitions. Second operand 9 states. [2020-04-18 11:50:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:30,670 INFO L93 Difference]: Finished difference Result 154 states and 235 transitions. [2020-04-18 11:50:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 235 transitions. [2020-04-18 11:50:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:50:30,671 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:50:30,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:30,671 INFO L82 PathProgramCache]: Analyzing trace with hash -787433364, now seen corresponding path program 6 times [2020-04-18 11:50:30,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:30,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153766276] [2020-04-18 11:50:30,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:30,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153766276] [2020-04-18 11:50:30,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:30,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 11:50:30,788 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:30,790 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:30,797 INFO L259 McrAutomatonBuilder]: Finished intersection with 37 states and 52 transitions. [2020-04-18 11:50:30,797 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:31,008 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 11:50:31,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 11:50:31,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2020-04-18 11:50:31,009 INFO L87 Difference]: Start difference. First operand 154 states and 235 transitions. Second operand 11 states. [2020-04-18 11:50:31,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:31,476 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2020-04-18 11:50:31,476 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 258 transitions. [2020-04-18 11:50:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:50:31,477 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 11:50:31,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:31,477 INFO L82 PathProgramCache]: Analyzing trace with hash -270857424, now seen corresponding path program 7 times [2020-04-18 11:50:31,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:31,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61524277] [2020-04-18 11:50:31,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:31,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61524277] [2020-04-18 11:50:31,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:31,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 11:50:31,981 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:31,983 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:31,987 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 32 transitions. [2020-04-18 11:50:31,988 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:32,306 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:32,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 11:50:32,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=2531, Unknown=0, NotChecked=0, Total=2970 [2020-04-18 11:50:32,309 INFO L87 Difference]: Start difference. First operand 173 states and 258 transitions. Second operand 11 states. [2020-04-18 11:50:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:32,687 INFO L93 Difference]: Finished difference Result 201 states and 293 transitions. [2020-04-18 11:50:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 293 transitions. [2020-04-18 11:50:32,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:50:32,689 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [540528291] [2020-04-18 11:50:32,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:50:32,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-04-18 11:50:32,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [540528291] [2020-04-18 11:50:32,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-04-18 11:50:32,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:50:32,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-04-18 11:50:32,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=2881, Unknown=0, NotChecked=0, Total=3422 [2020-04-18 11:50:32,691 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 32 states. [2020-04-18 11:50:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:34,330 INFO L93 Difference]: Finished difference Result 3992 states and 14506 transitions. [2020-04-18 11:50:34,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-04-18 11:50:34,330 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 22 [2020-04-18 11:50:34,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:50:34,339 INFO L225 Difference]: With dead ends: 3992 [2020-04-18 11:50:34,339 INFO L226 Difference]: Without dead ends: 3932 [2020-04-18 11:50:34,343 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=964, Invalid=3866, Unknown=0, NotChecked=0, Total=4830 [2020-04-18 11:50:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2020-04-18 11:50:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 2568. [2020-04-18 11:50:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2020-04-18 11:50:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 9467 transitions. [2020-04-18 11:50:34,410 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 9467 transitions. Word has length 22 [2020-04-18 11:50:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:50:34,411 INFO L479 AbstractCegarLoop]: Abstraction has 2568 states and 9467 transitions. [2020-04-18 11:50:34,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-04-18 11:50:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 9467 transitions. [2020-04-18 11:50:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:34,414 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:50:34,414 INFO L425 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] [2020-04-18 11:50:34,414 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:50:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:34,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1684489160, now seen corresponding path program 1 times [2020-04-18 11:50:34,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:50:34,415 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [852820187] [2020-04-18 11:50:34,415 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:34,419 INFO L259 McrAutomatonBuilder]: Finished intersection with 146 states and 342 transitions. [2020-04-18 11:50:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2020-04-18 11:50:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:34,421 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:50:34,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:34,421 INFO L82 PathProgramCache]: Analyzing trace with hash 195891558, now seen corresponding path program 2 times [2020-04-18 11:50:34,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:34,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987426747] [2020-04-18 11:50:34,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:34,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987426747] [2020-04-18 11:50:34,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:34,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:50:34,465 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:34,468 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:34,473 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 44 transitions. [2020-04-18 11:50:34,473 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:34,476 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:50:34,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:50:34,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:50:34,477 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2020-04-18 11:50:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:34,498 INFO L93 Difference]: Finished difference Result 211 states and 484 transitions. [2020-04-18 11:50:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 484 transitions. [2020-04-18 11:50:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:34,499 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:50:34,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:34,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1348815516, now seen corresponding path program 3 times [2020-04-18 11:50:34,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:34,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895198602] [2020-04-18 11:50:34,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:34,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895198602] [2020-04-18 11:50:34,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:34,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:34,552 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:34,555 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:34,561 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 60 transitions. [2020-04-18 11:50:34,561 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:34,598 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:50:34,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:34,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:50:34,598 INFO L87 Difference]: Start difference. First operand 211 states and 484 transitions. Second operand 7 states. [2020-04-18 11:50:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:34,732 INFO L93 Difference]: Finished difference Result 348 states and 780 transitions. [2020-04-18 11:50:34,733 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 780 transitions. [2020-04-18 11:50:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:34,734 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:50:34,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:34,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2069363704, now seen corresponding path program 4 times [2020-04-18 11:50:34,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:34,735 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733325108] [2020-04-18 11:50:34,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:34,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733325108] [2020-04-18 11:50:34,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:34,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:34,789 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:34,791 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:34,797 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 47 transitions. [2020-04-18 11:50:34,798 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:34,841 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:34,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:50:34,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:50:34,842 INFO L87 Difference]: Start difference. First operand 348 states and 780 transitions. Second operand 6 states. [2020-04-18 11:50:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:34,922 INFO L93 Difference]: Finished difference Result 368 states and 806 transitions. [2020-04-18 11:50:34,922 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 806 transitions. [2020-04-18 11:50:34,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:34,923 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:50:34,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:34,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1770244730, now seen corresponding path program 5 times [2020-04-18 11:50:34,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:34,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499473203] [2020-04-18 11:50:34,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:35,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:35,105 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499473203] [2020-04-18 11:50:35,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:35,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 11:50:35,106 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:35,108 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:35,116 INFO L259 McrAutomatonBuilder]: Finished intersection with 48 states and 77 transitions. [2020-04-18 11:50:35,116 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:35,383 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:35,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:50:35,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2020-04-18 11:50:35,384 INFO L87 Difference]: Start difference. First operand 368 states and 806 transitions. Second operand 10 states. [2020-04-18 11:50:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:36,150 INFO L93 Difference]: Finished difference Result 514 states and 1114 transitions. [2020-04-18 11:50:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1114 transitions. [2020-04-18 11:50:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:36,152 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:50:36,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1684489160, now seen corresponding path program 6 times [2020-04-18 11:50:36,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:36,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034324622] [2020-04-18 11:50:36,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:36,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034324622] [2020-04-18 11:50:36,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:36,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 11:50:36,513 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:36,515 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:36,519 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 31 transitions. [2020-04-18 11:50:36,520 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:36,945 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:50:36,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2020-04-18 11:50:36,946 INFO L87 Difference]: Start difference. First operand 514 states and 1114 transitions. Second operand 12 states. [2020-04-18 11:50:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:37,812 INFO L93 Difference]: Finished difference Result 604 states and 1306 transitions. [2020-04-18 11:50:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1306 transitions. [2020-04-18 11:50:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:37,813 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 11:50:37,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:37,813 INFO L82 PathProgramCache]: Analyzing trace with hash -667536666, now seen corresponding path program 7 times [2020-04-18 11:50:37,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:37,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648934406] [2020-04-18 11:50:37,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:37,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648934406] [2020-04-18 11:50:37,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:37,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:50:37,887 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:37,889 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:37,895 INFO L259 McrAutomatonBuilder]: Finished intersection with 50 states and 81 transitions. [2020-04-18 11:50:37,896 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:37,976 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:50:37,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:50:37,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1759, Unknown=0, NotChecked=0, Total=2070 [2020-04-18 11:50:37,977 INFO L87 Difference]: Start difference. First operand 604 states and 1306 transitions. Second operand 9 states. [2020-04-18 11:50:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:38,316 INFO L93 Difference]: Finished difference Result 748 states and 1610 transitions. [2020-04-18 11:50:38,316 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1610 transitions. [2020-04-18 11:50:38,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:50:38,319 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [852820187] [2020-04-18 11:50:38,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:50:38,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 11:50:38,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [852820187] [2020-04-18 11:50:38,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-04-18 11:50:38,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:50:38,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-04-18 11:50:38,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=2080, Unknown=0, NotChecked=0, Total=2450 [2020-04-18 11:50:38,321 INFO L87 Difference]: Start difference. First operand 2568 states and 9467 transitions. Second operand 28 states. [2020-04-18 11:50:39,176 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2020-04-18 11:50:39,353 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 49 [2020-04-18 11:50:39,549 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2020-04-18 11:50:39,742 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2020-04-18 11:50:40,036 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2020-04-18 11:50:40,174 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2020-04-18 11:50:40,335 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2020-04-18 11:50:40,760 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2020-04-18 11:50:40,939 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2020-04-18 11:50:41,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:41,825 INFO L93 Difference]: Finished difference Result 3726 states and 13236 transitions. [2020-04-18 11:50:41,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-04-18 11:50:41,826 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 23 [2020-04-18 11:50:41,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:50:41,833 INFO L225 Difference]: With dead ends: 3726 [2020-04-18 11:50:41,833 INFO L226 Difference]: Without dead ends: 3630 [2020-04-18 11:50:41,834 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=833, Invalid=3589, Unknown=0, NotChecked=0, Total=4422 [2020-04-18 11:50:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2020-04-18 11:50:41,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 2150. [2020-04-18 11:50:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2020-04-18 11:50:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 7745 transitions. [2020-04-18 11:50:41,886 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 7745 transitions. Word has length 23 [2020-04-18 11:50:41,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:50:41,886 INFO L479 AbstractCegarLoop]: Abstraction has 2150 states and 7745 transitions. [2020-04-18 11:50:41,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-04-18 11:50:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 7745 transitions. [2020-04-18 11:50:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:41,889 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:50:41,889 INFO L425 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] [2020-04-18 11:50:41,890 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:50:41,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:41,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1357008819, now seen corresponding path program 1 times [2020-04-18 11:50:41,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:50:41,890 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [22676495] [2020-04-18 11:50:41,891 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:41,895 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 186 transitions. [2020-04-18 11:50:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 11:50:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:41,897 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:50:41,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:41,898 INFO L82 PathProgramCache]: Analyzing trace with hash -354823029, now seen corresponding path program 2 times [2020-04-18 11:50:41,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:41,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430144507] [2020-04-18 11:50:41,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:41,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:41,918 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430144507] [2020-04-18 11:50:41,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:41,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:50:41,919 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:41,922 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:41,929 INFO L259 McrAutomatonBuilder]: Finished intersection with 37 states and 50 transitions. [2020-04-18 11:50:41,930 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:41,933 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:50:41,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:50:41,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:50:41,933 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 11:50:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:41,951 INFO L93 Difference]: Finished difference Result 110 states and 217 transitions. [2020-04-18 11:50:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 217 transitions. [2020-04-18 11:50:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:41,952 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:50:41,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:41,952 INFO L82 PathProgramCache]: Analyzing trace with hash -325895379, now seen corresponding path program 3 times [2020-04-18 11:50:41,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:41,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483478948] [2020-04-18 11:50:41,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:42,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483478948] [2020-04-18 11:50:42,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:42,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:42,005 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:42,008 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:42,013 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 52 transitions. [2020-04-18 11:50:42,014 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:42,047 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:50:42,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:42,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:50:42,048 INFO L87 Difference]: Start difference. First operand 110 states and 217 transitions. Second operand 7 states. [2020-04-18 11:50:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:42,171 INFO L93 Difference]: Finished difference Result 171 states and 326 transitions. [2020-04-18 11:50:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 326 transitions. [2020-04-18 11:50:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:42,171 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:50:42,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:42,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1434260131, now seen corresponding path program 4 times [2020-04-18 11:50:42,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:42,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881825960] [2020-04-18 11:50:42,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:42,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881825960] [2020-04-18 11:50:42,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:42,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:50:42,217 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:42,226 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:42,239 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 43 transitions. [2020-04-18 11:50:42,240 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:42,304 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:50:42,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:42,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-04-18 11:50:42,305 INFO L87 Difference]: Start difference. First operand 171 states and 326 transitions. Second operand 7 states. [2020-04-18 11:50:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:42,396 INFO L93 Difference]: Finished difference Result 180 states and 333 transitions. [2020-04-18 11:50:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 333 transitions. [2020-04-18 11:50:42,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:42,397 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:50:42,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:42,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1804883745, now seen corresponding path program 5 times [2020-04-18 11:50:42,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:42,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209564414] [2020-04-18 11:50:42,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:42,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209564414] [2020-04-18 11:50:42,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:42,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 11:50:42,519 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:42,522 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:42,528 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 52 transitions. [2020-04-18 11:50:42,528 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:42,686 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:50:42,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:50:42,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2020-04-18 11:50:42,687 INFO L87 Difference]: Start difference. First operand 180 states and 333 transitions. Second operand 9 states. [2020-04-18 11:50:43,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:43,158 INFO L93 Difference]: Finished difference Result 243 states and 443 transitions. [2020-04-18 11:50:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 443 transitions. [2020-04-18 11:50:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:43,159 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:50:43,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:43,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1357008819, now seen corresponding path program 6 times [2020-04-18 11:50:43,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:43,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051473044] [2020-04-18 11:50:43,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:43,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051473044] [2020-04-18 11:50:43,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:43,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 11:50:43,422 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:43,424 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:43,430 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 55 transitions. [2020-04-18 11:50:43,431 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:43,833 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 11:50:43,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 11:50:43,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1228, Unknown=0, NotChecked=0, Total=1406 [2020-04-18 11:50:43,834 INFO L87 Difference]: Start difference. First operand 243 states and 443 transitions. Second operand 11 states. [2020-04-18 11:50:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:44,399 INFO L93 Difference]: Finished difference Result 265 states and 473 transitions. [2020-04-18 11:50:44,399 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 473 transitions. [2020-04-18 11:50:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:44,400 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 11:50:44,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:44,400 INFO L82 PathProgramCache]: Analyzing trace with hash -840432879, now seen corresponding path program 7 times [2020-04-18 11:50:44,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:44,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521546216] [2020-04-18 11:50:44,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:44,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521546216] [2020-04-18 11:50:44,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:44,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 11:50:44,734 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:44,735 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:44,740 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2020-04-18 11:50:44,741 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:45,197 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:50:45,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:50:45,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2184, Unknown=0, NotChecked=0, Total=2450 [2020-04-18 11:50:45,198 INFO L87 Difference]: Start difference. First operand 265 states and 473 transitions. Second operand 13 states. [2020-04-18 11:50:46,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:46,159 INFO L93 Difference]: Finished difference Result 337 states and 600 transitions. [2020-04-18 11:50:46,160 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 600 transitions. [2020-04-18 11:50:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 11:50:46,160 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 11:50:46,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:46,161 INFO L82 PathProgramCache]: Analyzing trace with hash 567732367, now seen corresponding path program 8 times [2020-04-18 11:50:46,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:46,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567135460] [2020-04-18 11:50:46,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:46,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567135460] [2020-04-18 11:50:46,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:46,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 11:50:46,296 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:46,297 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:46,303 INFO L259 McrAutomatonBuilder]: Finished intersection with 41 states and 60 transitions. [2020-04-18 11:50:46,303 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:46,509 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 11:50:46,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 11:50:46,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=3188, Unknown=0, NotChecked=0, Total=3660 [2020-04-18 11:50:46,510 INFO L87 Difference]: Start difference. First operand 337 states and 600 transitions. Second operand 11 states. [2020-04-18 11:50:47,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:47,018 INFO L93 Difference]: Finished difference Result 403 states and 700 transitions. [2020-04-18 11:50:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 700 transitions. [2020-04-18 11:50:47,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:50:47,020 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [22676495] [2020-04-18 11:50:47,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:50:47,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-04-18 11:50:47,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [22676495] [2020-04-18 11:50:47,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-04-18 11:50:47,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:50:47,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-04-18 11:50:47,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=3599, Unknown=0, NotChecked=0, Total=4160 [2020-04-18 11:50:47,021 INFO L87 Difference]: Start difference. First operand 2150 states and 7745 transitions. Second operand 37 states. [2020-04-18 11:50:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:50,029 INFO L93 Difference]: Finished difference Result 3619 states and 12553 transitions. [2020-04-18 11:50:50,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:50:50,029 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 23 [2020-04-18 11:50:50,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:50:50,036 INFO L225 Difference]: With dead ends: 3619 [2020-04-18 11:50:50,037 INFO L226 Difference]: Without dead ends: 3445 [2020-04-18 11:50:50,037 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2020 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1134, Invalid=6348, Unknown=0, NotChecked=0, Total=7482 [2020-04-18 11:50:50,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2020-04-18 11:50:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 1824. [2020-04-18 11:50:50,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2020-04-18 11:50:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 6456 transitions. [2020-04-18 11:50:50,083 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 6456 transitions. Word has length 23 [2020-04-18 11:50:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:50:50,083 INFO L479 AbstractCegarLoop]: Abstraction has 1824 states and 6456 transitions. [2020-04-18 11:50:50,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-04-18 11:50:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 6456 transitions. [2020-04-18 11:50:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 11:50:50,086 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:50:50,086 INFO L425 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] [2020-04-18 11:50:50,086 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:50:50,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:50,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1309010247, now seen corresponding path program 1 times [2020-04-18 11:50:50,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:50:50,087 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1812599927] [2020-04-18 11:50:50,088 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:50,093 INFO L259 McrAutomatonBuilder]: Finished intersection with 75 states and 137 transitions. [2020-04-18 11:50:50,094 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2020-04-18 11:50:50,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 11:50:50,094 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:50:50,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:50,095 INFO L82 PathProgramCache]: Analyzing trace with hash 942904643, now seen corresponding path program 2 times [2020-04-18 11:50:50,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:50,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394324866] [2020-04-18 11:50:50,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:50,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394324866] [2020-04-18 11:50:50,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:50,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:50:50,124 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:50,127 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:50,134 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 45 transitions. [2020-04-18 11:50:50,134 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:50,142 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:50:50,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:50:50,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:50:50,143 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 3 states. [2020-04-18 11:50:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:50,163 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2020-04-18 11:50:50,164 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 141 transitions. [2020-04-18 11:50:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 11:50:50,164 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:50:50,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:50,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1309010247, now seen corresponding path program 3 times [2020-04-18 11:50:50,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:50,165 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862927086] [2020-04-18 11:50:50,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:50,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862927086] [2020-04-18 11:50:50,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:50,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:50,245 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:50,249 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:50,258 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 59 transitions. [2020-04-18 11:50:50,258 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:50,311 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 11:50:50,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:50,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:50:50,315 INFO L87 Difference]: Start difference. First operand 80 states and 141 transitions. Second operand 7 states. [2020-04-18 11:50:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:50,449 INFO L93 Difference]: Finished difference Result 117 states and 194 transitions. [2020-04-18 11:50:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 194 transitions. [2020-04-18 11:50:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 11:50:50,449 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:50:50,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:50,450 INFO L82 PathProgramCache]: Analyzing trace with hash -432979543, now seen corresponding path program 4 times [2020-04-18 11:50:50,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:50,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86354833] [2020-04-18 11:50:50,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:50,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86354833] [2020-04-18 11:50:50,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:50,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:50:50,542 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:50,546 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:50,555 INFO L259 McrAutomatonBuilder]: Finished intersection with 37 states and 48 transitions. [2020-04-18 11:50:50,555 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:50,715 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:50:50,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 11:50:50,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2020-04-18 11:50:50,716 INFO L87 Difference]: Start difference. First operand 117 states and 194 transitions. Second operand 8 states. [2020-04-18 11:50:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:51,170 INFO L93 Difference]: Finished difference Result 152 states and 245 transitions. [2020-04-18 11:50:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 245 transitions. [2020-04-18 11:50:51,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 11:50:51,170 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:50:51,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:51,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1308579191, now seen corresponding path program 5 times [2020-04-18 11:50:51,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:51,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992963390] [2020-04-18 11:50:51,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:51,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992963390] [2020-04-18 11:50:51,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:51,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 11:50:51,286 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:51,288 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:51,294 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 50 transitions. [2020-04-18 11:50:51,294 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:51,440 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:50:51,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:50:51,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2020-04-18 11:50:51,441 INFO L87 Difference]: Start difference. First operand 152 states and 245 transitions. Second operand 9 states. [2020-04-18 11:50:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:51,953 INFO L93 Difference]: Finished difference Result 184 states and 291 transitions. [2020-04-18 11:50:51,953 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 291 transitions. [2020-04-18 11:50:51,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 11:50:51,954 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:50:51,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:51,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1370549309, now seen corresponding path program 6 times [2020-04-18 11:50:51,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:51,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307772351] [2020-04-18 11:50:51,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:52,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:52,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307772351] [2020-04-18 11:50:52,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:52,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 11:50:52,084 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:52,086 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:52,094 INFO L259 McrAutomatonBuilder]: Finished intersection with 41 states and 58 transitions. [2020-04-18 11:50:52,094 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:52,300 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 7 times. [2020-04-18 11:50:52,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:50:52,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1457, Unknown=0, NotChecked=0, Total=1722 [2020-04-18 11:50:52,301 INFO L87 Difference]: Start difference. First operand 184 states and 291 transitions. Second operand 12 states. [2020-04-18 11:50:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:52,830 INFO L93 Difference]: Finished difference Result 205 states and 316 transitions. [2020-04-18 11:50:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 316 transitions. [2020-04-18 11:50:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 11:50:52,831 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 11:50:52,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:52,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1607134461, now seen corresponding path program 7 times [2020-04-18 11:50:52,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:52,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750939339] [2020-04-18 11:50:52,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:53,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750939339] [2020-04-18 11:50:53,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:53,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-04-18 11:50:53,101 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:53,103 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:53,109 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 38 transitions. [2020-04-18 11:50:53,109 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:53,511 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:50:53,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:50:53,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=2649, Unknown=0, NotChecked=0, Total=3080 [2020-04-18 11:50:53,513 INFO L87 Difference]: Start difference. First operand 205 states and 316 transitions. Second operand 13 states. [2020-04-18 11:50:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:54,388 INFO L93 Difference]: Finished difference Result 243 states and 363 transitions. [2020-04-18 11:50:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 363 transitions. [2020-04-18 11:50:54,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:50:54,389 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1812599927] [2020-04-18 11:50:54,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:50:54,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-04-18 11:50:54,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1812599927] [2020-04-18 11:50:54,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-04-18 11:50:54,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:50:54,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-04-18 11:50:54,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=3326, Unknown=0, NotChecked=0, Total=3906 [2020-04-18 11:50:54,391 INFO L87 Difference]: Start difference. First operand 1824 states and 6456 transitions. Second operand 33 states. [2020-04-18 11:50:56,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:56,675 INFO L93 Difference]: Finished difference Result 3130 states and 10239 transitions. [2020-04-18 11:50:56,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-04-18 11:50:56,675 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 24 [2020-04-18 11:50:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:50:56,682 INFO L225 Difference]: With dead ends: 3130 [2020-04-18 11:50:56,682 INFO L226 Difference]: Without dead ends: 2938 [2020-04-18 11:50:56,683 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2022 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=966, Invalid=5514, Unknown=0, NotChecked=0, Total=6480 [2020-04-18 11:50:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-04-18 11:50:56,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 2015. [2020-04-18 11:50:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2015 states. [2020-04-18 11:50:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 7088 transitions. [2020-04-18 11:50:56,727 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 7088 transitions. Word has length 24 [2020-04-18 11:50:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:50:56,728 INFO L479 AbstractCegarLoop]: Abstraction has 2015 states and 7088 transitions. [2020-04-18 11:50:56,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-04-18 11:50:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 7088 transitions. [2020-04-18 11:50:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 11:50:56,731 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:50:56,731 INFO L425 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] [2020-04-18 11:50:56,731 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:50:56,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:56,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1945194585, now seen corresponding path program 1 times [2020-04-18 11:50:56,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:50:56,732 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [516030591] [2020-04-18 11:50:56,733 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:56,739 INFO L259 McrAutomatonBuilder]: Finished intersection with 230 states and 636 transitions. [2020-04-18 11:50:56,740 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states. [2020-04-18 11:50:56,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 11:50:56,741 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:50:56,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:56,742 INFO L82 PathProgramCache]: Analyzing trace with hash -165212943, now seen corresponding path program 2 times [2020-04-18 11:50:56,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:56,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803645649] [2020-04-18 11:50:56,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:56,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803645649] [2020-04-18 11:50:56,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:56,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:50:56,764 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:56,767 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:56,773 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 52 transitions. [2020-04-18 11:50:56,773 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:56,779 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:50:56,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:50:56,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:50:56,779 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 3 states. [2020-04-18 11:50:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:56,801 INFO L93 Difference]: Finished difference Result 332 states and 865 transitions. [2020-04-18 11:50:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 865 transitions. [2020-04-18 11:50:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 11:50:56,802 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:50:56,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash -136285293, now seen corresponding path program 3 times [2020-04-18 11:50:56,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:56,803 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415687802] [2020-04-18 11:50:56,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:56,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:56,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415687802] [2020-04-18 11:50:56,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:56,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:50:56,863 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:56,865 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:56,872 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 54 transitions. [2020-04-18 11:50:56,872 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:56,907 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:50:56,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:56,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:50:56,907 INFO L87 Difference]: Start difference. First operand 332 states and 865 transitions. Second operand 7 states. [2020-04-18 11:50:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:57,046 INFO L93 Difference]: Finished difference Result 536 states and 1350 transitions. [2020-04-18 11:50:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1350 transitions. [2020-04-18 11:50:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 11:50:57,047 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:50:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:57,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2022445897, now seen corresponding path program 4 times [2020-04-18 11:50:57,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:57,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628182083] [2020-04-18 11:50:57,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:57,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628182083] [2020-04-18 11:50:57,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:57,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:50:57,100 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:57,102 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:57,108 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 45 transitions. [2020-04-18 11:50:57,108 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:57,182 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:50:57,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:50:57,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-04-18 11:50:57,183 INFO L87 Difference]: Start difference. First operand 536 states and 1350 transitions. Second operand 7 states. [2020-04-18 11:50:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:57,296 INFO L93 Difference]: Finished difference Result 585 states and 1425 transitions. [2020-04-18 11:50:57,297 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1425 transitions. [2020-04-18 11:50:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 11:50:57,298 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:50:57,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:57,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1216697979, now seen corresponding path program 5 times [2020-04-18 11:50:57,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:57,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409668298] [2020-04-18 11:50:57,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:57,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409668298] [2020-04-18 11:50:57,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:57,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 11:50:57,516 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:57,518 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:57,524 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 54 transitions. [2020-04-18 11:50:57,524 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:57,724 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:50:57,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:50:57,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2020-04-18 11:50:57,725 INFO L87 Difference]: Start difference. First operand 585 states and 1425 transitions. Second operand 10 states. [2020-04-18 11:50:58,323 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2020-04-18 11:50:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:50:58,754 INFO L93 Difference]: Finished difference Result 800 states and 1916 transitions. [2020-04-18 11:50:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1916 transitions. [2020-04-18 11:50:58,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 11:50:58,757 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:50:58,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:50:58,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1945194585, now seen corresponding path program 6 times [2020-04-18 11:50:58,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:50:58,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183469415] [2020-04-18 11:50:58,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:50:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:50:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:50:59,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183469415] [2020-04-18 11:50:59,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:50:59,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 11:50:59,100 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:50:59,105 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:50:59,117 INFO L259 McrAutomatonBuilder]: Finished intersection with 41 states and 57 transitions. [2020-04-18 11:50:59,117 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:50:59,544 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 7 times. [2020-04-18 11:50:59,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:50:59,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1586, Unknown=0, NotChecked=0, Total=1806 [2020-04-18 11:50:59,545 INFO L87 Difference]: Start difference. First operand 800 states and 1916 transitions. Second operand 12 states. [2020-04-18 11:51:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:00,344 INFO L93 Difference]: Finished difference Result 918 states and 2147 transitions. [2020-04-18 11:51:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 2147 transitions. [2020-04-18 11:51:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-04-18 11:51:00,347 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 11:51:00,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:00,347 INFO L82 PathProgramCache]: Analyzing trace with hash -229229463, now seen corresponding path program 7 times [2020-04-18 11:51:00,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:51:00,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638295171] [2020-04-18 11:51:00,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:51:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:51:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:51:00,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638295171] [2020-04-18 11:51:00,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:51:00,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-04-18 11:51:00,527 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:51:00,529 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:51:00,538 INFO L259 McrAutomatonBuilder]: Finished intersection with 43 states and 62 transitions. [2020-04-18 11:51:00,538 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:51:00,922 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 11:51:00,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:51:00,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2825, Unknown=0, NotChecked=0, Total=3192 [2020-04-18 11:51:00,923 INFO L87 Difference]: Start difference. First operand 918 states and 2147 transitions. Second operand 12 states. [2020-04-18 11:51:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:01,598 INFO L93 Difference]: Finished difference Result 918 states and 2147 transitions. [2020-04-18 11:51:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 2147 transitions. [2020-04-18 11:51:01,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:51:01,600 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [516030591] [2020-04-18 11:51:01,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:51:01,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-04-18 11:51:01,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [516030591] [2020-04-18 11:51:01,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-04-18 11:51:01,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:51:01,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-04-18 11:51:01,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=3543, Unknown=0, NotChecked=0, Total=4032 [2020-04-18 11:51:01,602 INFO L87 Difference]: Start difference. First operand 2015 states and 7088 transitions. Second operand 35 states. [2020-04-18 11:51:03,390 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2020-04-18 11:51:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:04,451 INFO L93 Difference]: Finished difference Result 2587 states and 8796 transitions. [2020-04-18 11:51:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-04-18 11:51:04,451 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 25 [2020-04-18 11:51:04,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:51:04,457 INFO L225 Difference]: With dead ends: 2587 [2020-04-18 11:51:04,457 INFO L226 Difference]: Without dead ends: 2564 [2020-04-18 11:51:04,458 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1240, Invalid=5900, Unknown=0, NotChecked=0, Total=7140 [2020-04-18 11:51:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2020-04-18 11:51:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1627. [2020-04-18 11:51:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1627 states. [2020-04-18 11:51:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 5611 transitions. [2020-04-18 11:51:04,483 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 5611 transitions. Word has length 25 [2020-04-18 11:51:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:51:04,483 INFO L479 AbstractCegarLoop]: Abstraction has 1627 states and 5611 transitions. [2020-04-18 11:51:04,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-04-18 11:51:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 5611 transitions. [2020-04-18 11:51:04,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:51:04,485 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:51:04,485 INFO L425 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] [2020-04-18 11:51:04,485 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:51:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:04,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1932498543, now seen corresponding path program 1 times [2020-04-18 11:51:04,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:51:04,486 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [402104212] [2020-04-18 11:51:04,487 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:51:04,492 INFO L259 McrAutomatonBuilder]: Finished intersection with 185 states and 459 transitions. [2020-04-18 11:51:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2020-04-18 11:51:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:51:04,494 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:51:04,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:04,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1769117283, now seen corresponding path program 2 times [2020-04-18 11:51:04,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:51:04,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611191260] [2020-04-18 11:51:04,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:51:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:51:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:51:04,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611191260] [2020-04-18 11:51:04,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:51:04,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:51:04,524 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:51:04,526 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:51:04,531 INFO L259 McrAutomatonBuilder]: Finished intersection with 37 states and 47 transitions. [2020-04-18 11:51:04,531 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:51:04,533 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:51:04,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:51:04,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:51:04,534 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 3 states. [2020-04-18 11:51:04,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:04,557 INFO L93 Difference]: Finished difference Result 239 states and 562 transitions. [2020-04-18 11:51:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 562 transitions. [2020-04-18 11:51:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:51:04,558 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:51:04,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:04,559 INFO L82 PathProgramCache]: Analyzing trace with hash 273935123, now seen corresponding path program 3 times [2020-04-18 11:51:04,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:51:04,559 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482534847] [2020-04-18 11:51:04,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:51:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:51:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:51:04,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482534847] [2020-04-18 11:51:04,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:51:04,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:51:04,609 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:51:04,611 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:51:04,618 INFO L259 McrAutomatonBuilder]: Finished intersection with 44 states and 61 transitions. [2020-04-18 11:51:04,619 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:51:04,651 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 11:51:04,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:51:04,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:51:04,652 INFO L87 Difference]: Start difference. First operand 239 states and 562 transitions. Second operand 7 states. [2020-04-18 11:51:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:04,790 INFO L93 Difference]: Finished difference Result 368 states and 822 transitions. [2020-04-18 11:51:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 822 transitions. [2020-04-18 11:51:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:51:04,791 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:51:04,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:04,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1932498543, now seen corresponding path program 4 times [2020-04-18 11:51:04,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:51:04,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319924523] [2020-04-18 11:51:04,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:51:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:51:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:51:04,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319924523] [2020-04-18 11:51:04,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:51:04,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-04-18 11:51:04,962 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:51:04,964 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:51:04,970 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 52 transitions. [2020-04-18 11:51:04,970 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:51:05,147 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:51:05,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:51:05,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2020-04-18 11:51:05,148 INFO L87 Difference]: Start difference. First operand 368 states and 822 transitions. Second operand 10 states. [2020-04-18 11:51:06,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:06,093 INFO L93 Difference]: Finished difference Result 488 states and 1061 transitions. [2020-04-18 11:51:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1061 transitions. [2020-04-18 11:51:06,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:51:06,094 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:51:06,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:06,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1870528425, now seen corresponding path program 5 times [2020-04-18 11:51:06,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:51:06,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803596728] [2020-04-18 11:51:06,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:51:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:51:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:51:06,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803596728] [2020-04-18 11:51:06,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:51:06,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-04-18 11:51:06,307 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:51:06,310 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:51:06,317 INFO L259 McrAutomatonBuilder]: Finished intersection with 43 states and 60 transitions. [2020-04-18 11:51:06,317 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:51:06,603 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 8 times. [2020-04-18 11:51:06,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:51:06,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1240, Unknown=0, NotChecked=0, Total=1482 [2020-04-18 11:51:06,604 INFO L87 Difference]: Start difference. First operand 488 states and 1061 transitions. Second operand 13 states. [2020-04-18 11:51:07,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:07,187 INFO L93 Difference]: Finished difference Result 488 states and 1061 transitions. [2020-04-18 11:51:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1061 transitions. [2020-04-18 11:51:07,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:51:07,189 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [402104212] [2020-04-18 11:51:07,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:51:07,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-04-18 11:51:07,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [402104212] [2020-04-18 11:51:07,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-04-18 11:51:07,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:51:07,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-04-18 11:51:07,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=1622, Unknown=0, NotChecked=0, Total=1980 [2020-04-18 11:51:07,190 INFO L87 Difference]: Start difference. First operand 1627 states and 5611 transitions. Second operand 25 states. [2020-04-18 11:51:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:08,274 INFO L93 Difference]: Finished difference Result 1491 states and 5003 transitions. [2020-04-18 11:51:08,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-04-18 11:51:08,275 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2020-04-18 11:51:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:51:08,278 INFO L225 Difference]: With dead ends: 1491 [2020-04-18 11:51:08,278 INFO L226 Difference]: Without dead ends: 1447 [2020-04-18 11:51:08,279 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=729, Invalid=2463, Unknown=0, NotChecked=0, Total=3192 [2020-04-18 11:51:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-04-18 11:51:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 885. [2020-04-18 11:51:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-04-18 11:51:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-04-18 11:51:08,298 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-04-18 11:51:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:51:08,299 INFO L479 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-04-18 11:51:08,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-04-18 11:51:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-04-18 11:51:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 11:51:08,300 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:51:08,301 INFO L425 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] [2020-04-18 11:51:08,301 INFO L427 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:51:08,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash -416507732, now seen corresponding path program 1 times [2020-04-18 11:51:08,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:51:08,301 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1166737301] [2020-04-18 11:51:08,303 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:51:08,339 INFO L259 McrAutomatonBuilder]: Finished intersection with 743 states and 2496 transitions. [2020-04-18 11:51:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states. [2020-04-18 11:51:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 11:51:08,346 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:51:08,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash 415588464, now seen corresponding path program 2 times [2020-04-18 11:51:08,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:51:08,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222560367] [2020-04-18 11:51:08,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:51:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:51:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:51:08,372 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222560367] [2020-04-18 11:51:08,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:51:08,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:51:08,373 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:51:08,378 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:51:08,395 INFO L259 McrAutomatonBuilder]: Finished intersection with 76 states and 114 transitions. [2020-04-18 11:51:08,395 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:51:08,398 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:51:08,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:51:08,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:51:08,399 INFO L87 Difference]: Start difference. First operand 743 states. Second operand 3 states. [2020-04-18 11:51:08,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:08,432 INFO L93 Difference]: Finished difference Result 1132 states and 3708 transitions. [2020-04-18 11:51:08,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 3708 transitions. [2020-04-18 11:51:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 11:51:08,434 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:51:08,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:08,435 INFO L82 PathProgramCache]: Analyzing trace with hash -416507732, now seen corresponding path program 3 times [2020-04-18 11:51:08,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:51:08,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396987954] [2020-04-18 11:51:08,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:51:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:51:08,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:51:08,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396987954] [2020-04-18 11:51:08,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:51:08,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 11:51:08,515 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:51:08,521 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:51:08,566 INFO L259 McrAutomatonBuilder]: Finished intersection with 102 states and 189 transitions. [2020-04-18 11:51:08,566 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:51:08,632 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:51:08,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 11:51:08,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-04-18 11:51:08,633 INFO L87 Difference]: Start difference. First operand 1132 states and 3708 transitions. Second operand 8 states. [2020-04-18 11:51:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:08,833 INFO L93 Difference]: Finished difference Result 1132 states and 3708 transitions. [2020-04-18 11:51:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 3708 transitions. [2020-04-18 11:51:08,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:51:08,837 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1166737301] [2020-04-18 11:51:08,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:51:08,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-04-18 11:51:08,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1166737301] [2020-04-18 11:51:08,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-04-18 11:51:08,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:51:08,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:51:08,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-04-18 11:51:08,839 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 9 states. [2020-04-18 11:51:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:09,091 INFO L93 Difference]: Finished difference Result 991 states and 3416 transitions. [2020-04-18 11:51:09,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-04-18 11:51:09,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2020-04-18 11:51:09,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:51:09,094 INFO L225 Difference]: With dead ends: 991 [2020-04-18 11:51:09,094 INFO L226 Difference]: Without dead ends: 985 [2020-04-18 11:51:09,094 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2020-04-18 11:51:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2020-04-18 11:51:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 879. [2020-04-18 11:51:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2020-04-18 11:51:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2020-04-18 11:51:09,107 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2020-04-18 11:51:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:51:09,107 INFO L479 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2020-04-18 11:51:09,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-04-18 11:51:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2020-04-18 11:51:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 11:51:09,109 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:51:09,109 INFO L425 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] [2020-04-18 11:51:09,109 INFO L427 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:51:09,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:09,109 INFO L82 PathProgramCache]: Analyzing trace with hash 829092404, now seen corresponding path program 1 times [2020-04-18 11:51:09,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:51:09,109 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1225784054] [2020-04-18 11:51:09,111 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:51:09,137 INFO L259 McrAutomatonBuilder]: Finished intersection with 743 states and 2496 transitions. [2020-04-18 11:51:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states. [2020-04-18 11:51:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 11:51:09,142 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:51:09,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:09,142 INFO L82 PathProgramCache]: Analyzing trace with hash -535568566, now seen corresponding path program 2 times [2020-04-18 11:51:09,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:51:09,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818834094] [2020-04-18 11:51:09,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:51:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:51:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:51:09,168 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818834094] [2020-04-18 11:51:09,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:51:09,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:51:09,169 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:51:09,173 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:51:09,191 INFO L259 McrAutomatonBuilder]: Finished intersection with 73 states and 108 transitions. [2020-04-18 11:51:09,191 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:51:09,194 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:51:09,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:51:09,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:51:09,194 INFO L87 Difference]: Start difference. First operand 743 states. Second operand 3 states. [2020-04-18 11:51:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:09,227 INFO L93 Difference]: Finished difference Result 1120 states and 3678 transitions. [2020-04-18 11:51:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 3678 transitions. [2020-04-18 11:51:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 11:51:09,229 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:51:09,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:09,229 INFO L82 PathProgramCache]: Analyzing trace with hash 829092404, now seen corresponding path program 3 times [2020-04-18 11:51:09,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:51:09,230 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787548793] [2020-04-18 11:51:09,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:51:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:51:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:51:09,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787548793] [2020-04-18 11:51:09,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:51:09,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-04-18 11:51:09,308 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:51:09,315 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:51:09,349 INFO L259 McrAutomatonBuilder]: Finished intersection with 106 states and 197 transitions. [2020-04-18 11:51:09,349 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:51:09,386 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:51:09,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 11:51:09,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-04-18 11:51:09,386 INFO L87 Difference]: Start difference. First operand 1120 states and 3678 transitions. Second operand 8 states. [2020-04-18 11:51:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:09,525 INFO L93 Difference]: Finished difference Result 1120 states and 3678 transitions. [2020-04-18 11:51:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 3678 transitions. [2020-04-18 11:51:09,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:51:09,527 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1225784054] [2020-04-18 11:51:09,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:51:09,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-04-18 11:51:09,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1225784054] [2020-04-18 11:51:09,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-04-18 11:51:09,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:51:09,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:51:09,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-04-18 11:51:09,528 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 9 states. [2020-04-18 11:51:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:09,762 INFO L93 Difference]: Finished difference Result 985 states and 3393 transitions. [2020-04-18 11:51:09,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-04-18 11:51:09,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2020-04-18 11:51:09,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:51:09,765 INFO L225 Difference]: With dead ends: 985 [2020-04-18 11:51:09,765 INFO L226 Difference]: Without dead ends: 925 [2020-04-18 11:51:09,765 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2020-04-18 11:51:09,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2020-04-18 11:51:09,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 819. [2020-04-18 11:51:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-04-18 11:51:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2020-04-18 11:51:09,777 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2020-04-18 11:51:09,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:51:09,777 INFO L479 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2020-04-18 11:51:09,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-04-18 11:51:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2020-04-18 11:51:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 11:51:09,778 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:51:09,779 INFO L425 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] [2020-04-18 11:51:09,779 INFO L427 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-04-18 11:51:09,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:09,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1378914744, now seen corresponding path program 1 times [2020-04-18 11:51:09,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:51:09,780 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1477321673] [2020-04-18 11:51:09,781 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:51:09,807 INFO L259 McrAutomatonBuilder]: Finished intersection with 743 states and 2496 transitions. [2020-04-18 11:51:09,811 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states. [2020-04-18 11:51:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 11:51:09,812 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:51:09,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:09,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1950385618, now seen corresponding path program 2 times [2020-04-18 11:51:09,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:51:09,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641203513] [2020-04-18 11:51:09,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:51:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:51:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:51:09,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641203513] [2020-04-18 11:51:09,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:51:09,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:51:09,849 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:51:09,857 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:51:09,884 INFO L259 McrAutomatonBuilder]: Finished intersection with 79 states and 123 transitions. [2020-04-18 11:51:09,884 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:51:09,895 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:51:09,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:51:09,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:51:09,896 INFO L87 Difference]: Start difference. First operand 743 states. Second operand 3 states. [2020-04-18 11:51:09,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:51:09,929 INFO L93 Difference]: Finished difference Result 1168 states and 3822 transitions. [2020-04-18 11:51:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 3822 transitions. [2020-04-18 11:51:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 11:51:09,932 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:51:09,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:51:09,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1378914744, now seen corresponding path program 3 times [2020-04-18 11:51:09,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:51:09,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450020875] [2020-04-18 11:51:09,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:51:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:51:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:51:10,030 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 11:51:10,030 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 11:51:10,030 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 11:51:10,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 11:51:10 BasicIcfg [2020-04-18 11:51:10,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-18 11:51:10,145 INFO L168 Benchmark]: Toolchain (without parser) took 78595.94 ms. Allocated memory was 143.7 MB in the beginning and 1.0 GB in the end (delta: 887.6 MB). Free memory was 99.3 MB in the beginning and 324.2 MB in the end (delta: -224.9 MB). Peak memory consumption was 662.7 MB. Max. memory is 7.1 GB. [2020-04-18 11:51:10,146 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-04-18 11:51:10,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1000.08 ms. Allocated memory was 143.7 MB in the beginning and 202.9 MB in the end (delta: 59.2 MB). Free memory was 97.3 MB in the beginning and 122.3 MB in the end (delta: -25.0 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2020-04-18 11:51:10,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.23 ms. Allocated memory is still 202.9 MB. Free memory was 122.3 MB in the beginning and 119.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-04-18 11:51:10,147 INFO L168 Benchmark]: Boogie Preprocessor took 28.86 ms. Allocated memory is still 202.9 MB. Free memory was 119.5 MB in the beginning and 118.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-04-18 11:51:10,147 INFO L168 Benchmark]: RCFGBuilder took 524.50 ms. Allocated memory is still 202.9 MB. Free memory was 118.0 MB in the beginning and 91.0 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2020-04-18 11:51:10,147 INFO L168 Benchmark]: TraceAbstraction took 76948.69 ms. Allocated memory was 202.9 MB in the beginning and 1.0 GB in the end (delta: 828.4 MB). Free memory was 91.0 MB in the beginning and 324.2 MB in the end (delta: -233.2 MB). Peak memory consumption was 595.2 MB. Max. memory is 7.1 GB. [2020-04-18 11:51:10,149 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1000.08 ms. Allocated memory was 143.7 MB in the beginning and 202.9 MB in the end (delta: 59.2 MB). Free memory was 97.3 MB in the beginning and 122.3 MB in the end (delta: -25.0 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.23 ms. Allocated memory is still 202.9 MB. Free memory was 122.3 MB in the beginning and 119.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.86 ms. Allocated memory is still 202.9 MB. Free memory was 119.5 MB in the beginning and 118.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 524.50 ms. Allocated memory is still 202.9 MB. Free memory was 118.0 MB in the beginning and 91.0 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76948.69 ms. Allocated memory was 202.9 MB in the beginning and 1.0 GB in the end (delta: 828.4 MB). Free memory was 91.0 MB in the beginning and 324.2 MB in the end (delta: -233.2 MB). Peak memory consumption was 595.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.3s, 172 ProgramPointsBefore, 101 ProgramPointsAfterwards, 243 TransitionsBefore, 173 TransitionsAfterwards, 4038 CoEnabledTransitionPairs, 6 FixpointIterations, 23 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 1506 VarBasedMoverChecksPositive, 9 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2242 CheckedPairsTotal, 75 TotalNumberOfCompositions - CounterExampleResult [Line: 1088]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1089] 0 char *v; [L1122] 0 pthread_t t; [L1123] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1107] 1 pthread_t t1, t2, t3, t4, t5; [L1108] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={0:0}] [L1109] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={0:0}] [L1124] 0 \read(t) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={0:0}] [L1092] 2 v = malloc(sizeof(char)) [L1093] 2 return 0; [L1109] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={6:0}] [L1110] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={6:0}] [L1097] 3 v[0] = 'X' [L1098] 3 return 0; [L1111] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={6:0}] [L1112] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={6:0}] [L1113] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={6:0}] [L1114] 1 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={6:0}] [L1114] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={6:0}] [L1115] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={6:0}] [L1097] 6 v[0] = 'X' [L1098] 6 return 0; [L1097] 5 v[0] = 'X' [L1098] 5 return 0; [L1102] 4 v[0] = 'Y' [L1103] 4 return 0; [L1115] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={6:0}] [L1116] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={6:0}] [L1116] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={6:0}] [L1117] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={6:0}] [L1117] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={12:0}, t2={13:0}, t3={8:0}, t4={10:0}, t5={11:0}, v={6:0}] [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1124] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] [L1125] 0 v[0] [L1088] COND TRUE 0 !expression [L1088] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 76.5s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 27.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 2133 SDtfs, 11206 SDslu, 15603 SDs, 0 SdLazy, 11571 SolverSat, 1334 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2525 GetRequests, 1676 SyntacticMatches, 1 SemanticMatches, 848 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13317 ImplicationChecksByTransitivity, 34.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4116occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 20314 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...