/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-nondet/nondet-loop-bound-variant-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 15:58:54,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 15:58:54,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 15:58:54,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 15:58:54,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 15:58:54,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 15:58:54,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 15:58:54,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 15:58:54,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 15:58:54,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 15:58:54,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 15:58:54,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 15:58:54,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 15:58:54,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 15:58:54,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 15:58:54,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 15:58:54,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 15:58:54,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 15:58:54,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 15:58:54,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 15:58:54,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 15:58:54,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 15:58:54,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 15:58:54,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 15:58:54,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 15:58:54,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 15:58:54,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 15:58:54,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 15:58:54,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 15:58:54,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 15:58:54,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 15:58:54,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 15:58:54,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 15:58:54,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 15:58:55,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 15:58:55,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 15:58:55,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 15:58:55,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 15:58:55,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 15:58:55,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 15:58:55,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 15:58:55,003 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 15:58:55,021 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 15:58:55,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 15:58:55,024 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 15:58:55,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 15:58:55,025 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 15:58:55,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 15:58:55,025 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 15:58:55,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 15:58:55,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 15:58:55,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 15:58:55,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 15:58:55,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 15:58:55,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 15:58:55,028 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 15:58:55,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 15:58:55,028 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 15:58:55,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 15:58:55,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 15:58:55,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 15:58:55,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 15:58:55,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 15:58:55,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 15:58:55,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 15:58:55,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 15:58:55,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 15:58:55,030 INFO L138 SettingsManager]: * Trace refinement strategy=MCR [2020-04-18 15:58:55,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 15:58:55,031 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-04-18 15:58:55,031 INFO L138 SettingsManager]: * Trace refinement strategy used in MCR=CAMEL [2020-04-18 15:58:55,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 15:58:55,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 15:58:55,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 15:58:55,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 15:58:55,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 15:58:55,325 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 15:58:55,326 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 15:58:55,327 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-2.i [2020-04-18 15:58:55,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce63ff439/6f943e91a1dd44ed853a3e59c770a70b/FLAG187d4d3ee [2020-04-18 15:58:55,969 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 15:58:55,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-2.i [2020-04-18 15:58:55,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce63ff439/6f943e91a1dd44ed853a3e59c770a70b/FLAG187d4d3ee [2020-04-18 15:58:56,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce63ff439/6f943e91a1dd44ed853a3e59c770a70b [2020-04-18 15:58:56,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 15:58:56,253 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 15:58:56,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 15:58:56,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 15:58:56,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 15:58:56,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:58:56" (1/1) ... [2020-04-18 15:58:56,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1179410f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:56, skipping insertion in model container [2020-04-18 15:58:56,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 03:58:56" (1/1) ... [2020-04-18 15:58:56,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 15:58:56,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 15:58:56,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 15:58:56,865 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 15:58:56,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 15:58:57,013 INFO L208 MainTranslator]: Completed translation [2020-04-18 15:58:57,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:57 WrapperNode [2020-04-18 15:58:57,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 15:58:57,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 15:58:57,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 15:58:57,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 15:58:57,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:57" (1/1) ... [2020-04-18 15:58:57,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:57" (1/1) ... [2020-04-18 15:58:57,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 15:58:57,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 15:58:57,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 15:58:57,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 15:58:57,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:57" (1/1) ... [2020-04-18 15:58:57,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:57" (1/1) ... [2020-04-18 15:58:57,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:57" (1/1) ... [2020-04-18 15:58:57,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:57" (1/1) ... [2020-04-18 15:58:57,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:57" (1/1) ... [2020-04-18 15:58:57,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:57" (1/1) ... [2020-04-18 15:58:57,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:57" (1/1) ... [2020-04-18 15:58:57,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 15:58:57,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 15:58:57,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 15:58:57,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 15:58:57,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:57" (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 15:58:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-04-18 15:58:57,173 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-04-18 15:58:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-04-18 15:58:57,173 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-04-18 15:58:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 15:58:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-04-18 15:58:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 15:58:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 15:58:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-04-18 15:58:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 15:58:57,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 15:58:57,176 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 15:58:57,589 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 15:58:57,589 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-04-18 15:58:57,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:58:57 BoogieIcfgContainer [2020-04-18 15:58:57,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 15:58:57,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 15:58:57,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 15:58:57,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 15:58:57,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 03:58:56" (1/3) ... [2020-04-18 15:58:57,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522b9420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:58:57, skipping insertion in model container [2020-04-18 15:58:57,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 03:58:57" (2/3) ... [2020-04-18 15:58:57,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522b9420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 03:58:57, skipping insertion in model container [2020-04-18 15:58:57,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 03:58:57" (3/3) ... [2020-04-18 15:58:57,609 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-2.i [2020-04-18 15:58:57,620 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 15:58:57,620 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 15:58:57,629 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-04-18 15:58:57,630 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 15:58:57,674 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,675 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,675 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,675 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,676 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,677 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,677 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,677 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,678 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,678 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,678 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,678 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,679 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,679 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,679 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,680 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,680 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,681 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,681 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,682 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,682 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,683 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,684 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,684 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,684 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,685 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,685 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,685 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,686 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,686 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,686 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,694 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,694 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,694 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,694 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,694 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,695 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,695 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,696 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,696 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,697 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,702 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:58:57,718 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-04-18 15:58:57,736 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 15:58:57,736 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 15:58:57,736 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 15:58:57,736 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 15:58:57,736 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 15:58:57,736 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 15:58:57,737 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 15:58:57,737 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 15:58:57,751 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 76 transitions, 162 flow [2020-04-18 15:58:57,753 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 77 places, 76 transitions, 162 flow [2020-04-18 15:58:57,805 INFO L129 PetriNetUnfolder]: 6/86 cut-off events. [2020-04-18 15:58:57,805 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-04-18 15:58:57,814 INFO L80 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 86 events. 6/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2020-04-18 15:58:57,818 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 77 places, 76 transitions, 162 flow [2020-04-18 15:58:57,844 INFO L129 PetriNetUnfolder]: 6/86 cut-off events. [2020-04-18 15:58:57,844 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-04-18 15:58:57,845 INFO L80 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 86 events. 6/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2020-04-18 15:58:57,847 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1242 [2020-04-18 15:58:57,849 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 15:58:59,707 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2020-04-18 15:59:00,244 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-04-18 15:59:00,689 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 15:59:00,843 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 15:59:00,847 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1089 [2020-04-18 15:59:00,847 INFO L214 etLargeBlockEncoding]: Total number of compositions: 77 [2020-04-18 15:59:00,851 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-04-18 15:59:00,861 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-04-18 15:59:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-04-18 15:59:00,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:59:00,867 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:00,868 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 15:59:00,869 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:59:00,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:00,875 INFO L82 PathProgramCache]: Analyzing trace with hash 313215, now seen corresponding path program 1 times [2020-04-18 15:59:00,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:00,883 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1717441700] [2020-04-18 15:59:00,898 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:00,910 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:59:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 15:59:00,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:59:00,912 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:00,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:00,913 INFO L82 PathProgramCache]: Analyzing trace with hash 313215, now seen corresponding path program 2 times [2020-04-18 15:59:00,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:00,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493196670] [2020-04-18 15:59:00,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:01,111 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 15:59:01,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493196670] [2020-04-18 15:59:01,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:01,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 15:59:01,114 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:01,115 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:01,117 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:59:01,117 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:01,130 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:01,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:01,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:01,137 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 15:59:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:01,150 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 15:59:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 15:59:01,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:01,152 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1717441700] [2020-04-18 15:59:01,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:01,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 15:59:01,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1717441700] [2020-04-18 15:59:01,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 15:59:01,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:01,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:01,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:01,161 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-04-18 15:59:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:01,192 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-04-18 15:59:01,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 15:59:01,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 15:59:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:01,219 INFO L225 Difference]: With dead ends: 35 [2020-04-18 15:59:01,219 INFO L226 Difference]: Without dead ends: 31 [2020-04-18 15:59:01,220 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 15:59:01,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-04-18 15:59:01,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-04-18 15:59:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-04-18 15:59:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-04-18 15:59:01,270 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-04-18 15:59:01,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:01,270 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-04-18 15:59:01,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 15:59:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-04-18 15:59:01,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 15:59:01,271 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:01,271 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:01,272 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:59:01,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:01,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1465583995, now seen corresponding path program 1 times [2020-04-18 15:59:01,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:01,273 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [271686767] [2020-04-18 15:59:01,276 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:01,280 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 15 transitions. [2020-04-18 15:59:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 15:59:01,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 15:59:01,281 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:01,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:01,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1465583485, now seen corresponding path program 2 times [2020-04-18 15:59:01,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:01,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075555435] [2020-04-18 15:59:01,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:01,368 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 15:59:01,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075555435] [2020-04-18 15:59:01,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:01,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:01,370 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:01,371 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:01,374 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 13 transitions. [2020-04-18 15:59:01,374 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:01,411 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:59:01,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:01,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:59:01,412 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 5 states. [2020-04-18 15:59:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:01,429 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-04-18 15:59:01,430 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-04-18 15:59:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 15:59:01,430 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:01,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:01,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1465583995, now seen corresponding path program 3 times [2020-04-18 15:59:01,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:01,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824520356] [2020-04-18 15:59:01,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:01,549 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 15:59:01,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824520356] [2020-04-18 15:59:01,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:01,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:01,551 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:01,551 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:01,553 INFO L259 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-04-18 15:59:01,554 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:01,566 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:01,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 15:59:01,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 15:59:01,567 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2020-04-18 15:59:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:01,576 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-04-18 15:59:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-04-18 15:59:01,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:01,577 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [271686767] [2020-04-18 15:59:01,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:01,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 15:59:01,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [271686767] [2020-04-18 15:59:01,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 15:59:01,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:01,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:59:01,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 15:59:01,580 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 6 states. [2020-04-18 15:59:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:01,646 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-04-18 15:59:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:59:01,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-04-18 15:59:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:01,648 INFO L225 Difference]: With dead ends: 26 [2020-04-18 15:59:01,648 INFO L226 Difference]: Without dead ends: 24 [2020-04-18 15:59:01,650 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-04-18 15:59:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-04-18 15:59:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-04-18 15:59:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-04-18 15:59:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-04-18 15:59:01,654 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-04-18 15:59:01,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:01,655 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-04-18 15:59:01,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 15:59:01,655 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-04-18 15:59:01,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 15:59:01,656 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:01,656 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:01,656 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:59:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:01,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1811562961, now seen corresponding path program 1 times [2020-04-18 15:59:01,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:01,657 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1748923073] [2020-04-18 15:59:01,657 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:01,658 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 15:59:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 15:59:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 15:59:01,659 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:01,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:01,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1811562961, now seen corresponding path program 2 times [2020-04-18 15:59:01,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:01,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062234419] [2020-04-18 15:59:01,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:59:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:59:01,730 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 15:59:01,730 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 15:59:01,730 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 15:59:01,731 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 15:59:01,731 WARN L363 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 15:59:01,732 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-04-18 15:59:01,741 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,741 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,741 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,742 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,742 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,742 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,742 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,742 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,742 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,743 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,743 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,743 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,743 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,743 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,743 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,744 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,744 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,744 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,744 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,744 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,745 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,745 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,745 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,745 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,745 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,745 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,746 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,746 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,746 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,746 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,746 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,746 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,747 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,747 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,747 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,747 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,747 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,747 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,748 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,748 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,748 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,748 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,749 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,749 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,749 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,749 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,750 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,750 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,750 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,750 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,750 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,750 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,751 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,751 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,751 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,751 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,752 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,752 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,752 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,752 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,752 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,752 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,753 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,753 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,753 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,753 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,754 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,754 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,754 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,754 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,754 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,754 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,756 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,756 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,757 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,757 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,757 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,757 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,757 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,757 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,758 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,758 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,759 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,760 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,760 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,760 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,760 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,760 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,762 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,762 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,762 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,762 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,762 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,763 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:01,764 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-04-18 15:59:01,765 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 15:59:01,765 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 15:59:01,765 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 15:59:01,765 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 15:59:01,765 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 15:59:01,765 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 15:59:01,765 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 15:59:01,765 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 15:59:01,768 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 105 transitions, 234 flow [2020-04-18 15:59:01,768 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 234 flow [2020-04-18 15:59:01,794 INFO L129 PetriNetUnfolder]: 9/120 cut-off events. [2020-04-18 15:59:01,795 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-04-18 15:59:01,797 INFO L80 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 120 events. 9/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 226 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 129. Up to 6 conditions per place. [2020-04-18 15:59:01,801 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 234 flow [2020-04-18 15:59:01,823 INFO L129 PetriNetUnfolder]: 9/120 cut-off events. [2020-04-18 15:59:01,826 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-04-18 15:59:01,828 INFO L80 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 120 events. 9/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 226 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 129. Up to 6 conditions per place. [2020-04-18 15:59:01,835 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2844 [2020-04-18 15:59:01,837 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 15:59:03,631 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-04-18 15:59:04,326 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 15:59:04,453 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 15:59:04,461 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3611 [2020-04-18 15:59:04,461 INFO L214 etLargeBlockEncoding]: Total number of compositions: 94 [2020-04-18 15:59:04,461 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 28 transitions, 80 flow [2020-04-18 15:59:04,492 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 632 states. [2020-04-18 15:59:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states. [2020-04-18 15:59:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:59:04,493 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:04,493 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 15:59:04,494 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:59:04,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:04,494 INFO L82 PathProgramCache]: Analyzing trace with hash 544994, now seen corresponding path program 1 times [2020-04-18 15:59:04,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:04,495 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [282068941] [2020-04-18 15:59:04,495 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:04,496 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:59:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 15:59:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:59:04,496 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:04,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:04,497 INFO L82 PathProgramCache]: Analyzing trace with hash 544994, now seen corresponding path program 2 times [2020-04-18 15:59:04,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:04,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243647199] [2020-04-18 15:59:04,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:04,532 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 15:59:04,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243647199] [2020-04-18 15:59:04,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:04,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 15:59:04,534 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:04,534 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:04,535 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:59:04,535 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:04,538 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:04,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:04,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:04,539 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 15:59:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:04,539 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 15:59:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 15:59:04,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:04,540 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [282068941] [2020-04-18 15:59:04,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:04,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 15:59:04,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [282068941] [2020-04-18 15:59:04,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 15:59:04,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:04,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:04,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:04,541 INFO L87 Difference]: Start difference. First operand 632 states. Second operand 3 states. [2020-04-18 15:59:04,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:04,610 INFO L93 Difference]: Finished difference Result 748 states and 2357 transitions. [2020-04-18 15:59:04,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 15:59:04,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 15:59:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:04,635 INFO L225 Difference]: With dead ends: 748 [2020-04-18 15:59:04,635 INFO L226 Difference]: Without dead ends: 691 [2020-04-18 15:59:04,635 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 15:59:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2020-04-18 15:59:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 612. [2020-04-18 15:59:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-04-18 15:59:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1968 transitions. [2020-04-18 15:59:04,721 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1968 transitions. Word has length 3 [2020-04-18 15:59:04,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:04,721 INFO L479 AbstractCegarLoop]: Abstraction has 612 states and 1968 transitions. [2020-04-18 15:59:04,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 15:59:04,721 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1968 transitions. [2020-04-18 15:59:04,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:59:04,722 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:04,722 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:04,722 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:59:04,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:04,723 INFO L82 PathProgramCache]: Analyzing trace with hash 625478199, now seen corresponding path program 1 times [2020-04-18 15:59:04,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:04,723 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [848847635] [2020-04-18 15:59:04,724 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:04,724 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 15:59:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 15:59:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:59:04,725 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:04,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:04,726 INFO L82 PathProgramCache]: Analyzing trace with hash 625478199, now seen corresponding path program 2 times [2020-04-18 15:59:04,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:04,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430045581] [2020-04-18 15:59:04,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:04,783 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 15:59:04,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430045581] [2020-04-18 15:59:04,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:04,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:04,784 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:04,785 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:04,786 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 15:59:04,786 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:04,801 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:04,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:04,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:59:04,802 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2020-04-18 15:59:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:04,830 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-04-18 15:59:04,830 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2020-04-18 15:59:04,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:04,831 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [848847635] [2020-04-18 15:59:04,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:04,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:59:04,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [848847635] [2020-04-18 15:59:04,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:59:04,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:04,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:04,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:04,832 INFO L87 Difference]: Start difference. First operand 612 states and 1968 transitions. Second operand 5 states. [2020-04-18 15:59:04,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:04,951 INFO L93 Difference]: Finished difference Result 900 states and 2708 transitions. [2020-04-18 15:59:04,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:59:04,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 15:59:04,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:04,959 INFO L225 Difference]: With dead ends: 900 [2020-04-18 15:59:04,959 INFO L226 Difference]: Without dead ends: 880 [2020-04-18 15:59:04,960 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2020-04-18 15:59:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 563. [2020-04-18 15:59:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2020-04-18 15:59:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1857 transitions. [2020-04-18 15:59:04,995 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1857 transitions. Word has length 10 [2020-04-18 15:59:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:04,996 INFO L479 AbstractCegarLoop]: Abstraction has 563 states and 1857 transitions. [2020-04-18 15:59:04,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 15:59:04,996 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1857 transitions. [2020-04-18 15:59:04,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:59:04,999 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:04,999 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:04,999 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:59:04,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:04,999 INFO L82 PathProgramCache]: Analyzing trace with hash -696224660, now seen corresponding path program 1 times [2020-04-18 15:59:05,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:05,000 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [140837028] [2020-04-18 15:59:05,000 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:05,001 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 15:59:05,001 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 15:59:05,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:59:05,002 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:05,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:05,002 INFO L82 PathProgramCache]: Analyzing trace with hash -696224660, now seen corresponding path program 2 times [2020-04-18 15:59:05,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:05,003 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686504135] [2020-04-18 15:59:05,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:59:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:59:05,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 15:59:05,062 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 15:59:05,062 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 15:59:05,062 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 15:59:05,063 WARN L363 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 15:59:05,064 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-04-18 15:59:05,079 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,079 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,079 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,079 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,080 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,080 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,080 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,080 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,080 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,080 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,080 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,080 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,081 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,081 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,081 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,081 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,081 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,081 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,081 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,082 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,082 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,082 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,082 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,082 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,082 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,082 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,083 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,083 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,083 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,083 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,083 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,083 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,084 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,084 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,084 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,084 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,084 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,084 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,085 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,085 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,085 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,085 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,085 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,086 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,086 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,086 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,086 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,086 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,086 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,087 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,087 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,087 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,087 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,087 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,087 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,087 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,088 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,088 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,088 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,088 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,088 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,088 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,089 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,089 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,089 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,089 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,089 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,090 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,090 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,090 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,090 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,090 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,090 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,091 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,091 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,091 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,091 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,091 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,091 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,092 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,092 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,092 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,092 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,092 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,092 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,093 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,093 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,093 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,093 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,093 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,093 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,094 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,094 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,094 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,094 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,095 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,095 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,095 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,095 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,095 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,095 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,095 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,096 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,097 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,097 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,098 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,098 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,098 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,098 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,098 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,098 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,099 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,099 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,100 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,100 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,100 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,101 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,101 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,101 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,101 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,101 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,101 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,102 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,103 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,103 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,103 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,103 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,103 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,104 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,105 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,106 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,106 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,106 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,106 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,106 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,108 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,108 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,108 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,108 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,108 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,108 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:05,110 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-04-18 15:59:05,110 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 15:59:05,110 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 15:59:05,110 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 15:59:05,110 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 15:59:05,110 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 15:59:05,110 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 15:59:05,111 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 15:59:05,111 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 15:59:05,112 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 134 transitions, 310 flow [2020-04-18 15:59:05,113 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 310 flow [2020-04-18 15:59:05,136 INFO L129 PetriNetUnfolder]: 12/154 cut-off events. [2020-04-18 15:59:05,136 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-04-18 15:59:05,138 INFO L80 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 154 events. 12/154 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 326 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2020-04-18 15:59:05,145 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 310 flow [2020-04-18 15:59:05,163 INFO L129 PetriNetUnfolder]: 12/154 cut-off events. [2020-04-18 15:59:05,164 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-04-18 15:59:05,165 INFO L80 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 154 events. 12/154 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 326 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2020-04-18 15:59:05,171 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5130 [2020-04-18 15:59:05,172 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 15:59:07,645 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2020-04-18 15:59:08,449 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 15:59:08,592 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 15:59:08,603 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7576 [2020-04-18 15:59:08,604 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2020-04-18 15:59:08,604 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 38 transitions, 118 flow [2020-04-18 15:59:08,858 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3782 states. [2020-04-18 15:59:08,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states. [2020-04-18 15:59:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:59:08,859 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:08,859 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 15:59:08,859 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:59:08,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:08,860 INFO L82 PathProgramCache]: Analyzing trace with hash 833041, now seen corresponding path program 1 times [2020-04-18 15:59:08,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:08,860 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2099233087] [2020-04-18 15:59:08,861 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:08,861 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:59:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 15:59:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:59:08,862 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:08,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:08,862 INFO L82 PathProgramCache]: Analyzing trace with hash 833041, now seen corresponding path program 2 times [2020-04-18 15:59:08,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:08,862 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090978382] [2020-04-18 15:59:08,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:08,926 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 15:59:08,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090978382] [2020-04-18 15:59:08,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:08,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 15:59:08,927 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:08,927 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:08,928 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:59:08,928 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:08,933 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:08,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:08,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:08,934 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 15:59:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:08,934 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 15:59:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 15:59:08,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:08,935 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2099233087] [2020-04-18 15:59:08,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:08,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 15:59:08,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2099233087] [2020-04-18 15:59:08,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 15:59:08,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:08,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:08,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:08,936 INFO L87 Difference]: Start difference. First operand 3782 states. Second operand 3 states. [2020-04-18 15:59:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:09,068 INFO L93 Difference]: Finished difference Result 4669 states and 19397 transitions. [2020-04-18 15:59:09,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 15:59:09,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 15:59:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:09,111 INFO L225 Difference]: With dead ends: 4669 [2020-04-18 15:59:09,111 INFO L226 Difference]: Without dead ends: 4342 [2020-04-18 15:59:09,112 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 15:59:09,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2020-04-18 15:59:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 3858. [2020-04-18 15:59:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3858 states. [2020-04-18 15:59:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 16290 transitions. [2020-04-18 15:59:09,314 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 16290 transitions. Word has length 3 [2020-04-18 15:59:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:09,315 INFO L479 AbstractCegarLoop]: Abstraction has 3858 states and 16290 transitions. [2020-04-18 15:59:09,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 15:59:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 16290 transitions. [2020-04-18 15:59:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:59:09,316 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:09,316 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:09,316 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:59:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:09,316 INFO L82 PathProgramCache]: Analyzing trace with hash -642397451, now seen corresponding path program 1 times [2020-04-18 15:59:09,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:09,317 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1694150275] [2020-04-18 15:59:09,317 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:09,318 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 15:59:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 15:59:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:59:09,319 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:09,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash -887292407, now seen corresponding path program 2 times [2020-04-18 15:59:09,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:09,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425538828] [2020-04-18 15:59:09,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:09,351 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 15:59:09,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425538828] [2020-04-18 15:59:09,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:09,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:09,352 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:09,354 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:09,355 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-04-18 15:59:09,356 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:09,362 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:09,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:09,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:09,362 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 15:59:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:09,369 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 15:59:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 15:59:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:59:09,370 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:09,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:09,370 INFO L82 PathProgramCache]: Analyzing trace with hash -642397451, now seen corresponding path program 3 times [2020-04-18 15:59:09,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:09,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198326808] [2020-04-18 15:59:09,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:09,441 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 15:59:09,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198326808] [2020-04-18 15:59:09,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:09,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:09,444 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:09,445 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:09,446 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 15:59:09,446 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:09,459 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:09,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:09,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:59:09,459 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2020-04-18 15:59:09,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:09,491 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 15:59:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 15:59:09,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:09,492 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1694150275] [2020-04-18 15:59:09,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:09,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:59:09,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1694150275] [2020-04-18 15:59:09,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:59:09,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:09,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:09,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:09,494 INFO L87 Difference]: Start difference. First operand 3858 states and 16290 transitions. Second operand 5 states. [2020-04-18 15:59:09,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:09,647 INFO L93 Difference]: Finished difference Result 6408 states and 25485 transitions. [2020-04-18 15:59:09,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:59:09,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 15:59:09,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:09,735 INFO L225 Difference]: With dead ends: 6408 [2020-04-18 15:59:09,735 INFO L226 Difference]: Without dead ends: 6352 [2020-04-18 15:59:09,736 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6352 states. [2020-04-18 15:59:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6352 to 3890. [2020-04-18 15:59:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3890 states. [2020-04-18 15:59:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3890 states to 3890 states and 16721 transitions. [2020-04-18 15:59:09,953 INFO L78 Accepts]: Start accepts. Automaton has 3890 states and 16721 transitions. Word has length 10 [2020-04-18 15:59:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:09,954 INFO L479 AbstractCegarLoop]: Abstraction has 3890 states and 16721 transitions. [2020-04-18 15:59:09,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 15:59:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states and 16721 transitions. [2020-04-18 15:59:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:59:09,956 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:09,956 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:09,956 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:59:09,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:09,957 INFO L82 PathProgramCache]: Analyzing trace with hash -834312959, now seen corresponding path program 1 times [2020-04-18 15:59:09,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:09,959 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [836424013] [2020-04-18 15:59:09,960 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:09,961 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2020-04-18 15:59:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-04-18 15:59:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:59:09,962 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:09,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:09,963 INFO L82 PathProgramCache]: Analyzing trace with hash 291634045, now seen corresponding path program 2 times [2020-04-18 15:59:09,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:09,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907612523] [2020-04-18 15:59:09,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:09,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907612523] [2020-04-18 15:59:09,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:09,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:10,000 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:10,001 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:10,006 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2020-04-18 15:59:10,007 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:10,013 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:10,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:10,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:10,014 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-04-18 15:59:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:10,019 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 15:59:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 15:59:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:59:10,020 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:10,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:10,020 INFO L82 PathProgramCache]: Analyzing trace with hash -834312959, now seen corresponding path program 3 times [2020-04-18 15:59:10,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:10,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394109130] [2020-04-18 15:59:10,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:10,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394109130] [2020-04-18 15:59:10,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:10,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:10,172 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:10,173 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:10,176 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 15:59:10,176 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:10,189 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:10,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:10,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:59:10,189 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-04-18 15:59:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:10,216 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 15:59:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 15:59:10,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:10,216 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [836424013] [2020-04-18 15:59:10,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:10,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:59:10,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [836424013] [2020-04-18 15:59:10,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:59:10,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:10,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:10,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:10,218 INFO L87 Difference]: Start difference. First operand 3890 states and 16721 transitions. Second operand 5 states. [2020-04-18 15:59:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:10,511 INFO L93 Difference]: Finished difference Result 6754 states and 26605 transitions. [2020-04-18 15:59:10,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:59:10,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-04-18 15:59:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:10,555 INFO L225 Difference]: With dead ends: 6754 [2020-04-18 15:59:10,555 INFO L226 Difference]: Without dead ends: 6698 [2020-04-18 15:59:10,556 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6698 states. [2020-04-18 15:59:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6698 to 3876. [2020-04-18 15:59:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3876 states. [2020-04-18 15:59:10,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 16342 transitions. [2020-04-18 15:59:10,786 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 16342 transitions. Word has length 14 [2020-04-18 15:59:10,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:10,786 INFO L479 AbstractCegarLoop]: Abstraction has 3876 states and 16342 transitions. [2020-04-18 15:59:10,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 15:59:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 16342 transitions. [2020-04-18 15:59:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 15:59:10,788 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:10,788 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:10,788 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:59:10,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:10,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1249108271, now seen corresponding path program 1 times [2020-04-18 15:59:10,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:10,790 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1509951981] [2020-04-18 15:59:10,791 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:10,794 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 150 transitions. [2020-04-18 15:59:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-04-18 15:59:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 15:59:10,796 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:10,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:10,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1668101585, now seen corresponding path program 2 times [2020-04-18 15:59:10,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:10,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385080907] [2020-04-18 15:59:10,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:10,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385080907] [2020-04-18 15:59:10,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:10,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:10,826 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:10,828 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:10,843 INFO L259 McrAutomatonBuilder]: Finished intersection with 52 states and 94 transitions. [2020-04-18 15:59:10,843 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:10,850 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:10,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:10,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:10,851 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-04-18 15:59:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:10,862 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 15:59:10,862 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 15:59:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 15:59:10,863 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:10,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:10,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1831618405, now seen corresponding path program 3 times [2020-04-18 15:59:10,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:10,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620722252] [2020-04-18 15:59:10,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:59:10,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620722252] [2020-04-18 15:59:10,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:10,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:10,917 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:10,919 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:10,931 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 57 transitions. [2020-04-18 15:59:10,931 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:10,965 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:59:10,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:59:10,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:10,965 INFO L87 Difference]: Start difference. First operand 85 states and 160 transitions. Second operand 6 states. [2020-04-18 15:59:11,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:11,027 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 15:59:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 15:59:11,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:11,028 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1509951981] [2020-04-18 15:59:11,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:11,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:59:11,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1509951981] [2020-04-18 15:59:11,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 15:59:11,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:11,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 15:59:11,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-04-18 15:59:11,029 INFO L87 Difference]: Start difference. First operand 3876 states and 16342 transitions. Second operand 7 states. [2020-04-18 15:59:11,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:11,514 INFO L93 Difference]: Finished difference Result 3088 states and 8648 transitions. [2020-04-18 15:59:11,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 15:59:11,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-04-18 15:59:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:11,523 INFO L225 Difference]: With dead ends: 3088 [2020-04-18 15:59:11,523 INFO L226 Difference]: Without dead ends: 3088 [2020-04-18 15:59:11,524 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-04-18 15:59:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2020-04-18 15:59:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 1610. [2020-04-18 15:59:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2020-04-18 15:59:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 4847 transitions. [2020-04-18 15:59:11,586 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 4847 transitions. Word has length 17 [2020-04-18 15:59:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:11,587 INFO L479 AbstractCegarLoop]: Abstraction has 1610 states and 4847 transitions. [2020-04-18 15:59:11,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 15:59:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 4847 transitions. [2020-04-18 15:59:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:11,588 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:11,588 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:11,588 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:59:11,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:11,589 INFO L82 PathProgramCache]: Analyzing trace with hash 229330979, now seen corresponding path program 1 times [2020-04-18 15:59:11,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:11,589 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [807910749] [2020-04-18 15:59:11,590 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:11,592 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 188 transitions. [2020-04-18 15:59:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 15:59:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:11,593 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:11,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:11,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2035634917, now seen corresponding path program 2 times [2020-04-18 15:59:11,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:11,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449194774] [2020-04-18 15:59:11,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:11,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449194774] [2020-04-18 15:59:11,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:11,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:11,617 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:11,619 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:11,626 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 94 transitions. [2020-04-18 15:59:11,626 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:11,632 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:11,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:11,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:11,632 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 15:59:11,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:11,642 INFO L93 Difference]: Finished difference Result 109 states and 213 transitions. [2020-04-18 15:59:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 213 transitions. [2020-04-18 15:59:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:11,643 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:11,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:11,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1261580793, now seen corresponding path program 3 times [2020-04-18 15:59:11,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:11,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699062207] [2020-04-18 15:59:11,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:11,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:59:11,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699062207] [2020-04-18 15:59:11,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:11,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 15:59:11,687 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:11,689 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:11,695 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2020-04-18 15:59:11,696 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:11,708 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:11,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:11,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:59:11,709 INFO L87 Difference]: Start difference. First operand 109 states and 213 transitions. Second operand 5 states. [2020-04-18 15:59:11,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:11,757 INFO L93 Difference]: Finished difference Result 121 states and 225 transitions. [2020-04-18 15:59:11,757 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 225 transitions. [2020-04-18 15:59:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:11,758 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:59:11,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:11,758 INFO L82 PathProgramCache]: Analyzing trace with hash 229330979, now seen corresponding path program 4 times [2020-04-18 15:59:11,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:11,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162519554] [2020-04-18 15:59:11,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:11,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:59:11,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162519554] [2020-04-18 15:59:11,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575793689] [2020-04-18 15:59:11,837 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 15:59:11,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 15:59:11,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 15:59:11,933 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 15:59:11,935 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 15:59:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:59:12,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 15:59:12,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 15:59:12,018 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:12,020 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:12,027 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2020-04-18 15:59:12,027 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:12,097 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:12,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 15:59:12,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 15:59:12,098 INFO L87 Difference]: Start difference. First operand 121 states and 225 transitions. Second operand 12 states. [2020-04-18 15:59:12,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:12,297 INFO L93 Difference]: Finished difference Result 123 states and 226 transitions. [2020-04-18 15:59:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 226 transitions. [2020-04-18 15:59:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:12,297 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:59:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:12,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2129177993, now seen corresponding path program 5 times [2020-04-18 15:59:12,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:12,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270152894] [2020-04-18 15:59:12,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:59:12,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270152894] [2020-04-18 15:59:12,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:12,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:12,328 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:12,330 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:12,334 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-04-18 15:59:12,334 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:12,348 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:12,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:12,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 15:59:12,349 INFO L87 Difference]: Start difference. First operand 123 states and 226 transitions. Second operand 3 states. [2020-04-18 15:59:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:12,356 INFO L93 Difference]: Finished difference Result 133 states and 235 transitions. [2020-04-18 15:59:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 235 transitions. [2020-04-18 15:59:12,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:12,357 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [807910749] [2020-04-18 15:59:12,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:12,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:59:12,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [807910749] [2020-04-18 15:59:12,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 15:59:12,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:12,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 15:59:12,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 15:59:12,358 INFO L87 Difference]: Start difference. First operand 1610 states and 4847 transitions. Second operand 13 states. [2020-04-18 15:59:12,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:12,871 INFO L93 Difference]: Finished difference Result 2817 states and 8005 transitions. [2020-04-18 15:59:12,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 15:59:12,871 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-04-18 15:59:12,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:12,880 INFO L225 Difference]: With dead ends: 2817 [2020-04-18 15:59:12,880 INFO L226 Difference]: Without dead ends: 2796 [2020-04-18 15:59:12,881 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 15:59:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2020-04-18 15:59:12,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 1515. [2020-04-18 15:59:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2020-04-18 15:59:12,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 4566 transitions. [2020-04-18 15:59:12,945 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 4566 transitions. Word has length 18 [2020-04-18 15:59:12,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:12,946 INFO L479 AbstractCegarLoop]: Abstraction has 1515 states and 4566 transitions. [2020-04-18 15:59:12,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 15:59:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 4566 transitions. [2020-04-18 15:59:12,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:12,947 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:12,947 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:13,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 15:59:13,155 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:59:13,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:13,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1406801102, now seen corresponding path program 1 times [2020-04-18 15:59:13,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:13,156 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [524909561] [2020-04-18 15:59:13,156 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:13,157 INFO L259 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2020-04-18 15:59:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-04-18 15:59:13,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:13,159 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:13,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:13,159 INFO L82 PathProgramCache]: Analyzing trace with hash 171542214, now seen corresponding path program 2 times [2020-04-18 15:59:13,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:13,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436719530] [2020-04-18 15:59:13,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:13,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436719530] [2020-04-18 15:59:13,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:13,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:13,239 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:13,242 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:13,248 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 95 transitions. [2020-04-18 15:59:13,249 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:13,254 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:13,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:13,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:13,255 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-04-18 15:59:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:13,266 INFO L93 Difference]: Finished difference Result 97 states and 185 transitions. [2020-04-18 15:59:13,266 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 185 transitions. [2020-04-18 15:59:13,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:13,267 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:13,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:13,267 INFO L82 PathProgramCache]: Analyzing trace with hash 945596338, now seen corresponding path program 3 times [2020-04-18 15:59:13,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:13,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984558775] [2020-04-18 15:59:13,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 15:59:13,305 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984558775] [2020-04-18 15:59:13,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:13,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:13,306 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:13,307 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:13,313 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 58 transitions. [2020-04-18 15:59:13,313 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:13,341 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:59:13,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:59:13,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:13,341 INFO L87 Difference]: Start difference. First operand 97 states and 185 transitions. Second operand 6 states. [2020-04-18 15:59:13,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:13,416 INFO L93 Difference]: Finished difference Result 103 states and 192 transitions. [2020-04-18 15:59:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 192 transitions. [2020-04-18 15:59:13,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:13,416 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:59:13,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:13,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1270613072, now seen corresponding path program 4 times [2020-04-18 15:59:13,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:13,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228342729] [2020-04-18 15:59:13,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:13,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228342729] [2020-04-18 15:59:13,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:13,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 15:59:13,474 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:13,475 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:13,479 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 15:59:13,479 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:13,501 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:13,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:13,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-04-18 15:59:13,502 INFO L87 Difference]: Start difference. First operand 103 states and 192 transitions. Second operand 5 states. [2020-04-18 15:59:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:13,557 INFO L93 Difference]: Finished difference Result 116 states and 204 transitions. [2020-04-18 15:59:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 204 transitions. [2020-04-18 15:59:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:13,558 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:59:13,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:13,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1406801102, now seen corresponding path program 5 times [2020-04-18 15:59:13,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:13,558 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359988799] [2020-04-18 15:59:13,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:13,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:13,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359988799] [2020-04-18 15:59:13,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:13,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 15:59:13,619 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:13,621 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:13,624 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 15:59:13,624 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:13,651 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:13,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 15:59:13,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-04-18 15:59:13,652 INFO L87 Difference]: Start difference. First operand 116 states and 204 transitions. Second operand 7 states. [2020-04-18 15:59:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:13,883 INFO L93 Difference]: Finished difference Result 118 states and 205 transitions. [2020-04-18 15:59:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 205 transitions. [2020-04-18 15:59:13,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:13,884 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [524909561] [2020-04-18 15:59:13,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:13,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 15:59:13,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [524909561] [2020-04-18 15:59:13,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-18 15:59:13,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:13,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 15:59:13,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2020-04-18 15:59:13,885 INFO L87 Difference]: Start difference. First operand 1515 states and 4566 transitions. Second operand 11 states. [2020-04-18 15:59:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:14,916 INFO L93 Difference]: Finished difference Result 3265 states and 8876 transitions. [2020-04-18 15:59:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-04-18 15:59:14,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-04-18 15:59:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:14,925 INFO L225 Difference]: With dead ends: 3265 [2020-04-18 15:59:14,925 INFO L226 Difference]: Without dead ends: 3232 [2020-04-18 15:59:14,927 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=512, Invalid=1650, Unknown=0, NotChecked=0, Total=2162 [2020-04-18 15:59:14,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2020-04-18 15:59:14,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1205. [2020-04-18 15:59:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2020-04-18 15:59:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 3518 transitions. [2020-04-18 15:59:14,981 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 3518 transitions. Word has length 18 [2020-04-18 15:59:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:14,981 INFO L479 AbstractCegarLoop]: Abstraction has 1205 states and 3518 transitions. [2020-04-18 15:59:14,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-18 15:59:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 3518 transitions. [2020-04-18 15:59:14,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:14,982 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:14,982 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:14,983 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:59:14,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:14,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1086137922, now seen corresponding path program 1 times [2020-04-18 15:59:14,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:14,983 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [52996396] [2020-04-18 15:59:14,984 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:14,985 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-04-18 15:59:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-04-18 15:59:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:14,986 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:14,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:14,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1594234652, now seen corresponding path program 2 times [2020-04-18 15:59:14,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:14,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776242261] [2020-04-18 15:59:14,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 15:59:15,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776242261] [2020-04-18 15:59:15,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:15,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:15,013 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:15,015 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:15,019 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-04-18 15:59:15,019 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:15,025 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:15,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:15,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:15,025 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-04-18 15:59:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:15,029 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 15:59:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 15:59:15,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:15,030 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:15,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:15,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1086137922, now seen corresponding path program 3 times [2020-04-18 15:59:15,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:15,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036542901] [2020-04-18 15:59:15,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 15:59:15,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036542901] [2020-04-18 15:59:15,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:15,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:15,158 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:15,160 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:15,162 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 15:59:15,162 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:15,174 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:15,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:15,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:59:15,174 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 5 states. [2020-04-18 15:59:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:15,198 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 15:59:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 15:59:15,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:15,199 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [52996396] [2020-04-18 15:59:15,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:15,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:59:15,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [52996396] [2020-04-18 15:59:15,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:59:15,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:15,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:15,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:15,200 INFO L87 Difference]: Start difference. First operand 1205 states and 3518 transitions. Second operand 5 states. [2020-04-18 15:59:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:15,295 INFO L93 Difference]: Finished difference Result 2245 states and 6476 transitions. [2020-04-18 15:59:15,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:59:15,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-04-18 15:59:15,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:15,302 INFO L225 Difference]: With dead ends: 2245 [2020-04-18 15:59:15,303 INFO L226 Difference]: Without dead ends: 2233 [2020-04-18 15:59:15,303 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2020-04-18 15:59:15,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 1434. [2020-04-18 15:59:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2020-04-18 15:59:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 4291 transitions. [2020-04-18 15:59:15,346 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 4291 transitions. Word has length 18 [2020-04-18 15:59:15,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:15,346 INFO L479 AbstractCegarLoop]: Abstraction has 1434 states and 4291 transitions. [2020-04-18 15:59:15,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 15:59:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 4291 transitions. [2020-04-18 15:59:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:15,348 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:15,348 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:15,348 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 15:59:15,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:15,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1078743820, now seen corresponding path program 1 times [2020-04-18 15:59:15,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:15,349 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [170046068] [2020-04-18 15:59:15,349 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:15,349 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 15:59:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-04-18 15:59:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:15,350 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:15,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1078743820, now seen corresponding path program 2 times [2020-04-18 15:59:15,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:15,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051348181] [2020-04-18 15:59:15,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:59:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:59:15,408 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 15:59:15,409 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 15:59:15,409 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 15:59:15,409 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 15:59:15,411 WARN L363 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 15:59:15,411 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-04-18 15:59:15,427 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,427 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,427 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,427 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,427 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,427 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,427 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,428 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,428 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,428 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,428 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,428 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,428 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,428 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,429 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,429 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,429 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,429 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,429 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,429 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,429 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,430 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,430 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,430 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,430 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,430 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,430 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,430 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,431 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,431 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,431 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,431 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,431 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,431 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,431 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,431 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,432 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,432 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,432 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,432 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,432 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,432 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,433 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,433 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,433 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,433 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,433 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,433 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,433 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,433 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,434 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,434 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,434 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,434 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,434 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,434 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,434 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,434 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,435 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,435 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,435 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,435 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,435 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,436 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,436 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,436 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,436 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,436 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,436 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,436 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,437 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,437 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,437 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,437 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,437 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,437 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,437 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,437 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,438 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,438 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,438 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,438 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,438 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,438 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,439 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,439 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,439 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,439 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,439 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,439 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,439 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,439 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,440 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,440 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,440 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,441 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,441 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,441 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,441 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,441 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,441 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,441 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,442 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,442 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,443 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,443 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,443 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,443 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,443 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,443 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,448 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,448 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,448 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,449 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,450 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,450 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,451 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,451 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,451 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,451 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,451 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,451 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,451 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,452 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,452 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,452 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,452 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,452 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,453 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,453 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,453 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,453 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,453 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,453 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,456 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,456 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,456 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,456 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,457 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,457 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,457 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,457 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,457 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,457 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,459 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,459 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,460 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,460 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,460 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,460 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,460 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,460 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,460 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,461 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,462 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,463 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,463 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,463 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,463 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,463 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,463 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,463 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,464 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,464 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,465 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,465 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,466 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,466 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,466 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,466 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,467 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,467 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,468 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,468 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,468 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,468 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,469 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,469 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,470 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,470 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,470 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,470 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,471 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,471 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,471 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,472 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,472 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,472 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:15,473 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-04-18 15:59:15,473 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 15:59:15,474 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 15:59:15,474 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 15:59:15,474 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 15:59:15,474 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 15:59:15,474 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 15:59:15,474 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 15:59:15,474 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 15:59:15,476 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 163 transitions, 390 flow [2020-04-18 15:59:15,476 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 167 places, 163 transitions, 390 flow [2020-04-18 15:59:15,502 INFO L129 PetriNetUnfolder]: 15/188 cut-off events. [2020-04-18 15:59:15,502 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-04-18 15:59:15,504 INFO L80 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 188 events. 15/188 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 431 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 208. Up to 10 conditions per place. [2020-04-18 15:59:15,513 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 167 places, 163 transitions, 390 flow [2020-04-18 15:59:15,538 INFO L129 PetriNetUnfolder]: 15/188 cut-off events. [2020-04-18 15:59:15,538 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-04-18 15:59:15,540 INFO L80 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 188 events. 15/188 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 431 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 208. Up to 10 conditions per place. [2020-04-18 15:59:15,548 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 8100 [2020-04-18 15:59:15,549 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 15:59:18,890 WARN L192 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2020-04-18 15:59:20,013 WARN L192 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 120 [2020-04-18 15:59:20,548 WARN L192 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-04-18 15:59:21,032 WARN L192 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 97 [2020-04-18 15:59:21,155 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 15:59:21,160 INFO L206 etLargeBlockEncoding]: Checked pairs total: 11405 [2020-04-18 15:59:21,161 INFO L214 etLargeBlockEncoding]: Total number of compositions: 148 [2020-04-18 15:59:21,161 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 45 transitions, 154 flow [2020-04-18 15:59:22,055 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13592 states. [2020-04-18 15:59:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 13592 states. [2020-04-18 15:59:22,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:59:22,055 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:22,055 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 15:59:22,056 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:59:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:22,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1179639, now seen corresponding path program 1 times [2020-04-18 15:59:22,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:22,056 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [376280818] [2020-04-18 15:59:22,056 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:22,057 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:59:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 15:59:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 15:59:22,057 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:22,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:22,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1179639, now seen corresponding path program 2 times [2020-04-18 15:59:22,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:22,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836428264] [2020-04-18 15:59:22,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:22,094 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 15:59:22,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836428264] [2020-04-18 15:59:22,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:22,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 15:59:22,095 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:22,095 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:22,095 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 15:59:22,096 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:22,105 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:22,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:22,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:22,106 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 15:59:22,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:22,106 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 15:59:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 15:59:22,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:22,107 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [376280818] [2020-04-18 15:59:22,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:22,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 15:59:22,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [376280818] [2020-04-18 15:59:22,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 15:59:22,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:22,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:22,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:22,108 INFO L87 Difference]: Start difference. First operand 13592 states. Second operand 3 states. [2020-04-18 15:59:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:22,314 INFO L93 Difference]: Finished difference Result 15456 states and 79163 transitions. [2020-04-18 15:59:22,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 15:59:22,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 15:59:22,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:22,404 INFO L225 Difference]: With dead ends: 15456 [2020-04-18 15:59:22,404 INFO L226 Difference]: Without dead ends: 14450 [2020-04-18 15:59:22,404 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 15:59:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14450 states. [2020-04-18 15:59:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14450 to 13395. [2020-04-18 15:59:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13395 states. [2020-04-18 15:59:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13395 states to 13395 states and 69324 transitions. [2020-04-18 15:59:23,807 INFO L78 Accepts]: Start accepts. Automaton has 13395 states and 69324 transitions. Word has length 3 [2020-04-18 15:59:23,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:23,808 INFO L479 AbstractCegarLoop]: Abstraction has 13395 states and 69324 transitions. [2020-04-18 15:59:23,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 15:59:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 13395 states and 69324 transitions. [2020-04-18 15:59:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:59:23,808 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:23,808 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:23,809 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:59:23,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:23,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1279109383, now seen corresponding path program 1 times [2020-04-18 15:59:23,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:23,809 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [237309840] [2020-04-18 15:59:23,810 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:23,810 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 15:59:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 15:59:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:59:23,811 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:23,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash 697816649, now seen corresponding path program 2 times [2020-04-18 15:59:23,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:23,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254503310] [2020-04-18 15:59:23,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:23,833 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 15:59:23,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254503310] [2020-04-18 15:59:23,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:23,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:23,834 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:23,835 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:23,836 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-04-18 15:59:23,836 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:23,842 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:59:23,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:23,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:23,842 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 15:59:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:23,846 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 15:59:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 15:59:23,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 15:59:23,847 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:23,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:23,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1279109383, now seen corresponding path program 3 times [2020-04-18 15:59:23,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:23,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775302308] [2020-04-18 15:59:23,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:23,883 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 15:59:23,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775302308] [2020-04-18 15:59:23,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:23,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:23,884 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:23,885 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:23,886 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 15:59:23,886 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:23,899 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:23,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:23,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:59:23,899 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2020-04-18 15:59:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:23,931 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 15:59:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 15:59:23,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:23,931 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [237309840] [2020-04-18 15:59:23,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:23,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:59:23,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [237309840] [2020-04-18 15:59:23,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:59:23,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:23,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:23,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:23,933 INFO L87 Difference]: Start difference. First operand 13395 states and 69324 transitions. Second operand 5 states. [2020-04-18 15:59:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:24,250 INFO L93 Difference]: Finished difference Result 23586 states and 116096 transitions. [2020-04-18 15:59:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:59:24,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 15:59:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:24,349 INFO L225 Difference]: With dead ends: 23586 [2020-04-18 15:59:24,349 INFO L226 Difference]: Without dead ends: 23544 [2020-04-18 15:59:24,351 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23544 states. [2020-04-18 15:59:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23544 to 14448. [2020-04-18 15:59:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14448 states. [2020-04-18 15:59:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14448 states to 14448 states and 75696 transitions. [2020-04-18 15:59:26,431 INFO L78 Accepts]: Start accepts. Automaton has 14448 states and 75696 transitions. Word has length 10 [2020-04-18 15:59:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:26,435 INFO L479 AbstractCegarLoop]: Abstraction has 14448 states and 75696 transitions. [2020-04-18 15:59:26,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 15:59:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 14448 states and 75696 transitions. [2020-04-18 15:59:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:59:26,435 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:26,436 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:26,436 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:59:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:26,436 INFO L82 PathProgramCache]: Analyzing trace with hash -284604684, now seen corresponding path program 1 times [2020-04-18 15:59:26,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:26,437 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [127715056] [2020-04-18 15:59:26,437 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:26,437 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2020-04-18 15:59:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-04-18 15:59:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:59:26,438 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:26,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:26,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1762132626, now seen corresponding path program 2 times [2020-04-18 15:59:26,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:26,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433522783] [2020-04-18 15:59:26,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:26,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433522783] [2020-04-18 15:59:26,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:26,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:26,467 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:26,468 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:26,470 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2020-04-18 15:59:26,470 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:26,476 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:59:26,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:26,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:26,476 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-04-18 15:59:26,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:26,481 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 15:59:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 15:59:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 15:59:26,482 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:26,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:26,482 INFO L82 PathProgramCache]: Analyzing trace with hash -284604684, now seen corresponding path program 3 times [2020-04-18 15:59:26,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:26,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047651710] [2020-04-18 15:59:26,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:26,534 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047651710] [2020-04-18 15:59:26,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:26,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:26,535 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:26,536 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:26,537 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 15:59:26,537 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:26,549 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:26,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:26,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:59:26,550 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-04-18 15:59:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:26,573 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 15:59:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 15:59:26,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:26,574 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [127715056] [2020-04-18 15:59:26,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:26,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:59:26,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [127715056] [2020-04-18 15:59:26,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:59:26,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:26,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:26,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:26,576 INFO L87 Difference]: Start difference. First operand 14448 states and 75696 transitions. Second operand 5 states. [2020-04-18 15:59:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:27,072 INFO L93 Difference]: Finished difference Result 25978 states and 129320 transitions. [2020-04-18 15:59:27,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:59:27,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-04-18 15:59:27,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:27,146 INFO L225 Difference]: With dead ends: 25978 [2020-04-18 15:59:27,147 INFO L226 Difference]: Without dead ends: 25910 [2020-04-18 15:59:27,147 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25910 states. [2020-04-18 15:59:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25910 to 15939. [2020-04-18 15:59:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15939 states. [2020-04-18 15:59:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15939 states to 15939 states and 84384 transitions. [2020-04-18 15:59:27,814 INFO L78 Accepts]: Start accepts. Automaton has 15939 states and 84384 transitions. Word has length 14 [2020-04-18 15:59:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:27,814 INFO L479 AbstractCegarLoop]: Abstraction has 15939 states and 84384 transitions. [2020-04-18 15:59:27,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 15:59:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 15939 states and 84384 transitions. [2020-04-18 15:59:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 15:59:27,816 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:27,816 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:27,816 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:59:27,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:27,816 INFO L82 PathProgramCache]: Analyzing trace with hash -391482428, now seen corresponding path program 1 times [2020-04-18 15:59:27,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:27,816 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [890026792] [2020-04-18 15:59:27,817 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:27,818 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 150 transitions. [2020-04-18 15:59:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-04-18 15:59:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 15:59:27,819 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:27,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1693335464, now seen corresponding path program 2 times [2020-04-18 15:59:27,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:27,822 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271384912] [2020-04-18 15:59:27,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:27,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271384912] [2020-04-18 15:59:27,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:27,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:27,859 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:27,861 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:27,864 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 46 transitions. [2020-04-18 15:59:27,865 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:27,870 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:59:27,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:27,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:27,871 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-04-18 15:59:27,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:27,879 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 15:59:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 15:59:27,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 15:59:27,880 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:27,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:27,880 INFO L82 PathProgramCache]: Analyzing trace with hash -391561118, now seen corresponding path program 3 times [2020-04-18 15:59:27,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:27,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107235141] [2020-04-18 15:59:27,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:27,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107235141] [2020-04-18 15:59:27,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:27,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:27,908 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:27,910 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:27,913 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 25 transitions. [2020-04-18 15:59:27,913 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:27,944 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:59:27,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:59:27,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:27,944 INFO L87 Difference]: Start difference. First operand 85 states and 160 transitions. Second operand 6 states. [2020-04-18 15:59:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:28,030 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 15:59:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 15:59:28,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:28,031 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [890026792] [2020-04-18 15:59:28,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:28,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:59:28,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [890026792] [2020-04-18 15:59:28,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 15:59:28,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:28,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 15:59:28,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-04-18 15:59:28,032 INFO L87 Difference]: Start difference. First operand 15939 states and 84384 transitions. Second operand 7 states. [2020-04-18 15:59:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:28,848 INFO L93 Difference]: Finished difference Result 6334 states and 17238 transitions. [2020-04-18 15:59:28,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 15:59:28,848 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-04-18 15:59:28,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:28,861 INFO L225 Difference]: With dead ends: 6334 [2020-04-18 15:59:28,862 INFO L226 Difference]: Without dead ends: 6334 [2020-04-18 15:59:28,862 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2020-04-18 15:59:28,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6334 states. [2020-04-18 15:59:28,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6334 to 3357. [2020-04-18 15:59:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3357 states. [2020-04-18 15:59:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 9797 transitions. [2020-04-18 15:59:28,990 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 9797 transitions. Word has length 17 [2020-04-18 15:59:28,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:28,990 INFO L479 AbstractCegarLoop]: Abstraction has 3357 states and 9797 transitions. [2020-04-18 15:59:28,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 15:59:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 9797 transitions. [2020-04-18 15:59:28,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:28,991 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:28,992 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:28,992 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:59:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:28,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1421383457, now seen corresponding path program 1 times [2020-04-18 15:59:28,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:28,993 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1111457333] [2020-04-18 15:59:28,993 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:28,994 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-04-18 15:59:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-04-18 15:59:28,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:28,995 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:28,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:28,995 INFO L82 PathProgramCache]: Analyzing trace with hash 975484449, now seen corresponding path program 2 times [2020-04-18 15:59:28,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:28,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191565003] [2020-04-18 15:59:28,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 15:59:29,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191565003] [2020-04-18 15:59:29,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:29,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:29,016 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:29,018 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:29,021 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-04-18 15:59:29,022 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:29,027 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:59:29,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:29,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:29,028 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-04-18 15:59:29,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:29,033 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 15:59:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 15:59:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:29,034 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:29,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1421383457, now seen corresponding path program 3 times [2020-04-18 15:59:29,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:29,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841811823] [2020-04-18 15:59:29,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 15:59:29,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841811823] [2020-04-18 15:59:29,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:29,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:29,079 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:29,081 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:29,084 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 15:59:29,084 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:29,096 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:29,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:29,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:59:29,096 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 5 states. [2020-04-18 15:59:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:29,122 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 15:59:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 15:59:29,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:29,122 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1111457333] [2020-04-18 15:59:29,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:29,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:59:29,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1111457333] [2020-04-18 15:59:29,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 15:59:29,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:29,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:29,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:29,124 INFO L87 Difference]: Start difference. First operand 3357 states and 9797 transitions. Second operand 5 states. [2020-04-18 15:59:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:29,264 INFO L93 Difference]: Finished difference Result 5159 states and 14529 transitions. [2020-04-18 15:59:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 15:59:29,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-04-18 15:59:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:29,273 INFO L225 Difference]: With dead ends: 5159 [2020-04-18 15:59:29,274 INFO L226 Difference]: Without dead ends: 5149 [2020-04-18 15:59:29,274 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5149 states. [2020-04-18 15:59:29,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5149 to 3425. [2020-04-18 15:59:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3425 states. [2020-04-18 15:59:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 9962 transitions. [2020-04-18 15:59:29,350 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 9962 transitions. Word has length 18 [2020-04-18 15:59:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:29,350 INFO L479 AbstractCegarLoop]: Abstraction has 3425 states and 9962 transitions. [2020-04-18 15:59:29,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 15:59:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 9962 transitions. [2020-04-18 15:59:29,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:29,352 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:29,352 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:29,352 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:59:29,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:29,353 INFO L82 PathProgramCache]: Analyzing trace with hash 723420348, now seen corresponding path program 1 times [2020-04-18 15:59:29,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:29,353 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2035252541] [2020-04-18 15:59:29,353 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:29,355 INFO L259 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2020-04-18 15:59:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-04-18 15:59:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:29,356 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:29,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:29,356 INFO L82 PathProgramCache]: Analyzing trace with hash 952969510, now seen corresponding path program 2 times [2020-04-18 15:59:29,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:29,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446686915] [2020-04-18 15:59:29,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:29,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446686915] [2020-04-18 15:59:29,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:29,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:29,376 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:29,377 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:29,381 INFO L259 McrAutomatonBuilder]: Finished intersection with 29 states and 38 transitions. [2020-04-18 15:59:29,381 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:29,387 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:59:29,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:29,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:29,388 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-04-18 15:59:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:29,398 INFO L93 Difference]: Finished difference Result 97 states and 185 transitions. [2020-04-18 15:59:29,398 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 185 transitions. [2020-04-18 15:59:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:29,399 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:29,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:29,399 INFO L82 PathProgramCache]: Analyzing trace with hash 745684908, now seen corresponding path program 3 times [2020-04-18 15:59:29,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:29,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831441668] [2020-04-18 15:59:29,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:29,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831441668] [2020-04-18 15:59:29,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:29,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 15:59:29,439 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:29,441 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:29,444 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 15:59:29,444 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:29,455 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:29,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:29,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 15:59:29,456 INFO L87 Difference]: Start difference. First operand 97 states and 185 transitions. Second operand 5 states. [2020-04-18 15:59:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:29,506 INFO L93 Difference]: Finished difference Result 109 states and 197 transitions. [2020-04-18 15:59:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 197 transitions. [2020-04-18 15:59:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:29,506 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:59:29,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:29,507 INFO L82 PathProgramCache]: Analyzing trace with hash 723420348, now seen corresponding path program 4 times [2020-04-18 15:59:29,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:29,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338294277] [2020-04-18 15:59:29,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:29,568 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338294277] [2020-04-18 15:59:29,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:29,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 15:59:29,569 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:29,570 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:29,574 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 15:59:29,574 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:29,590 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:29,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 15:59:29,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-04-18 15:59:29,590 INFO L87 Difference]: Start difference. First operand 109 states and 197 transitions. Second operand 7 states. [2020-04-18 15:59:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:29,701 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2020-04-18 15:59:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 198 transitions. [2020-04-18 15:59:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:29,702 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:59:29,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:29,702 INFO L82 PathProgramCache]: Analyzing trace with hash 776429336, now seen corresponding path program 5 times [2020-04-18 15:59:29,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:29,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11963545] [2020-04-18 15:59:29,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:29,734 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11963545] [2020-04-18 15:59:29,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:29,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:29,735 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:29,738 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:29,741 INFO L259 McrAutomatonBuilder]: Finished intersection with 20 states and 20 transitions. [2020-04-18 15:59:29,741 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:29,752 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 15:59:29,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:29,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-04-18 15:59:29,753 INFO L87 Difference]: Start difference. First operand 111 states and 198 transitions. Second operand 3 states. [2020-04-18 15:59:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:29,759 INFO L93 Difference]: Finished difference Result 121 states and 207 transitions. [2020-04-18 15:59:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2020-04-18 15:59:29,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:29,760 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2035252541] [2020-04-18 15:59:29,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:29,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 15:59:29,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2035252541] [2020-04-18 15:59:29,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-18 15:59:29,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:29,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 15:59:29,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-04-18 15:59:29,762 INFO L87 Difference]: Start difference. First operand 3425 states and 9962 transitions. Second operand 8 states. [2020-04-18 15:59:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:30,329 INFO L93 Difference]: Finished difference Result 6347 states and 17564 transitions. [2020-04-18 15:59:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 15:59:30,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-04-18 15:59:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:30,339 INFO L225 Difference]: With dead ends: 6347 [2020-04-18 15:59:30,339 INFO L226 Difference]: Without dead ends: 6323 [2020-04-18 15:59:30,340 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2020-04-18 15:59:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6323 states. [2020-04-18 15:59:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6323 to 3381. [2020-04-18 15:59:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3381 states. [2020-04-18 15:59:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 9842 transitions. [2020-04-18 15:59:30,413 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 9842 transitions. Word has length 18 [2020-04-18 15:59:30,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:30,413 INFO L479 AbstractCegarLoop]: Abstraction has 3381 states and 9842 transitions. [2020-04-18 15:59:30,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-18 15:59:30,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 9842 transitions. [2020-04-18 15:59:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:30,414 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:30,414 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:30,415 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:59:30,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:30,415 INFO L82 PathProgramCache]: Analyzing trace with hash 830017445, now seen corresponding path program 1 times [2020-04-18 15:59:30,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:30,415 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1949083680] [2020-04-18 15:59:30,416 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:30,417 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 188 transitions. [2020-04-18 15:59:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 15:59:30,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:30,417 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:30,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:30,418 INFO L82 PathProgramCache]: Analyzing trace with hash 953792927, now seen corresponding path program 2 times [2020-04-18 15:59:30,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:30,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596782022] [2020-04-18 15:59:30,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:30,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596782022] [2020-04-18 15:59:30,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:30,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:30,437 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:30,439 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:30,443 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 47 transitions. [2020-04-18 15:59:30,444 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:30,449 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:59:30,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:30,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:30,450 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 15:59:30,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:30,460 INFO L93 Difference]: Finished difference Result 109 states and 213 transitions. [2020-04-18 15:59:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 213 transitions. [2020-04-18 15:59:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:30,460 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:30,461 INFO L82 PathProgramCache]: Analyzing trace with hash 746508325, now seen corresponding path program 3 times [2020-04-18 15:59:30,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:30,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099511818] [2020-04-18 15:59:30,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:30,481 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099511818] [2020-04-18 15:59:30,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:30,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:30,482 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:30,484 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:30,487 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 26 transitions. [2020-04-18 15:59:30,488 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:30,725 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:59:30,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:59:30,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:30,726 INFO L87 Difference]: Start difference. First operand 109 states and 213 transitions. Second operand 6 states. [2020-04-18 15:59:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:30,823 INFO L93 Difference]: Finished difference Result 115 states and 220 transitions. [2020-04-18 15:59:30,823 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 220 transitions. [2020-04-18 15:59:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:30,823 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:59:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:30,824 INFO L82 PathProgramCache]: Analyzing trace with hash 829623845, now seen corresponding path program 4 times [2020-04-18 15:59:30,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:30,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276944026] [2020-04-18 15:59:30,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:30,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276944026] [2020-04-18 15:59:30,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:30,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 15:59:30,875 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:30,877 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:30,883 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2020-04-18 15:59:30,883 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:31,012 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 13 times. [2020-04-18 15:59:31,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 15:59:31,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-04-18 15:59:31,014 INFO L87 Difference]: Start difference. First operand 115 states and 220 transitions. Second operand 11 states. [2020-04-18 15:59:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:31,165 INFO L93 Difference]: Finished difference Result 128 states and 232 transitions. [2020-04-18 15:59:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2020-04-18 15:59:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 15:59:31,166 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:59:31,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:31,166 INFO L82 PathProgramCache]: Analyzing trace with hash 830017445, now seen corresponding path program 5 times [2020-04-18 15:59:31,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:31,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428707378] [2020-04-18 15:59:31,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 15:59:31,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428707378] [2020-04-18 15:59:31,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:31,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 15:59:31,218 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:31,220 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:31,225 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2020-04-18 15:59:31,226 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:31,259 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 8 times. [2020-04-18 15:59:31,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 15:59:31,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2020-04-18 15:59:31,260 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 11 states. [2020-04-18 15:59:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:31,426 INFO L93 Difference]: Finished difference Result 130 states and 233 transitions. [2020-04-18 15:59:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 233 transitions. [2020-04-18 15:59:31,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:31,427 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1949083680] [2020-04-18 15:59:31,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:31,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 15:59:31,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1949083680] [2020-04-18 15:59:31,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 15:59:31,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:31,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 15:59:31,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2020-04-18 15:59:31,429 INFO L87 Difference]: Start difference. First operand 3381 states and 9842 transitions. Second operand 17 states. [2020-04-18 15:59:33,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:33,963 INFO L93 Difference]: Finished difference Result 8277 states and 21932 transitions. [2020-04-18 15:59:33,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2020-04-18 15:59:33,963 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2020-04-18 15:59:33,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:33,975 INFO L225 Difference]: With dead ends: 8277 [2020-04-18 15:59:33,975 INFO L226 Difference]: Without dead ends: 8250 [2020-04-18 15:59:33,978 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2982 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1597, Invalid=6593, Unknown=0, NotChecked=0, Total=8190 [2020-04-18 15:59:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8250 states. [2020-04-18 15:59:34,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8250 to 3234. [2020-04-18 15:59:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3234 states. [2020-04-18 15:59:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 9399 transitions. [2020-04-18 15:59:34,250 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 9399 transitions. Word has length 18 [2020-04-18 15:59:34,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:34,250 INFO L479 AbstractCegarLoop]: Abstraction has 3234 states and 9399 transitions. [2020-04-18 15:59:34,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 15:59:34,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 9399 transitions. [2020-04-18 15:59:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:59:34,253 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:34,253 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:34,253 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:59:34,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:34,254 INFO L82 PathProgramCache]: Analyzing trace with hash 533807354, now seen corresponding path program 1 times [2020-04-18 15:59:34,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:34,254 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1639206725] [2020-04-18 15:59:34,255 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:34,256 INFO L259 McrAutomatonBuilder]: Finished intersection with 98 states and 200 transitions. [2020-04-18 15:59:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-04-18 15:59:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:59:34,257 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:34,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:34,257 INFO L82 PathProgramCache]: Analyzing trace with hash -261322664, now seen corresponding path program 2 times [2020-04-18 15:59:34,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:34,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253582135] [2020-04-18 15:59:34,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 15:59:34,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253582135] [2020-04-18 15:59:34,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:34,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 15:59:34,289 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:34,291 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:34,301 INFO L259 McrAutomatonBuilder]: Finished intersection with 63 states and 111 transitions. [2020-04-18 15:59:34,301 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:34,308 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 15:59:34,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 15:59:34,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 15:59:34,309 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-04-18 15:59:34,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:34,323 INFO L93 Difference]: Finished difference Result 117 states and 225 transitions. [2020-04-18 15:59:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 225 transitions. [2020-04-18 15:59:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:59:34,323 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 15:59:34,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:34,324 INFO L82 PathProgramCache]: Analyzing trace with hash -840362134, now seen corresponding path program 3 times [2020-04-18 15:59:34,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:34,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059438336] [2020-04-18 15:59:34,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 15:59:34,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059438336] [2020-04-18 15:59:34,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:34,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 15:59:34,351 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:34,354 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:34,362 INFO L259 McrAutomatonBuilder]: Finished intersection with 47 states and 71 transitions. [2020-04-18 15:59:34,363 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:34,393 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 15:59:34,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 15:59:34,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 15:59:34,394 INFO L87 Difference]: Start difference. First operand 117 states and 225 transitions. Second operand 6 states. [2020-04-18 15:59:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:34,465 INFO L93 Difference]: Finished difference Result 123 states and 232 transitions. [2020-04-18 15:59:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 232 transitions. [2020-04-18 15:59:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:59:34,466 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 15:59:34,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:34,467 INFO L82 PathProgramCache]: Analyzing trace with hash -841515334, now seen corresponding path program 4 times [2020-04-18 15:59:34,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:34,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332125142] [2020-04-18 15:59:34,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 15:59:34,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332125142] [2020-04-18 15:59:34,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 15:59:34,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 15:59:34,508 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:34,510 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:34,519 INFO L259 McrAutomatonBuilder]: Finished intersection with 50 states and 80 transitions. [2020-04-18 15:59:34,519 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:34,540 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 15:59:34,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 15:59:34,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-04-18 15:59:34,541 INFO L87 Difference]: Start difference. First operand 123 states and 232 transitions. Second operand 5 states. [2020-04-18 15:59:34,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:34,592 INFO L93 Difference]: Finished difference Result 136 states and 244 transitions. [2020-04-18 15:59:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 244 transitions. [2020-04-18 15:59:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:59:34,593 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 15:59:34,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash 533807354, now seen corresponding path program 5 times [2020-04-18 15:59:34,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:34,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371846050] [2020-04-18 15:59:34,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 15:59:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 15:59:34,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371846050] [2020-04-18 15:59:34,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142296551] [2020-04-18 15:59:34,654 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 15:59:34,752 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 15:59:34,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 15:59:34,753 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjunts are in the unsatisfiable core [2020-04-18 15:59:34,755 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 15:59:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 15:59:34,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 15:59:34,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2020-04-18 15:59:34,831 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 15:59:34,834 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:34,841 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 54 transitions. [2020-04-18 15:59:34,842 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 15:59:34,950 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 15:59:34,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 15:59:34,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2020-04-18 15:59:34,951 INFO L87 Difference]: Start difference. First operand 136 states and 244 transitions. Second operand 13 states. [2020-04-18 15:59:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:35,248 INFO L93 Difference]: Finished difference Result 138 states and 245 transitions. [2020-04-18 15:59:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 245 transitions. [2020-04-18 15:59:35,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 15:59:35,249 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1639206725] [2020-04-18 15:59:35,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 15:59:35,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 15:59:35,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1639206725] [2020-04-18 15:59:35,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-04-18 15:59:35,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 15:59:35,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 15:59:35,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2020-04-18 15:59:35,251 INFO L87 Difference]: Start difference. First operand 3234 states and 9399 transitions. Second operand 17 states. [2020-04-18 15:59:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 15:59:37,148 INFO L93 Difference]: Finished difference Result 8370 states and 22045 transitions. [2020-04-18 15:59:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-04-18 15:59:37,149 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2020-04-18 15:59:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 15:59:37,160 INFO L225 Difference]: With dead ends: 8370 [2020-04-18 15:59:37,160 INFO L226 Difference]: Without dead ends: 8336 [2020-04-18 15:59:37,161 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1505 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=937, Invalid=3619, Unknown=0, NotChecked=0, Total=4556 [2020-04-18 15:59:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8336 states. [2020-04-18 15:59:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8336 to 2952. [2020-04-18 15:59:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2020-04-18 15:59:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 8486 transitions. [2020-04-18 15:59:37,420 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 8486 transitions. Word has length 22 [2020-04-18 15:59:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 15:59:37,420 INFO L479 AbstractCegarLoop]: Abstraction has 2952 states and 8486 transitions. [2020-04-18 15:59:37,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-04-18 15:59:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 8486 transitions. [2020-04-18 15:59:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:59:37,423 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 15:59:37,423 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 15:59:37,626 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 15:59:37,627 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 15:59:37,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:37,628 INFO L82 PathProgramCache]: Analyzing trace with hash 152610057, now seen corresponding path program 1 times [2020-04-18 15:59:37,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 15:59:37,628 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [25483873] [2020-04-18 15:59:37,629 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 15:59:37,630 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 15:59:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-04-18 15:59:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 15:59:37,631 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 15:59:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 15:59:37,631 INFO L82 PathProgramCache]: Analyzing trace with hash 152610057, now seen corresponding path program 2 times [2020-04-18 15:59:37,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 15:59:37,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13793268] [2020-04-18 15:59:37,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 15:59:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:59:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 15:59:37,661 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 15:59:37,662 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 15:59:37,662 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 15:59:37,662 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 15:59:37,663 WARN L363 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 15:59:37,663 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-04-18 15:59:37,678 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,679 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,679 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,679 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,679 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,679 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,679 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,680 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,680 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,680 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,680 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,680 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,680 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,680 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,680 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,681 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,681 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,681 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,681 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,681 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,681 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,681 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,682 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,682 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,682 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,682 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,682 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,682 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,682 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,682 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,682 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,683 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,683 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,683 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,683 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,683 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,683 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,683 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,683 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,684 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,684 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,684 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,684 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,684 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,684 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,684 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,685 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,685 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,685 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,685 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,685 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,685 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,685 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,686 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,686 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,686 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,686 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,686 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,686 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,686 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,687 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,687 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,687 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,687 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,687 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,687 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,687 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,688 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,688 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,688 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,688 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,688 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,688 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,688 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,688 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,689 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,689 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,689 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,689 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,689 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,689 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,689 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,689 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,690 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,690 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,690 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,690 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,690 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,690 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,690 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,690 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,691 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,691 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,691 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,691 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,691 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,691 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,691 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,691 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,692 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,692 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,692 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,692 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,692 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,692 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,692 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,694 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,694 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,694 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,694 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,694 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,694 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,694 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,695 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,695 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,695 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,695 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,695 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,695 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,695 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,695 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,696 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,696 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,696 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,696 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,696 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,696 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,696 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,696 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,697 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,697 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,697 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,697 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,697 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,697 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,697 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,697 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,697 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,698 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,698 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,698 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,698 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,698 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,698 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,698 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,698 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,699 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,699 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,699 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,699 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,699 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,700 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,700 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,700 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,700 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,700 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,700 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,700 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,702 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,702 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,702 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,702 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,702 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,702 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,702 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,703 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,703 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,703 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,704 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,704 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,704 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,704 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,704 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,705 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,705 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,705 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,705 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,705 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,706 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,707 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,707 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,707 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,707 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,707 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,707 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,707 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,708 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,709 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,709 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,709 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,709 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,709 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,709 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,710 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,710 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,710 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,710 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,712 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,713 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,713 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,713 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,713 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,714 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,715 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,715 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,715 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,715 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,715 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,715 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,716 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,717 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,717 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,717 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,717 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,717 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,718 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,718 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,719 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,719 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,719 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,719 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 15:59:37,720 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-04-18 15:59:37,720 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 15:59:37,720 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 15:59:37,720 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 15:59:37,721 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 15:59:37,721 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 15:59:37,721 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 15:59:37,721 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 15:59:37,721 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 15:59:37,724 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 192 transitions, 474 flow [2020-04-18 15:59:37,725 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 197 places, 192 transitions, 474 flow [2020-04-18 15:59:37,759 INFO L129 PetriNetUnfolder]: 18/222 cut-off events. [2020-04-18 15:59:37,759 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-04-18 15:59:37,762 INFO L80 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 222 events. 18/222 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 532 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 249. Up to 12 conditions per place. [2020-04-18 15:59:37,776 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 197 places, 192 transitions, 474 flow [2020-04-18 15:59:37,804 INFO L129 PetriNetUnfolder]: 18/222 cut-off events. [2020-04-18 15:59:37,804 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-04-18 15:59:37,806 INFO L80 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 222 events. 18/222 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 532 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 249. Up to 12 conditions per place. [2020-04-18 15:59:37,814 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11754 [2020-04-18 15:59:37,814 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 15:59:41,578 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-04-18 15:59:41,887 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 15:59:42,017 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 15:59:42,028 INFO L206 etLargeBlockEncoding]: Checked pairs total: 17538 [2020-04-18 15:59:42,028 INFO L214 etLargeBlockEncoding]: Total number of compositions: 176 [2020-04-18 15:59:42,029 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 56 transitions, 202 flow [2020-04-18 16:00:04,905 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 97217 states. [2020-04-18 16:00:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 97217 states. [2020-04-18 16:00:04,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 16:00:04,905 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:00:04,906 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 16:00:04,906 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:00:04,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:04,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1584808, now seen corresponding path program 1 times [2020-04-18 16:00:04,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:00:04,907 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1122435867] [2020-04-18 16:00:04,907 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:04,907 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 16:00:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 16:00:04,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 16:00:04,908 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:00:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:04,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1584808, now seen corresponding path program 2 times [2020-04-18 16:00:04,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:04,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804300781] [2020-04-18 16:00:04,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:04,932 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 16:00:04,932 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804300781] [2020-04-18 16:00:04,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:04,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 16:00:04,933 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:04,933 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:04,933 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 16:00:04,934 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:04,938 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:00:04,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:04,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:00:04,939 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 16:00:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:04,939 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 16:00:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 16:00:04,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:00:04,940 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1122435867] [2020-04-18 16:00:04,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:00:04,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 16:00:04,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1122435867] [2020-04-18 16:00:04,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 16:00:04,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:00:04,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:04,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:00:04,942 INFO L87 Difference]: Start difference. First operand 97217 states. Second operand 3 states. [2020-04-18 16:00:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:09,339 INFO L93 Difference]: Finished difference Result 118175 states and 731030 transitions. [2020-04-18 16:00:09,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 16:00:09,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 16:00:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:00:09,796 INFO L225 Difference]: With dead ends: 118175 [2020-04-18 16:00:09,796 INFO L226 Difference]: Without dead ends: 110531 [2020-04-18 16:00:09,796 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 16:00:12,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110531 states. [2020-04-18 16:00:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110531 to 100755. [2020-04-18 16:00:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100755 states. [2020-04-18 16:00:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100755 states to 100755 states and 628402 transitions. [2020-04-18 16:00:15,657 INFO L78 Accepts]: Start accepts. Automaton has 100755 states and 628402 transitions. Word has length 3 [2020-04-18 16:00:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:00:15,657 INFO L479 AbstractCegarLoop]: Abstraction has 100755 states and 628402 transitions. [2020-04-18 16:00:15,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 16:00:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 100755 states and 628402 transitions. [2020-04-18 16:00:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 16:00:15,657 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:00:15,657 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:00:15,657 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:00:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:15,658 INFO L82 PathProgramCache]: Analyzing trace with hash 706336859, now seen corresponding path program 1 times [2020-04-18 16:00:15,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:00:15,658 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [87760209] [2020-04-18 16:00:15,658 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:15,658 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 16:00:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 16:00:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 16:00:15,659 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:00:15,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:15,659 INFO L82 PathProgramCache]: Analyzing trace with hash -459766095, now seen corresponding path program 2 times [2020-04-18 16:00:15,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:15,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745430539] [2020-04-18 16:00:15,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:15,675 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 16:00:15,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745430539] [2020-04-18 16:00:15,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:15,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:00:15,676 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:15,677 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:15,678 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-04-18 16:00:15,678 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:15,683 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:15,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:00:15,684 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 16:00:15,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:15,688 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 16:00:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 16:00:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 16:00:15,689 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:00:15,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:15,689 INFO L82 PathProgramCache]: Analyzing trace with hash 706336859, now seen corresponding path program 3 times [2020-04-18 16:00:15,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:15,689 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424708181] [2020-04-18 16:00:15,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:15,719 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 16:00:15,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424708181] [2020-04-18 16:00:15,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:15,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:00:15,720 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:15,720 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:15,721 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 16:00:15,721 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:15,732 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:00:15,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:00:15,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 16:00:15,733 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2020-04-18 16:00:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:15,757 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 16:00:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 16:00:15,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:00:15,757 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [87760209] [2020-04-18 16:00:15,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:00:15,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:00:15,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [87760209] [2020-04-18 16:00:15,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 16:00:15,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:00:15,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:00:15,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:00:15,759 INFO L87 Difference]: Start difference. First operand 100755 states and 628402 transitions. Second operand 5 states. [2020-04-18 16:00:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:23,584 INFO L93 Difference]: Finished difference Result 187755 states and 1125902 transitions. [2020-04-18 16:00:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 16:00:23,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 16:00:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:00:24,333 INFO L225 Difference]: With dead ends: 187755 [2020-04-18 16:00:24,333 INFO L226 Difference]: Without dead ends: 187578 [2020-04-18 16:00:24,334 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:00:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187578 states. [2020-04-18 16:00:32,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187578 to 111945. [2020-04-18 16:00:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111945 states. [2020-04-18 16:00:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111945 states to 111945 states and 706831 transitions. [2020-04-18 16:00:43,136 INFO L78 Accepts]: Start accepts. Automaton has 111945 states and 706831 transitions. Word has length 10 [2020-04-18 16:00:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:00:43,136 INFO L479 AbstractCegarLoop]: Abstraction has 111945 states and 706831 transitions. [2020-04-18 16:00:43,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 16:00:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 111945 states and 706831 transitions. [2020-04-18 16:00:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 16:00:43,137 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:00:43,137 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:00:43,137 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:00:43,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:43,137 INFO L82 PathProgramCache]: Analyzing trace with hash -748578768, now seen corresponding path program 1 times [2020-04-18 16:00:43,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:00:43,137 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1700307689] [2020-04-18 16:00:43,138 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:43,138 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2020-04-18 16:00:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-04-18 16:00:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 16:00:43,138 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:00:43,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:43,139 INFO L82 PathProgramCache]: Analyzing trace with hash 811703996, now seen corresponding path program 2 times [2020-04-18 16:00:43,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:43,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740923217] [2020-04-18 16:00:43,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:43,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740923217] [2020-04-18 16:00:43,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:43,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:00:43,168 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:43,169 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:43,171 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2020-04-18 16:00:43,172 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:43,177 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:00:43,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:00:43,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:00:43,178 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-04-18 16:00:43,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:43,182 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 16:00:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 16:00:43,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 16:00:43,183 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:00:43,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:00:43,183 INFO L82 PathProgramCache]: Analyzing trace with hash -748578768, now seen corresponding path program 3 times [2020-04-18 16:00:43,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:00:43,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060541845] [2020-04-18 16:00:43,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:00:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:00:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:00:43,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060541845] [2020-04-18 16:00:43,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:00:43,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:00:43,218 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:00:43,219 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:00:43,222 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 16:00:43,222 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:00:43,233 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:00:43,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:00:43,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 16:00:43,234 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-04-18 16:00:43,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:43,259 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 16:00:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 16:00:43,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:00:43,260 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1700307689] [2020-04-18 16:00:43,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:00:43,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:00:43,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1700307689] [2020-04-18 16:00:43,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 16:00:43,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:00:43,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:00:43,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:00:43,261 INFO L87 Difference]: Start difference. First operand 111945 states and 706831 transitions. Second operand 5 states. [2020-04-18 16:00:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:00:52,231 INFO L93 Difference]: Finished difference Result 212246 states and 1288288 transitions. [2020-04-18 16:00:52,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 16:00:52,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-04-18 16:00:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:00:53,159 INFO L225 Difference]: With dead ends: 212246 [2020-04-18 16:00:53,159 INFO L226 Difference]: Without dead ends: 211934 [2020-04-18 16:00:53,159 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:00:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211934 states. [2020-04-18 16:01:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211934 to 127498. [2020-04-18 16:01:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127498 states. [2020-04-18 16:01:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127498 states to 127498 states and 815584 transitions. [2020-04-18 16:01:06,808 INFO L78 Accepts]: Start accepts. Automaton has 127498 states and 815584 transitions. Word has length 14 [2020-04-18 16:01:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:06,808 INFO L479 AbstractCegarLoop]: Abstraction has 127498 states and 815584 transitions. [2020-04-18 16:01:06,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 16:01:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 127498 states and 815584 transitions. [2020-04-18 16:01:06,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 16:01:06,809 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:06,809 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:06,809 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:06,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:06,810 INFO L82 PathProgramCache]: Analyzing trace with hash 921085459, now seen corresponding path program 1 times [2020-04-18 16:01:06,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:06,810 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1366935063] [2020-04-18 16:01:06,810 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:06,811 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 150 transitions. [2020-04-18 16:01:06,811 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-04-18 16:01:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 16:01:06,812 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:06,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:06,812 INFO L82 PathProgramCache]: Analyzing trace with hash 469871123, now seen corresponding path program 2 times [2020-04-18 16:01:06,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:06,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82267361] [2020-04-18 16:01:06,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:06,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:06,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82267361] [2020-04-18 16:01:06,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:06,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:06,829 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:06,830 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:06,836 INFO L259 McrAutomatonBuilder]: Finished intersection with 52 states and 94 transitions. [2020-04-18 16:01:06,836 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:06,842 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:06,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:06,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:06,842 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-04-18 16:01:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:06,852 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 16:01:06,852 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 16:01:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 16:01:06,852 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:06,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:06,853 INFO L82 PathProgramCache]: Analyzing trace with hash 236651817, now seen corresponding path program 3 times [2020-04-18 16:01:06,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:06,853 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359090058] [2020-04-18 16:01:06,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:01:06,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359090058] [2020-04-18 16:01:06,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:06,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:06,880 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:06,882 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:06,887 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 57 transitions. [2020-04-18 16:01:06,887 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:06,916 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 16:01:06,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 16:01:06,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:01:06,917 INFO L87 Difference]: Start difference. First operand 85 states and 160 transitions. Second operand 6 states. [2020-04-18 16:01:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:06,976 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 16:01:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 16:01:06,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:01:06,977 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1366935063] [2020-04-18 16:01:06,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:01:06,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:01:06,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1366935063] [2020-04-18 16:01:06,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 16:01:06,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:01:06,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 16:01:06,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-04-18 16:01:06,979 INFO L87 Difference]: Start difference. First operand 127498 states and 815584 transitions. Second operand 7 states. [2020-04-18 16:01:07,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:07,610 INFO L93 Difference]: Finished difference Result 28630 states and 88425 transitions. [2020-04-18 16:01:07,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 16:01:07,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-04-18 16:01:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:07,659 INFO L225 Difference]: With dead ends: 28630 [2020-04-18 16:01:07,659 INFO L226 Difference]: Without dead ends: 28630 [2020-04-18 16:01:07,660 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-04-18 16:01:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28630 states. [2020-04-18 16:01:08,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28630 to 13870. [2020-04-18 16:01:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2020-04-18 16:01:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 45593 transitions. [2020-04-18 16:01:08,059 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 45593 transitions. Word has length 17 [2020-04-18 16:01:08,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:08,059 INFO L479 AbstractCegarLoop]: Abstraction has 13870 states and 45593 transitions. [2020-04-18 16:01:08,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 16:01:08,059 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 45593 transitions. [2020-04-18 16:01:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:01:08,061 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:08,061 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:08,062 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:08,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:08,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1755375156, now seen corresponding path program 1 times [2020-04-18 16:01:08,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:08,062 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [753643012] [2020-04-18 16:01:08,062 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:08,063 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 188 transitions. [2020-04-18 16:01:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 16:01:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:01:08,064 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:08,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:08,065 INFO L82 PathProgramCache]: Analyzing trace with hash 564846624, now seen corresponding path program 2 times [2020-04-18 16:01:08,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:08,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965000308] [2020-04-18 16:01:08,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:08,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965000308] [2020-04-18 16:01:08,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:08,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:08,101 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:08,103 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:08,109 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 94 transitions. [2020-04-18 16:01:08,109 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:08,128 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:08,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:08,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:08,129 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 16:01:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:08,139 INFO L93 Difference]: Finished difference Result 109 states and 213 transitions. [2020-04-18 16:01:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 213 transitions. [2020-04-18 16:01:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:01:08,140 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:08,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1855158498, now seen corresponding path program 3 times [2020-04-18 16:01:08,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:08,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822934494] [2020-04-18 16:01:08,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:01:08,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822934494] [2020-04-18 16:01:08,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:08,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:01:08,174 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:08,176 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:08,181 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2020-04-18 16:01:08,182 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:08,193 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:08,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:08,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 16:01:08,194 INFO L87 Difference]: Start difference. First operand 109 states and 213 transitions. Second operand 5 states. [2020-04-18 16:01:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:08,240 INFO L93 Difference]: Finished difference Result 121 states and 225 transitions. [2020-04-18 16:01:08,240 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 225 transitions. [2020-04-18 16:01:08,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:01:08,241 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:01:08,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:08,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1755375156, now seen corresponding path program 4 times [2020-04-18 16:01:08,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:08,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622012197] [2020-04-18 16:01:08,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:01:13,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622012197] [2020-04-18 16:01:13,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170491670] [2020-04-18 16:01:13,362 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:13,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 16:01:13,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:13,465 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 16:01:13,467 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:01:13,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:13,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 16:01:13,526 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:13,528 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:13,534 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2020-04-18 16:01:13,535 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:13,596 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:13,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 16:01:13,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 16:01:13,596 INFO L87 Difference]: Start difference. First operand 121 states and 225 transitions. Second operand 12 states. [2020-04-18 16:01:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:13,771 INFO L93 Difference]: Finished difference Result 123 states and 226 transitions. [2020-04-18 16:01:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 226 transitions. [2020-04-18 16:01:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:01:13,771 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:01:13,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:13,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1732117408, now seen corresponding path program 5 times [2020-04-18 16:01:13,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:13,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770130989] [2020-04-18 16:01:13,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:01:13,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770130989] [2020-04-18 16:01:13,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:13,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:13,813 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:13,815 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:13,819 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-04-18 16:01:13,819 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:13,836 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:13,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:13,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 16:01:13,837 INFO L87 Difference]: Start difference. First operand 123 states and 226 transitions. Second operand 3 states. [2020-04-18 16:01:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:13,843 INFO L93 Difference]: Finished difference Result 133 states and 235 transitions. [2020-04-18 16:01:13,843 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 235 transitions. [2020-04-18 16:01:13,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:01:13,844 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [753643012] [2020-04-18 16:01:13,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:01:13,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:01:13,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [753643012] [2020-04-18 16:01:13,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 16:01:13,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:01:13,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 16:01:13,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 16:01:13,845 INFO L87 Difference]: Start difference. First operand 13870 states and 45593 transitions. Second operand 13 states. [2020-04-18 16:01:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:14,651 INFO L93 Difference]: Finished difference Result 28297 states and 88595 transitions. [2020-04-18 16:01:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 16:01:14,651 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-04-18 16:01:14,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:14,699 INFO L225 Difference]: With dead ends: 28297 [2020-04-18 16:01:14,700 INFO L226 Difference]: Without dead ends: 28227 [2020-04-18 16:01:14,700 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 16:01:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28227 states. [2020-04-18 16:01:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28227 to 13185. [2020-04-18 16:01:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13185 states. [2020-04-18 16:01:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13185 states to 13185 states and 43189 transitions. [2020-04-18 16:01:15,084 INFO L78 Accepts]: Start accepts. Automaton has 13185 states and 43189 transitions. Word has length 18 [2020-04-18 16:01:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:15,084 INFO L479 AbstractCegarLoop]: Abstraction has 13185 states and 43189 transitions. [2020-04-18 16:01:15,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 16:01:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 13185 states and 43189 transitions. [2020-04-18 16:01:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:01:15,085 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:15,085 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:15,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:15,286 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:15,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:15,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1676322857, now seen corresponding path program 1 times [2020-04-18 16:01:15,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:15,287 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [13020293] [2020-04-18 16:01:15,288 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:15,289 INFO L259 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2020-04-18 16:01:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-04-18 16:01:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:01:15,290 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:15,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:15,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1681104429, now seen corresponding path program 2 times [2020-04-18 16:01:15,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:15,290 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479521391] [2020-04-18 16:01:15,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:15,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479521391] [2020-04-18 16:01:15,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:15,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:15,308 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:15,309 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:15,317 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 95 transitions. [2020-04-18 16:01:15,317 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:15,322 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:15,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:15,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:15,323 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-04-18 16:01:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:15,332 INFO L93 Difference]: Finished difference Result 97 states and 185 transitions. [2020-04-18 16:01:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 185 transitions. [2020-04-18 16:01:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:01:15,333 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:15,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:15,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1253726761, now seen corresponding path program 3 times [2020-04-18 16:01:15,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:15,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826315520] [2020-04-18 16:01:15,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:01:15,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826315520] [2020-04-18 16:01:15,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:15,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:15,352 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:15,354 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:15,359 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 58 transitions. [2020-04-18 16:01:15,359 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:15,390 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 16:01:15,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 16:01:15,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:01:15,391 INFO L87 Difference]: Start difference. First operand 97 states and 185 transitions. Second operand 6 states. [2020-04-18 16:01:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:15,466 INFO L93 Difference]: Finished difference Result 103 states and 192 transitions. [2020-04-18 16:01:15,466 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 192 transitions. [2020-04-18 16:01:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:01:15,467 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:01:15,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:15,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1676790857, now seen corresponding path program 4 times [2020-04-18 16:01:15,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:15,468 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859850430] [2020-04-18 16:01:15,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:15,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859850430] [2020-04-18 16:01:15,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:15,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:01:15,509 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:15,511 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:15,514 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 16:01:15,514 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:15,536 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:15,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:15,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-04-18 16:01:15,537 INFO L87 Difference]: Start difference. First operand 103 states and 192 transitions. Second operand 5 states. [2020-04-18 16:01:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:15,587 INFO L93 Difference]: Finished difference Result 116 states and 204 transitions. [2020-04-18 16:01:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 204 transitions. [2020-04-18 16:01:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:01:15,588 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:01:15,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:15,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1676322857, now seen corresponding path program 5 times [2020-04-18 16:01:15,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:15,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371042160] [2020-04-18 16:01:15,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:15,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371042160] [2020-04-18 16:01:15,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:15,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 16:01:15,638 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:15,641 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:15,644 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 16:01:15,644 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:15,667 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:15,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 16:01:15,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-04-18 16:01:15,668 INFO L87 Difference]: Start difference. First operand 116 states and 204 transitions. Second operand 7 states. [2020-04-18 16:01:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:15,776 INFO L93 Difference]: Finished difference Result 118 states and 205 transitions. [2020-04-18 16:01:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 205 transitions. [2020-04-18 16:01:15,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:01:15,776 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [13020293] [2020-04-18 16:01:15,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:01:15,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 16:01:15,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [13020293] [2020-04-18 16:01:15,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-18 16:01:15,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:01:15,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 16:01:15,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2020-04-18 16:01:15,778 INFO L87 Difference]: Start difference. First operand 13185 states and 43189 transitions. Second operand 11 states. [2020-04-18 16:01:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:17,445 INFO L93 Difference]: Finished difference Result 41864 states and 127091 transitions. [2020-04-18 16:01:17,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 16:01:17,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-04-18 16:01:17,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:17,514 INFO L225 Difference]: With dead ends: 41864 [2020-04-18 16:01:17,514 INFO L226 Difference]: Without dead ends: 41780 [2020-04-18 16:01:17,514 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=623, Invalid=2133, Unknown=0, NotChecked=0, Total=2756 [2020-04-18 16:01:17,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41780 states. [2020-04-18 16:01:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41780 to 12294. [2020-04-18 16:01:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12294 states. [2020-04-18 16:01:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12294 states to 12294 states and 40114 transitions. [2020-04-18 16:01:17,988 INFO L78 Accepts]: Start accepts. Automaton has 12294 states and 40114 transitions. Word has length 18 [2020-04-18 16:01:17,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:17,988 INFO L479 AbstractCegarLoop]: Abstraction has 12294 states and 40114 transitions. [2020-04-18 16:01:17,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-18 16:01:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 12294 states and 40114 transitions. [2020-04-18 16:01:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:01:17,989 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:17,989 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:17,989 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:17,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:17,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1820904367, now seen corresponding path program 1 times [2020-04-18 16:01:17,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:17,989 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [569817704] [2020-04-18 16:01:17,990 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:17,990 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-04-18 16:01:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-04-18 16:01:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:01:17,991 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:17,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:17,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1116922107, now seen corresponding path program 2 times [2020-04-18 16:01:17,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:17,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225190190] [2020-04-18 16:01:17,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:18,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225190190] [2020-04-18 16:01:18,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:18,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:18,008 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:18,009 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:18,012 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-04-18 16:01:18,012 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:18,018 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:18,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:18,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:18,018 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-04-18 16:01:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:18,021 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 16:01:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 16:01:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 16:01:18,022 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:18,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:18,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1820904367, now seen corresponding path program 3 times [2020-04-18 16:01:18,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:18,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366205160] [2020-04-18 16:01:18,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:18,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366205160] [2020-04-18 16:01:18,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:18,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:18,067 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:18,068 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:18,070 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 16:01:18,070 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:18,085 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:18,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:18,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 16:01:18,085 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 5 states. [2020-04-18 16:01:18,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:18,108 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 16:01:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 16:01:18,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:01:18,109 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [569817704] [2020-04-18 16:01:18,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:01:18,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:01:18,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [569817704] [2020-04-18 16:01:18,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 16:01:18,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:01:18,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:18,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:01:18,110 INFO L87 Difference]: Start difference. First operand 12294 states and 40114 transitions. Second operand 5 states. [2020-04-18 16:01:18,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:18,336 INFO L93 Difference]: Finished difference Result 24605 states and 79893 transitions. [2020-04-18 16:01:18,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 16:01:18,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-04-18 16:01:18,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:18,379 INFO L225 Difference]: With dead ends: 24605 [2020-04-18 16:01:18,379 INFO L226 Difference]: Without dead ends: 24581 [2020-04-18 16:01:18,379 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:01:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24581 states. [2020-04-18 16:01:18,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24581 to 13787. [2020-04-18 16:01:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13787 states. [2020-04-18 16:01:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13787 states to 13787 states and 45295 transitions. [2020-04-18 16:01:18,748 INFO L78 Accepts]: Start accepts. Automaton has 13787 states and 45295 transitions. Word has length 18 [2020-04-18 16:01:18,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:18,748 INFO L479 AbstractCegarLoop]: Abstraction has 13787 states and 45295 transitions. [2020-04-18 16:01:18,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 16:01:18,748 INFO L276 IsEmpty]: Start isEmpty. Operand 13787 states and 45295 transitions. [2020-04-18 16:01:18,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:18,749 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:18,749 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:18,750 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:18,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:18,750 INFO L82 PathProgramCache]: Analyzing trace with hash 862095341, now seen corresponding path program 1 times [2020-04-18 16:01:18,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:18,750 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2125706911] [2020-04-18 16:01:18,751 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:18,753 INFO L259 McrAutomatonBuilder]: Finished intersection with 130 states and 280 transitions. [2020-04-18 16:01:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2020-04-18 16:01:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:18,754 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:18,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:18,754 INFO L82 PathProgramCache]: Analyzing trace with hash 13946975, now seen corresponding path program 2 times [2020-04-18 16:01:18,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:18,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441694584] [2020-04-18 16:01:18,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:18,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441694584] [2020-04-18 16:01:18,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:18,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:18,774 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:18,776 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:18,786 INFO L259 McrAutomatonBuilder]: Finished intersection with 85 states and 162 transitions. [2020-04-18 16:01:18,786 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:18,791 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:18,792 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 3 states. [2020-04-18 16:01:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:18,802 INFO L93 Difference]: Finished difference Result 157 states and 317 transitions. [2020-04-18 16:01:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 317 transitions. [2020-04-18 16:01:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:18,803 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:18,803 INFO L82 PathProgramCache]: Analyzing trace with hash 39794721, now seen corresponding path program 3 times [2020-04-18 16:01:18,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:18,803 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666215048] [2020-04-18 16:01:18,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:18,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666215048] [2020-04-18 16:01:18,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:18,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:01:18,850 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:18,852 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:18,861 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 132 transitions. [2020-04-18 16:01:18,861 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:18,870 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:18,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:18,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 16:01:18,871 INFO L87 Difference]: Start difference. First operand 157 states and 317 transitions. Second operand 5 states. [2020-04-18 16:01:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:18,934 INFO L93 Difference]: Finished difference Result 169 states and 329 transitions. [2020-04-18 16:01:18,934 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 329 transitions. [2020-04-18 16:01:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:18,935 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:01:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:18,935 INFO L82 PathProgramCache]: Analyzing trace with hash 862095341, now seen corresponding path program 4 times [2020-04-18 16:01:18,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:18,935 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023396461] [2020-04-18 16:01:18,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:18,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023396461] [2020-04-18 16:01:18,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743487040] [2020-04-18 16:01:18,991 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:19,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 16:01:19,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:19,129 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 16:01:19,136 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:19,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:19,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 16:01:19,243 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:19,248 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:19,265 INFO L259 McrAutomatonBuilder]: Finished intersection with 55 states and 86 transitions. [2020-04-18 16:01:19,266 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:19,355 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:19,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 16:01:19,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 16:01:19,356 INFO L87 Difference]: Start difference. First operand 169 states and 329 transitions. Second operand 12 states. [2020-04-18 16:01:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:19,524 INFO L93 Difference]: Finished difference Result 171 states and 330 transitions. [2020-04-18 16:01:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 330 transitions. [2020-04-18 16:01:19,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:19,525 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:01:19,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash 146658463, now seen corresponding path program 5 times [2020-04-18 16:01:19,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:19,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012992738] [2020-04-18 16:01:19,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:19,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:19,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012992738] [2020-04-18 16:01:19,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:19,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:19,548 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:19,551 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:19,557 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2020-04-18 16:01:19,558 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:19,722 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:19,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:19,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 16:01:19,722 INFO L87 Difference]: Start difference. First operand 171 states and 330 transitions. Second operand 3 states. [2020-04-18 16:01:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:19,738 INFO L93 Difference]: Finished difference Result 181 states and 339 transitions. [2020-04-18 16:01:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 339 transitions. [2020-04-18 16:01:19,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:01:19,739 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2125706911] [2020-04-18 16:01:19,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:01:19,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:01:19,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2125706911] [2020-04-18 16:01:19,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 16:01:19,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:01:19,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 16:01:19,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 16:01:19,740 INFO L87 Difference]: Start difference. First operand 13787 states and 45295 transitions. Second operand 13 states. [2020-04-18 16:01:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:20,689 INFO L93 Difference]: Finished difference Result 31898 states and 102145 transitions. [2020-04-18 16:01:20,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 16:01:20,690 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-04-18 16:01:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:20,746 INFO L225 Difference]: With dead ends: 31898 [2020-04-18 16:01:20,747 INFO L226 Difference]: Without dead ends: 31865 [2020-04-18 16:01:20,747 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 16:01:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31865 states. [2020-04-18 16:01:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31865 to 13520. [2020-04-18 16:01:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13520 states. [2020-04-18 16:01:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13520 states to 13520 states and 44395 transitions. [2020-04-18 16:01:21,169 INFO L78 Accepts]: Start accepts. Automaton has 13520 states and 44395 transitions. Word has length 22 [2020-04-18 16:01:21,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:21,169 INFO L479 AbstractCegarLoop]: Abstraction has 13520 states and 44395 transitions. [2020-04-18 16:01:21,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 16:01:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 13520 states and 44395 transitions. [2020-04-18 16:01:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:21,170 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:21,171 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:21,373 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:21,374 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:21,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash 611812975, now seen corresponding path program 1 times [2020-04-18 16:01:21,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:21,375 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [485132004] [2020-04-18 16:01:21,376 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:21,378 INFO L259 McrAutomatonBuilder]: Finished intersection with 98 states and 200 transitions. [2020-04-18 16:01:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-04-18 16:01:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:21,379 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:21,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:21,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1290141411, now seen corresponding path program 2 times [2020-04-18 16:01:21,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:21,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945728365] [2020-04-18 16:01:21,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:21,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945728365] [2020-04-18 16:01:21,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:21,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:21,393 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:21,394 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:21,400 INFO L259 McrAutomatonBuilder]: Finished intersection with 61 states and 108 transitions. [2020-04-18 16:01:21,401 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:21,405 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:21,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:21,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:21,406 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-04-18 16:01:21,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:21,415 INFO L93 Difference]: Finished difference Result 117 states and 225 transitions. [2020-04-18 16:01:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 225 transitions. [2020-04-18 16:01:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:21,416 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:21,416 INFO L82 PathProgramCache]: Analyzing trace with hash -909934341, now seen corresponding path program 3 times [2020-04-18 16:01:21,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:21,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169291191] [2020-04-18 16:01:21,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:21,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169291191] [2020-04-18 16:01:21,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:21,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:21,448 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:21,450 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:21,457 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 51 transitions. [2020-04-18 16:01:21,457 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:21,462 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:21,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:21,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 16:01:21,463 INFO L87 Difference]: Start difference. First operand 117 states and 225 transitions. Second operand 3 states. [2020-04-18 16:01:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:21,469 INFO L93 Difference]: Finished difference Result 126 states and 234 transitions. [2020-04-18 16:01:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 234 transitions. [2020-04-18 16:01:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:21,470 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:01:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:21,470 INFO L82 PathProgramCache]: Analyzing trace with hash 611817595, now seen corresponding path program 4 times [2020-04-18 16:01:21,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:21,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474512293] [2020-04-18 16:01:21,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:21,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474512293] [2020-04-18 16:01:21,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314433155] [2020-04-18 16:01:21,509 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:21,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 16:01:21,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:21,609 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2020-04-18 16:01:21,610 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:21,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:21,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-04-18 16:01:21,652 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:21,654 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:21,662 INFO L259 McrAutomatonBuilder]: Finished intersection with 50 states and 80 transitions. [2020-04-18 16:01:21,663 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:21,876 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 19 times. [2020-04-18 16:01:21,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 16:01:21,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2020-04-18 16:01:21,877 INFO L87 Difference]: Start difference. First operand 126 states and 234 transitions. Second operand 19 states. [2020-04-18 16:01:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:22,117 INFO L93 Difference]: Finished difference Result 127 states and 234 transitions. [2020-04-18 16:01:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 234 transitions. [2020-04-18 16:01:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:22,118 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:01:22,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:22,119 INFO L82 PathProgramCache]: Analyzing trace with hash 611812975, now seen corresponding path program 5 times [2020-04-18 16:01:22,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:22,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834271799] [2020-04-18 16:01:22,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:22,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834271799] [2020-04-18 16:01:22,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506819299] [2020-04-18 16:01:22,168 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:22,278 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 16:01:22,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:22,279 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 16:01:22,281 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:22,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:22,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 16:01:22,413 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:22,415 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:22,421 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 54 transitions. [2020-04-18 16:01:22,422 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:22,487 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 8 times. [2020-04-18 16:01:22,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 16:01:22,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2020-04-18 16:01:22,488 INFO L87 Difference]: Start difference. First operand 127 states and 234 transitions. Second operand 16 states. [2020-04-18 16:01:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:22,694 INFO L93 Difference]: Finished difference Result 134 states and 243 transitions. [2020-04-18 16:01:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 243 transitions. [2020-04-18 16:01:22,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:01:22,695 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [485132004] [2020-04-18 16:01:22,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:01:22,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 16:01:22,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [485132004] [2020-04-18 16:01:22,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-04-18 16:01:22,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:01:22,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-04-18 16:01:22,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2020-04-18 16:01:22,696 INFO L87 Difference]: Start difference. First operand 13520 states and 44395 transitions. Second operand 24 states. [2020-04-18 16:01:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:24,827 INFO L93 Difference]: Finished difference Result 32253 states and 103231 transitions. [2020-04-18 16:01:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 16:01:24,828 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2020-04-18 16:01:24,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:24,885 INFO L225 Difference]: With dead ends: 32253 [2020-04-18 16:01:24,885 INFO L226 Difference]: Without dead ends: 32220 [2020-04-18 16:01:24,886 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1114, Invalid=3716, Unknown=0, NotChecked=0, Total=4830 [2020-04-18 16:01:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32220 states. [2020-04-18 16:01:25,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32220 to 13635. [2020-04-18 16:01:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13635 states. [2020-04-18 16:01:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13635 states to 13635 states and 44805 transitions. [2020-04-18 16:01:25,321 INFO L78 Accepts]: Start accepts. Automaton has 13635 states and 44805 transitions. Word has length 22 [2020-04-18 16:01:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:25,321 INFO L479 AbstractCegarLoop]: Abstraction has 13635 states and 44805 transitions. [2020-04-18 16:01:25,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-04-18 16:01:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 13635 states and 44805 transitions. [2020-04-18 16:01:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:25,323 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:25,323 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:25,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:25,726 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:25,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:25,727 INFO L82 PathProgramCache]: Analyzing trace with hash -704732583, now seen corresponding path program 1 times [2020-04-18 16:01:25,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:25,727 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [259392886] [2020-04-18 16:01:25,729 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:25,731 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 180 transitions. [2020-04-18 16:01:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 16:01:25,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:25,732 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:25,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:25,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1290209485, now seen corresponding path program 2 times [2020-04-18 16:01:25,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:25,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736779599] [2020-04-18 16:01:25,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:25,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736779599] [2020-04-18 16:01:25,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:25,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:25,750 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:25,756 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:25,773 INFO L259 McrAutomatonBuilder]: Finished intersection with 61 states and 108 transitions. [2020-04-18 16:01:25,774 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:25,779 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:25,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:25,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:25,779 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 16:01:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:25,788 INFO L93 Difference]: Finished difference Result 105 states and 197 transitions. [2020-04-18 16:01:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 197 transitions. [2020-04-18 16:01:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:25,788 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:25,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:25,789 INFO L82 PathProgramCache]: Analyzing trace with hash -911809405, now seen corresponding path program 3 times [2020-04-18 16:01:25,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:25,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933909703] [2020-04-18 16:01:25,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:25,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933909703] [2020-04-18 16:01:25,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:25,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:25,814 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:25,817 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:25,835 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 51 transitions. [2020-04-18 16:01:25,836 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:25,840 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:25,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:25,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 16:01:25,841 INFO L87 Difference]: Start difference. First operand 105 states and 197 transitions. Second operand 3 states. [2020-04-18 16:01:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:25,847 INFO L93 Difference]: Finished difference Result 114 states and 206 transitions. [2020-04-18 16:01:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 206 transitions. [2020-04-18 16:01:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:25,848 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:01:25,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:25,848 INFO L82 PathProgramCache]: Analyzing trace with hash -476811063, now seen corresponding path program 4 times [2020-04-18 16:01:25,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:25,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210199132] [2020-04-18 16:01:25,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:25,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210199132] [2020-04-18 16:01:25,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:25,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:01:25,901 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:25,906 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:25,912 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 28 transitions. [2020-04-18 16:01:25,912 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:25,932 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:25,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:25,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 16:01:25,933 INFO L87 Difference]: Start difference. First operand 114 states and 206 transitions. Second operand 5 states. [2020-04-18 16:01:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:26,002 INFO L93 Difference]: Finished difference Result 127 states and 218 transitions. [2020-04-18 16:01:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 218 transitions. [2020-04-18 16:01:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:26,003 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:01:26,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:26,003 INFO L82 PathProgramCache]: Analyzing trace with hash -704732583, now seen corresponding path program 5 times [2020-04-18 16:01:26,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:26,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522596665] [2020-04-18 16:01:26,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:26,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522596665] [2020-04-18 16:01:26,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:26,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 16:01:26,062 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:26,065 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:26,070 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 16:01:26,070 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:26,088 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:26,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 16:01:26,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-04-18 16:01:26,089 INFO L87 Difference]: Start difference. First operand 127 states and 218 transitions. Second operand 7 states. [2020-04-18 16:01:26,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:26,206 INFO L93 Difference]: Finished difference Result 129 states and 219 transitions. [2020-04-18 16:01:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 219 transitions. [2020-04-18 16:01:26,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:01:26,207 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [259392886] [2020-04-18 16:01:26,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:01:26,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 16:01:26,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [259392886] [2020-04-18 16:01:26,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-18 16:01:26,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:01:26,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 16:01:26,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-04-18 16:01:26,208 INFO L87 Difference]: Start difference. First operand 13635 states and 44805 transitions. Second operand 8 states. [2020-04-18 16:01:27,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:27,015 INFO L93 Difference]: Finished difference Result 32335 states and 103485 transitions. [2020-04-18 16:01:27,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 16:01:27,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-04-18 16:01:27,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:27,075 INFO L225 Difference]: With dead ends: 32335 [2020-04-18 16:01:27,075 INFO L226 Difference]: Without dead ends: 32283 [2020-04-18 16:01:27,076 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2020-04-18 16:01:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32283 states. [2020-04-18 16:01:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32283 to 13344. [2020-04-18 16:01:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13344 states. [2020-04-18 16:01:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13344 states to 13344 states and 43620 transitions. [2020-04-18 16:01:27,646 INFO L78 Accepts]: Start accepts. Automaton has 13344 states and 43620 transitions. Word has length 22 [2020-04-18 16:01:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:27,647 INFO L479 AbstractCegarLoop]: Abstraction has 13344 states and 43620 transitions. [2020-04-18 16:01:27,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-18 16:01:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 13344 states and 43620 transitions. [2020-04-18 16:01:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:27,648 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:27,648 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:27,648 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:27,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:27,649 INFO L82 PathProgramCache]: Analyzing trace with hash -704227934, now seen corresponding path program 1 times [2020-04-18 16:01:27,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:27,649 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1428717146] [2020-04-18 16:01:27,650 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:27,651 INFO L259 McrAutomatonBuilder]: Finished intersection with 114 states and 240 transitions. [2020-04-18 16:01:27,652 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2020-04-18 16:01:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:27,653 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:27,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:27,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1041385864, now seen corresponding path program 2 times [2020-04-18 16:01:27,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:27,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947006669] [2020-04-18 16:01:27,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:27,670 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947006669] [2020-04-18 16:01:27,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:27,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:27,670 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:27,672 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:27,682 INFO L259 McrAutomatonBuilder]: Finished intersection with 81 states and 155 transitions. [2020-04-18 16:01:27,682 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:27,687 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:27,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:27,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:27,687 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 3 states. [2020-04-18 16:01:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:27,698 INFO L93 Difference]: Finished difference Result 133 states and 261 transitions. [2020-04-18 16:01:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 261 transitions. [2020-04-18 16:01:27,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:27,699 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:27,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:27,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1509959390, now seen corresponding path program 3 times [2020-04-18 16:01:27,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:27,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292769320] [2020-04-18 16:01:27,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:27,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292769320] [2020-04-18 16:01:27,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:27,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:27,718 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:27,720 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:27,727 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 94 transitions. [2020-04-18 16:01:27,727 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:27,755 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 16:01:27,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 16:01:27,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:01:27,756 INFO L87 Difference]: Start difference. First operand 133 states and 261 transitions. Second operand 6 states. [2020-04-18 16:01:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:27,832 INFO L93 Difference]: Finished difference Result 139 states and 268 transitions. [2020-04-18 16:01:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 268 transitions. [2020-04-18 16:01:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:27,832 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:01:27,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:27,833 INFO L82 PathProgramCache]: Analyzing trace with hash -476794784, now seen corresponding path program 4 times [2020-04-18 16:01:27,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:27,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478625846] [2020-04-18 16:01:27,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:27,883 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478625846] [2020-04-18 16:01:27,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:27,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:01:27,884 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:27,885 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:27,889 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 28 transitions. [2020-04-18 16:01:27,889 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:27,909 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:27,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:27,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-04-18 16:01:27,910 INFO L87 Difference]: Start difference. First operand 139 states and 268 transitions. Second operand 5 states. [2020-04-18 16:01:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:27,968 INFO L93 Difference]: Finished difference Result 152 states and 280 transitions. [2020-04-18 16:01:27,968 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 280 transitions. [2020-04-18 16:01:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:27,968 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:01:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash -704227934, now seen corresponding path program 5 times [2020-04-18 16:01:27,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:27,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315977673] [2020-04-18 16:01:27,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:28,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315977673] [2020-04-18 16:01:28,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:28,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 16:01:28,018 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:28,020 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:28,025 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 16:01:28,025 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:28,046 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:28,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 16:01:28,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-04-18 16:01:28,047 INFO L87 Difference]: Start difference. First operand 152 states and 280 transitions. Second operand 7 states. [2020-04-18 16:01:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:28,162 INFO L93 Difference]: Finished difference Result 154 states and 281 transitions. [2020-04-18 16:01:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 281 transitions. [2020-04-18 16:01:28,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:01:28,163 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1428717146] [2020-04-18 16:01:28,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:01:28,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 16:01:28,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1428717146] [2020-04-18 16:01:28,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-18 16:01:28,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:01:28,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 16:01:28,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2020-04-18 16:01:28,164 INFO L87 Difference]: Start difference. First operand 13344 states and 43620 transitions. Second operand 11 states. [2020-04-18 16:01:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:29,786 INFO L93 Difference]: Finished difference Result 45644 states and 140806 transitions. [2020-04-18 16:01:29,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 16:01:29,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-04-18 16:01:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:29,858 INFO L225 Difference]: With dead ends: 45644 [2020-04-18 16:01:29,858 INFO L226 Difference]: Without dead ends: 45592 [2020-04-18 16:01:29,859 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=623, Invalid=2133, Unknown=0, NotChecked=0, Total=2756 [2020-04-18 16:01:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45592 states. [2020-04-18 16:01:30,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45592 to 13053. [2020-04-18 16:01:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13053 states. [2020-04-18 16:01:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13053 states to 13053 states and 42435 transitions. [2020-04-18 16:01:30,345 INFO L78 Accepts]: Start accepts. Automaton has 13053 states and 42435 transitions. Word has length 22 [2020-04-18 16:01:30,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:30,345 INFO L479 AbstractCegarLoop]: Abstraction has 13053 states and 42435 transitions. [2020-04-18 16:01:30,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-18 16:01:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 13053 states and 42435 transitions. [2020-04-18 16:01:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:30,346 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:30,346 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:30,346 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:30,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:30,347 INFO L82 PathProgramCache]: Analyzing trace with hash 804840611, now seen corresponding path program 1 times [2020-04-18 16:01:30,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:30,347 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1902614629] [2020-04-18 16:01:30,347 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:30,349 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 60 transitions. [2020-04-18 16:01:30,349 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-04-18 16:01:30,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:30,349 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:30,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:30,350 INFO L82 PathProgramCache]: Analyzing trace with hash 843384041, now seen corresponding path program 2 times [2020-04-18 16:01:30,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:30,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323507651] [2020-04-18 16:01:30,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 16:01:30,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323507651] [2020-04-18 16:01:30,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:30,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:30,370 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:30,372 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:30,376 INFO L259 McrAutomatonBuilder]: Finished intersection with 41 states and 58 transitions. [2020-04-18 16:01:30,377 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:30,382 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:30,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:30,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:30,382 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2020-04-18 16:01:30,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:30,385 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2020-04-18 16:01:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2020-04-18 16:01:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 16:01:30,386 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:30,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:30,386 INFO L82 PathProgramCache]: Analyzing trace with hash 804840611, now seen corresponding path program 3 times [2020-04-18 16:01:30,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:30,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761746757] [2020-04-18 16:01:30,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:30,536 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-04-18 16:01:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 16:01:30,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761746757] [2020-04-18 16:01:30,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:30,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:30,542 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:30,544 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:30,548 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 16:01:30,548 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:30,558 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:30,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:30,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 16:01:30,558 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 5 states. [2020-04-18 16:01:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:30,581 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2020-04-18 16:01:30,581 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2020-04-18 16:01:30,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:01:30,582 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1902614629] [2020-04-18 16:01:30,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:01:30,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:01:30,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1902614629] [2020-04-18 16:01:30,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 16:01:30,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:01:30,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:30,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:01:30,583 INFO L87 Difference]: Start difference. First operand 13053 states and 42435 transitions. Second operand 5 states. [2020-04-18 16:01:30,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:30,793 INFO L93 Difference]: Finished difference Result 22796 states and 72726 transitions. [2020-04-18 16:01:30,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 16:01:30,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-04-18 16:01:30,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:30,828 INFO L225 Difference]: With dead ends: 22796 [2020-04-18 16:01:30,828 INFO L226 Difference]: Without dead ends: 22772 [2020-04-18 16:01:30,828 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:01:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22772 states. [2020-04-18 16:01:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22772 to 14368. [2020-04-18 16:01:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14368 states. [2020-04-18 16:01:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14368 states to 14368 states and 47032 transitions. [2020-04-18 16:01:31,162 INFO L78 Accepts]: Start accepts. Automaton has 14368 states and 47032 transitions. Word has length 22 [2020-04-18 16:01:31,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:31,162 INFO L479 AbstractCegarLoop]: Abstraction has 14368 states and 47032 transitions. [2020-04-18 16:01:31,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 16:01:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 14368 states and 47032 transitions. [2020-04-18 16:01:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:31,164 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:31,164 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:31,165 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:31,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1897376779, now seen corresponding path program 1 times [2020-04-18 16:01:31,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:31,165 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [600155647] [2020-04-18 16:01:31,166 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:31,172 INFO L259 McrAutomatonBuilder]: Finished intersection with 450 states and 1296 transitions. [2020-04-18 16:01:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states. [2020-04-18 16:01:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:31,175 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:31,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:31,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1773360957, now seen corresponding path program 2 times [2020-04-18 16:01:31,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:31,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203612186] [2020-04-18 16:01:31,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:31,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:31,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203612186] [2020-04-18 16:01:31,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:31,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:31,194 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:31,197 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:31,216 INFO L259 McrAutomatonBuilder]: Finished intersection with 101 states and 190 transitions. [2020-04-18 16:01:31,216 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:31,221 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:31,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:31,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:31,221 INFO L87 Difference]: Start difference. First operand 450 states. Second operand 3 states. [2020-04-18 16:01:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:31,242 INFO L93 Difference]: Finished difference Result 595 states and 1614 transitions. [2020-04-18 16:01:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1614 transitions. [2020-04-18 16:01:31,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:31,243 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:31,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:31,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2029608837, now seen corresponding path program 3 times [2020-04-18 16:01:31,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:31,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212690085] [2020-04-18 16:01:31,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:31,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212690085] [2020-04-18 16:01:31,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:31,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:31,261 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:31,263 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:31,284 INFO L259 McrAutomatonBuilder]: Finished intersection with 102 states and 194 transitions. [2020-04-18 16:01:31,284 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:31,303 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 16:01:31,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:31,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-04-18 16:01:31,303 INFO L87 Difference]: Start difference. First operand 595 states and 1614 transitions. Second operand 5 states. [2020-04-18 16:01:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:31,345 INFO L93 Difference]: Finished difference Result 683 states and 1812 transitions. [2020-04-18 16:01:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1812 transitions. [2020-04-18 16:01:31,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:31,346 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:01:31,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:31,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1940213187, now seen corresponding path program 4 times [2020-04-18 16:01:31,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:31,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624591863] [2020-04-18 16:01:31,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:31,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624591863] [2020-04-18 16:01:31,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:31,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:01:31,377 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:31,380 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:31,397 INFO L259 McrAutomatonBuilder]: Finished intersection with 102 states and 192 transitions. [2020-04-18 16:01:31,397 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:31,414 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:31,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:31,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-04-18 16:01:31,414 INFO L87 Difference]: Start difference. First operand 683 states and 1812 transitions. Second operand 5 states. [2020-04-18 16:01:31,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:31,505 INFO L93 Difference]: Finished difference Result 941 states and 2380 transitions. [2020-04-18 16:01:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2380 transitions. [2020-04-18 16:01:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:31,506 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:01:31,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:31,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1897381399, now seen corresponding path program 5 times [2020-04-18 16:01:31,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:31,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008873579] [2020-04-18 16:01:31,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:01:31,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008873579] [2020-04-18 16:01:31,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034555822] [2020-04-18 16:01:31,557 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:31,647 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 16:01:31,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:31,649 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2020-04-18 16:01:31,650 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:01:31,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:31,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-04-18 16:01:31,732 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:31,734 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:31,749 INFO L259 McrAutomatonBuilder]: Finished intersection with 86 states and 148 transitions. [2020-04-18 16:01:31,749 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:32,032 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 19 times. [2020-04-18 16:01:32,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-04-18 16:01:32,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2020-04-18 16:01:32,032 INFO L87 Difference]: Start difference. First operand 941 states and 2380 transitions. Second operand 24 states. [2020-04-18 16:01:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:32,975 INFO L93 Difference]: Finished difference Result 956 states and 2398 transitions. [2020-04-18 16:01:32,975 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2398 transitions. [2020-04-18 16:01:32,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:32,977 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 16:01:32,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:32,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1897376779, now seen corresponding path program 6 times [2020-04-18 16:01:32,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:32,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675701123] [2020-04-18 16:01:32,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:01:33,041 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675701123] [2020-04-18 16:01:33,041 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009292449] [2020-04-18 16:01:33,041 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:33,145 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2020-04-18 16:01:33,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:33,146 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2020-04-18 16:01:33,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:01:33,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:33,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2020-04-18 16:01:33,254 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:33,257 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:33,277 INFO L259 McrAutomatonBuilder]: Finished intersection with 75 states and 122 transitions. [2020-04-18 16:01:33,277 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:33,548 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 8 times. [2020-04-18 16:01:33,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-04-18 16:01:33,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=2409, Unknown=0, NotChecked=0, Total=2970 [2020-04-18 16:01:33,549 INFO L87 Difference]: Start difference. First operand 956 states and 2398 transitions. Second operand 21 states. [2020-04-18 16:01:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:35,489 INFO L93 Difference]: Finished difference Result 1090 states and 2649 transitions. [2020-04-18 16:01:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 2649 transitions. [2020-04-18 16:01:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:35,491 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 16:01:35,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:35,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1360290455, now seen corresponding path program 7 times [2020-04-18 16:01:35,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:35,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553044074] [2020-04-18 16:01:35,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:35,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553044074] [2020-04-18 16:01:35,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070289710] [2020-04-18 16:01:35,562 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:35,659 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 16:01:35,660 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:35,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:35,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-04-18 16:01:35,716 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:35,719 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:35,735 INFO L259 McrAutomatonBuilder]: Finished intersection with 70 states and 116 transitions. [2020-04-18 16:01:35,736 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:36,183 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 35 times. [2020-04-18 16:01:36,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-04-18 16:01:36,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=7782, Unknown=0, NotChecked=0, Total=9506 [2020-04-18 16:01:36,185 INFO L87 Difference]: Start difference. First operand 1090 states and 2649 transitions. Second operand 31 states. [2020-04-18 16:01:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:37,283 INFO L93 Difference]: Finished difference Result 1091 states and 2649 transitions. [2020-04-18 16:01:37,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 2649 transitions. [2020-04-18 16:01:37,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:37,285 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 16:01:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1360285835, now seen corresponding path program 8 times [2020-04-18 16:01:37,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:37,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705918672] [2020-04-18 16:01:37,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:37,341 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705918672] [2020-04-18 16:01:37,341 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867245619] [2020-04-18 16:01:37,341 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:37,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-04-18 16:01:37,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:37,432 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2020-04-18 16:01:37,433 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:37,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:37,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2020-04-18 16:01:37,544 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:37,548 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:37,561 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 90 transitions. [2020-04-18 16:01:37,561 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:37,897 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 28 times. [2020-04-18 16:01:37,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-04-18 16:01:37,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2312, Invalid=11968, Unknown=0, NotChecked=0, Total=14280 [2020-04-18 16:01:37,899 INFO L87 Difference]: Start difference. First operand 1091 states and 2649 transitions. Second operand 31 states. [2020-04-18 16:01:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:40,355 INFO L93 Difference]: Finished difference Result 1217 states and 2944 transitions. [2020-04-18 16:01:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 2944 transitions. [2020-04-18 16:01:40,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:01:40,357 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [600155647] [2020-04-18 16:01:40,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:01:40,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 16:01:40,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [600155647] [2020-04-18 16:01:40,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2020-04-18 16:01:40,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:01:40,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2020-04-18 16:01:40,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3411, Invalid=18641, Unknown=0, NotChecked=0, Total=22052 [2020-04-18 16:01:40,359 INFO L87 Difference]: Start difference. First operand 14368 states and 47032 transitions. Second operand 61 states. [2020-04-18 16:01:54,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:54,586 INFO L93 Difference]: Finished difference Result 52699 states and 161375 transitions. [2020-04-18 16:01:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2020-04-18 16:01:54,587 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 26 [2020-04-18 16:01:54,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:01:54,673 INFO L225 Difference]: With dead ends: 52699 [2020-04-18 16:01:54,673 INFO L226 Difference]: Without dead ends: 52633 [2020-04-18 16:01:54,677 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 487 SyntacticMatches, 4 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48402 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=18308, Invalid=105244, Unknown=0, NotChecked=0, Total=123552 [2020-04-18 16:01:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52633 states. [2020-04-18 16:01:55,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52633 to 14062. [2020-04-18 16:01:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14062 states. [2020-04-18 16:01:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14062 states to 14062 states and 46098 transitions. [2020-04-18 16:01:55,339 INFO L78 Accepts]: Start accepts. Automaton has 14062 states and 46098 transitions. Word has length 26 [2020-04-18 16:01:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:01:55,339 INFO L479 AbstractCegarLoop]: Abstraction has 14062 states and 46098 transitions. [2020-04-18 16:01:55,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 61 states. [2020-04-18 16:01:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 14062 states and 46098 transitions. [2020-04-18 16:01:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:55,342 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:01:55,342 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:01:56,143 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:56,144 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:01:56,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:56,145 INFO L82 PathProgramCache]: Analyzing trace with hash 580831221, now seen corresponding path program 1 times [2020-04-18 16:01:56,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:01:56,145 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [869369286] [2020-04-18 16:01:56,146 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:56,153 INFO L259 McrAutomatonBuilder]: Finished intersection with 410 states and 1164 transitions. [2020-04-18 16:01:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2020-04-18 16:01:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:56,155 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:01:56,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:56,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1773301651, now seen corresponding path program 2 times [2020-04-18 16:01:56,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:56,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877065730] [2020-04-18 16:01:56,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:56,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877065730] [2020-04-18 16:01:56,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:56,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:01:56,171 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:56,174 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:56,194 INFO L259 McrAutomatonBuilder]: Finished intersection with 101 states and 190 transitions. [2020-04-18 16:01:56,194 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:56,200 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:56,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:01:56,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:01:56,200 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2020-04-18 16:01:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:56,215 INFO L93 Difference]: Finished difference Result 535 states and 1426 transitions. [2020-04-18 16:01:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1426 transitions. [2020-04-18 16:01:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:56,216 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:01:56,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:56,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2029668143, now seen corresponding path program 3 times [2020-04-18 16:01:56,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:56,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558687614] [2020-04-18 16:01:56,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:01:56,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558687614] [2020-04-18 16:01:56,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:56,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:01:56,234 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:56,238 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:56,270 INFO L259 McrAutomatonBuilder]: Finished intersection with 102 states and 194 transitions. [2020-04-18 16:01:56,270 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:56,297 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 16:01:56,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:56,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-04-18 16:01:56,297 INFO L87 Difference]: Start difference. First operand 535 states and 1426 transitions. Second operand 5 states. [2020-04-18 16:01:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:56,368 INFO L93 Difference]: Finished difference Result 591 states and 1544 transitions. [2020-04-18 16:01:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1544 transitions. [2020-04-18 16:01:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:56,369 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:01:56,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:56,370 INFO L82 PathProgramCache]: Analyzing trace with hash -734655335, now seen corresponding path program 4 times [2020-04-18 16:01:56,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:56,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174598726] [2020-04-18 16:01:56,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:56,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174598726] [2020-04-18 16:01:56,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:56,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:01:56,432 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:56,437 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:56,460 INFO L259 McrAutomatonBuilder]: Finished intersection with 78 states and 136 transitions. [2020-04-18 16:01:56,461 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:56,487 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:01:56,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-04-18 16:01:56,488 INFO L87 Difference]: Start difference. First operand 591 states and 1544 transitions. Second operand 5 states. [2020-04-18 16:01:56,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:56,603 INFO L93 Difference]: Finished difference Result 789 states and 1948 transitions. [2020-04-18 16:01:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1948 transitions. [2020-04-18 16:01:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:56,605 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:01:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:56,606 INFO L82 PathProgramCache]: Analyzing trace with hash 808752741, now seen corresponding path program 5 times [2020-04-18 16:01:56,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:56,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536667691] [2020-04-18 16:01:56,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:56,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536667691] [2020-04-18 16:01:56,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838633914] [2020-04-18 16:01:56,659 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:56,759 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 16:01:56,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:56,760 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2020-04-18 16:01:56,761 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:56,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:56,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-04-18 16:01:56,829 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:56,832 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:56,845 INFO L259 McrAutomatonBuilder]: Finished intersection with 62 states and 96 transitions. [2020-04-18 16:01:56,845 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:56,930 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:56,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 16:01:56,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2020-04-18 16:01:56,931 INFO L87 Difference]: Start difference. First operand 789 states and 1948 transitions. Second operand 13 states. [2020-04-18 16:01:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:57,521 INFO L93 Difference]: Finished difference Result 920 states and 2170 transitions. [2020-04-18 16:01:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2170 transitions. [2020-04-18 16:01:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:57,522 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 16:01:57,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash 580831221, now seen corresponding path program 6 times [2020-04-18 16:01:57,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:57,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126303445] [2020-04-18 16:01:57,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:57,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126303445] [2020-04-18 16:01:57,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061568851] [2020-04-18 16:01:57,579 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:01:57,666 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2020-04-18 16:01:57,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:01:57,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2020-04-18 16:01:57,668 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:01:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 16:01:57,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:01:57,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2020-04-18 16:01:57,774 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:57,776 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:57,788 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 90 transitions. [2020-04-18 16:01:57,788 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:57,906 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:57,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 16:01:57,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1107, Unknown=0, NotChecked=0, Total=1406 [2020-04-18 16:01:57,907 INFO L87 Difference]: Start difference. First operand 920 states and 2170 transitions. Second operand 17 states. [2020-04-18 16:01:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:59,325 INFO L93 Difference]: Finished difference Result 996 states and 2288 transitions. [2020-04-18 16:01:59,326 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 2288 transitions. [2020-04-18 16:01:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:59,327 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 16:01:59,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:59,327 INFO L82 PathProgramCache]: Analyzing trace with hash 431465991, now seen corresponding path program 7 times [2020-04-18 16:01:59,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:59,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717235983] [2020-04-18 16:01:59,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:59,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:59,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717235983] [2020-04-18 16:01:59,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:59,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 16:01:59,385 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:59,388 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:59,395 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 32 transitions. [2020-04-18 16:01:59,395 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:59,447 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:01:59,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 16:01:59,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=920, Invalid=3772, Unknown=0, NotChecked=0, Total=4692 [2020-04-18 16:01:59,448 INFO L87 Difference]: Start difference. First operand 996 states and 2288 transitions. Second operand 7 states. [2020-04-18 16:01:59,715 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-04-18 16:01:59,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:01:59,901 INFO L93 Difference]: Finished difference Result 1083 states and 2453 transitions. [2020-04-18 16:01:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 2453 transitions. [2020-04-18 16:01:59,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:01:59,903 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 16:01:59,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:01:59,903 INFO L82 PathProgramCache]: Analyzing trace with hash 431445621, now seen corresponding path program 8 times [2020-04-18 16:01:59,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:01:59,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858070872] [2020-04-18 16:01:59,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:01:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:01:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:01:59,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858070872] [2020-04-18 16:01:59,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:01:59,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 16:01:59,961 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:01:59,963 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:01:59,968 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2020-04-18 16:01:59,968 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:01:59,969 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:01:59,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 16:01:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1060, Invalid=4792, Unknown=0, NotChecked=0, Total=5852 [2020-04-18 16:01:59,969 INFO L87 Difference]: Start difference. First operand 1083 states and 2453 transitions. Second operand 9 states. [2020-04-18 16:02:00,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:00,541 INFO L93 Difference]: Finished difference Result 1107 states and 2493 transitions. [2020-04-18 16:02:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 2493 transitions. [2020-04-18 16:02:00,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:02:00,543 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [869369286] [2020-04-18 16:02:00,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:02:00,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 16:02:00,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [869369286] [2020-04-18 16:02:00,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-04-18 16:02:00,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:02:00,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-04-18 16:02:00,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1348, Invalid=6842, Unknown=0, NotChecked=0, Total=8190 [2020-04-18 16:02:00,545 INFO L87 Difference]: Start difference. First operand 14062 states and 46098 transitions. Second operand 26 states. [2020-04-18 16:02:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:07,742 INFO L93 Difference]: Finished difference Result 54505 states and 167344 transitions. [2020-04-18 16:02:07,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2020-04-18 16:02:07,743 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2020-04-18 16:02:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:02:07,832 INFO L225 Difference]: With dead ends: 54505 [2020-04-18 16:02:07,832 INFO L226 Difference]: Without dead ends: 54388 [2020-04-18 16:02:07,833 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16078 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5590, Invalid=35012, Unknown=0, NotChecked=0, Total=40602 [2020-04-18 16:02:08,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54388 states. [2020-04-18 16:02:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54388 to 13489. [2020-04-18 16:02:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13489 states. [2020-04-18 16:02:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13489 states to 13489 states and 44110 transitions. [2020-04-18 16:02:08,398 INFO L78 Accepts]: Start accepts. Automaton has 13489 states and 44110 transitions. Word has length 26 [2020-04-18 16:02:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:02:08,399 INFO L479 AbstractCegarLoop]: Abstraction has 13489 states and 44110 transitions. [2020-04-18 16:02:08,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-04-18 16:02:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 13489 states and 44110 transitions. [2020-04-18 16:02:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:08,401 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:02:08,401 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:02:08,802 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:02:08,803 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:02:08,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:08,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2090404415, now seen corresponding path program 1 times [2020-04-18 16:02:08,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:02:08,804 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1452704149] [2020-04-18 16:02:08,805 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:08,809 INFO L259 McrAutomatonBuilder]: Finished intersection with 170 states and 372 transitions. [2020-04-18 16:02:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states. [2020-04-18 16:02:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:08,810 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:02:08,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:08,810 INFO L82 PathProgramCache]: Analyzing trace with hash 360227405, now seen corresponding path program 2 times [2020-04-18 16:02:08,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:08,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376997610] [2020-04-18 16:02:08,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 16:02:08,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376997610] [2020-04-18 16:02:08,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:02:08,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:02:08,826 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:08,828 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:08,849 INFO L259 McrAutomatonBuilder]: Finished intersection with 117 states and 230 transitions. [2020-04-18 16:02:08,849 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:08,854 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:02:08,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:02:08,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:02:08,855 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 3 states. [2020-04-18 16:02:08,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:08,864 INFO L93 Difference]: Finished difference Result 205 states and 421 transitions. [2020-04-18 16:02:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 421 transitions. [2020-04-18 16:02:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:08,865 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:02:08,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:08,865 INFO L82 PathProgramCache]: Analyzing trace with hash -131770097, now seen corresponding path program 3 times [2020-04-18 16:02:08,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:08,866 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943760659] [2020-04-18 16:02:08,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-04-18 16:02:08,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943760659] [2020-04-18 16:02:08,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:02:08,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 16:02:08,896 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:08,899 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:08,925 INFO L259 McrAutomatonBuilder]: Finished intersection with 102 states and 188 transitions. [2020-04-18 16:02:08,925 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:08,940 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:02:08,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 16:02:08,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 16:02:08,941 INFO L87 Difference]: Start difference. First operand 205 states and 421 transitions. Second operand 5 states. [2020-04-18 16:02:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:09,000 INFO L93 Difference]: Finished difference Result 217 states and 433 transitions. [2020-04-18 16:02:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 433 transitions. [2020-04-18 16:02:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:09,001 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:02:09,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:09,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2090404415, now seen corresponding path program 4 times [2020-04-18 16:02:09,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:09,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563971175] [2020-04-18 16:02:09,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-04-18 16:02:09,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563971175] [2020-04-18 16:02:09,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689832732] [2020-04-18 16:02:09,226 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:02:09,328 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 16:02:09,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:02:09,329 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 16:02:09,333 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:02:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-04-18 16:02:09,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:02:09,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 16:02:09,407 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:09,410 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:09,429 INFO L259 McrAutomatonBuilder]: Finished intersection with 75 states and 122 transitions. [2020-04-18 16:02:09,429 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:09,484 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:02:09,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 16:02:09,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 16:02:09,485 INFO L87 Difference]: Start difference. First operand 217 states and 433 transitions. Second operand 12 states. [2020-04-18 16:02:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:09,644 INFO L93 Difference]: Finished difference Result 219 states and 434 transitions. [2020-04-18 16:02:09,644 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 434 transitions. [2020-04-18 16:02:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:09,644 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:02:09,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:09,645 INFO L82 PathProgramCache]: Analyzing trace with hash 954294029, now seen corresponding path program 5 times [2020-04-18 16:02:09,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:09,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334354842] [2020-04-18 16:02:09,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-04-18 16:02:09,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334354842] [2020-04-18 16:02:09,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:02:09,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:02:09,659 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:09,661 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:09,669 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 52 transitions. [2020-04-18 16:02:09,669 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:09,677 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:02:09,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:02:09,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 16:02:09,678 INFO L87 Difference]: Start difference. First operand 219 states and 434 transitions. Second operand 3 states. [2020-04-18 16:02:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:09,684 INFO L93 Difference]: Finished difference Result 229 states and 443 transitions. [2020-04-18 16:02:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 443 transitions. [2020-04-18 16:02:09,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:02:09,685 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1452704149] [2020-04-18 16:02:09,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:02:09,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 16:02:09,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1452704149] [2020-04-18 16:02:09,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 16:02:09,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:02:09,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 16:02:09,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 16:02:09,686 INFO L87 Difference]: Start difference. First operand 13489 states and 44110 transitions. Second operand 13 states. [2020-04-18 16:02:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:10,556 INFO L93 Difference]: Finished difference Result 29156 states and 92023 transitions. [2020-04-18 16:02:10,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 16:02:10,556 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-04-18 16:02:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:02:10,602 INFO L225 Difference]: With dead ends: 29156 [2020-04-18 16:02:10,602 INFO L226 Difference]: Without dead ends: 29120 [2020-04-18 16:02:10,603 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 16:02:10,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29120 states. [2020-04-18 16:02:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29120 to 13418. [2020-04-18 16:02:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13418 states. [2020-04-18 16:02:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13418 states to 13418 states and 43847 transitions. [2020-04-18 16:02:10,974 INFO L78 Accepts]: Start accepts. Automaton has 13418 states and 43847 transitions. Word has length 26 [2020-04-18 16:02:10,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:02:10,974 INFO L479 AbstractCegarLoop]: Abstraction has 13418 states and 43847 transitions. [2020-04-18 16:02:10,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 16:02:10,974 INFO L276 IsEmpty]: Start isEmpty. Operand 13418 states and 43847 transitions. [2020-04-18 16:02:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:10,977 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:02:10,977 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:02:11,177 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:02:11,178 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:02:11,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1259126849, now seen corresponding path program 1 times [2020-04-18 16:02:11,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:02:11,179 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1119400501] [2020-04-18 16:02:11,180 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:11,184 INFO L259 McrAutomatonBuilder]: Finished intersection with 138 states and 292 transitions. [2020-04-18 16:02:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2020-04-18 16:02:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:11,185 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:02:11,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:11,185 INFO L82 PathProgramCache]: Analyzing trace with hash -274585011, now seen corresponding path program 2 times [2020-04-18 16:02:11,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:11,185 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119863090] [2020-04-18 16:02:11,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 16:02:11,197 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119863090] [2020-04-18 16:02:11,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:02:11,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:02:11,198 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:11,200 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:11,211 INFO L259 McrAutomatonBuilder]: Finished intersection with 85 states and 160 transitions. [2020-04-18 16:02:11,211 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:11,216 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:02:11,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:02:11,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:02:11,216 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2020-04-18 16:02:11,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:11,225 INFO L93 Difference]: Finished difference Result 165 states and 329 transitions. [2020-04-18 16:02:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 329 transitions. [2020-04-18 16:02:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:11,226 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:02:11,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash -408826367, now seen corresponding path program 3 times [2020-04-18 16:02:11,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:11,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384033297] [2020-04-18 16:02:11,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 16:02:11,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384033297] [2020-04-18 16:02:11,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:02:11,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:02:11,256 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:11,258 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:11,267 INFO L259 McrAutomatonBuilder]: Finished intersection with 49 states and 69 transitions. [2020-04-18 16:02:11,267 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:11,271 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:02:11,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:02:11,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 16:02:11,271 INFO L87 Difference]: Start difference. First operand 165 states and 329 transitions. Second operand 3 states. [2020-04-18 16:02:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:11,277 INFO L93 Difference]: Finished difference Result 174 states and 338 transitions. [2020-04-18 16:02:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 338 transitions. [2020-04-18 16:02:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:11,278 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:02:11,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:11,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1259114219, now seen corresponding path program 4 times [2020-04-18 16:02:11,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:11,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518556641] [2020-04-18 16:02:11,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 16:02:11,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518556641] [2020-04-18 16:02:11,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308513707] [2020-04-18 16:02:11,325 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:02:11,437 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 16:02:11,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:02:11,439 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2020-04-18 16:02:11,440 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:02:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 16:02:11,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:02:11,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-04-18 16:02:11,468 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:11,471 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:11,486 INFO L259 McrAutomatonBuilder]: Finished intersection with 78 states and 136 transitions. [2020-04-18 16:02:11,486 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:11,643 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 25 times. [2020-04-18 16:02:11,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 16:02:11,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2020-04-18 16:02:11,644 INFO L87 Difference]: Start difference. First operand 174 states and 338 transitions. Second operand 17 states. [2020-04-18 16:02:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:11,804 INFO L93 Difference]: Finished difference Result 187 states and 350 transitions. [2020-04-18 16:02:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 350 transitions. [2020-04-18 16:02:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:11,805 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:02:11,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:11,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1259126849, now seen corresponding path program 5 times [2020-04-18 16:02:11,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:11,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876954567] [2020-04-18 16:02:11,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 16:02:11,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876954567] [2020-04-18 16:02:11,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568357817] [2020-04-18 16:02:11,846 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:02:11,938 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-04-18 16:02:11,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:02:11,939 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 16:02:11,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:02:11,984 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 16:02:11,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:02:11,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 16:02:11,985 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:11,988 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:12,003 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 90 transitions. [2020-04-18 16:02:12,003 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:12,098 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 16 times. [2020-04-18 16:02:12,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-18 16:02:12,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2020-04-18 16:02:12,099 INFO L87 Difference]: Start difference. First operand 187 states and 350 transitions. Second operand 18 states. [2020-04-18 16:02:12,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:12,399 INFO L93 Difference]: Finished difference Result 189 states and 351 transitions. [2020-04-18 16:02:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 351 transitions. [2020-04-18 16:02:12,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:02:12,401 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1119400501] [2020-04-18 16:02:12,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:02:12,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 16:02:12,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1119400501] [2020-04-18 16:02:12,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-04-18 16:02:12,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:02:12,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-04-18 16:02:12,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2020-04-18 16:02:12,402 INFO L87 Difference]: Start difference. First operand 13418 states and 43847 transitions. Second operand 22 states. [2020-04-18 16:02:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:14,456 INFO L93 Difference]: Finished difference Result 31002 states and 98548 transitions. [2020-04-18 16:02:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 16:02:14,456 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2020-04-18 16:02:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 16:02:14,505 INFO L225 Difference]: With dead ends: 31002 [2020-04-18 16:02:14,505 INFO L226 Difference]: Without dead ends: 30966 [2020-04-18 16:02:14,506 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 196 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=998, Invalid=3034, Unknown=0, NotChecked=0, Total=4032 [2020-04-18 16:02:14,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30966 states. [2020-04-18 16:02:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30966 to 13888. [2020-04-18 16:02:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13888 states. [2020-04-18 16:02:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13888 states to 13888 states and 45598 transitions. [2020-04-18 16:02:14,896 INFO L78 Accepts]: Start accepts. Automaton has 13888 states and 45598 transitions. Word has length 26 [2020-04-18 16:02:14,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 16:02:14,896 INFO L479 AbstractCegarLoop]: Abstraction has 13888 states and 45598 transitions. [2020-04-18 16:02:14,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-04-18 16:02:14,896 INFO L276 IsEmpty]: Start isEmpty. Operand 13888 states and 45598 transitions. [2020-04-18 16:02:14,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:14,899 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 16:02:14,899 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 16:02:15,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:02:15,300 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 16:02:15,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:15,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1815374016, now seen corresponding path program 1 times [2020-04-18 16:02:15,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 16:02:15,301 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1229619233] [2020-04-18 16:02:15,302 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:15,309 INFO L259 McrAutomatonBuilder]: Finished intersection with 402 states and 1144 transitions. [2020-04-18 16:02:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states. [2020-04-18 16:02:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:15,311 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 16:02:15,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:15,311 INFO L82 PathProgramCache]: Analyzing trace with hash 87538582, now seen corresponding path program 2 times [2020-04-18 16:02:15,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:15,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121277684] [2020-04-18 16:02:15,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:02:15,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121277684] [2020-04-18 16:02:15,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:02:15,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 16:02:15,328 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:15,330 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:15,353 INFO L259 McrAutomatonBuilder]: Finished intersection with 117 states and 244 transitions. [2020-04-18 16:02:15,353 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:15,359 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:02:15,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 16:02:15,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 16:02:15,360 INFO L87 Difference]: Start difference. First operand 402 states. Second operand 3 states. [2020-04-18 16:02:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:15,374 INFO L93 Difference]: Finished difference Result 523 states and 1398 transitions. [2020-04-18 16:02:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 1398 transitions. [2020-04-18 16:02:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:15,375 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 16:02:15,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:15,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2026142016, now seen corresponding path program 3 times [2020-04-18 16:02:15,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:15,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013504605] [2020-04-18 16:02:15,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 16:02:15,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013504605] [2020-04-18 16:02:15,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:02:15,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 16:02:15,402 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:15,403 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:15,419 INFO L259 McrAutomatonBuilder]: Finished intersection with 97 states and 184 transitions. [2020-04-18 16:02:15,419 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:15,448 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 16:02:15,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 16:02:15,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 16:02:15,449 INFO L87 Difference]: Start difference. First operand 523 states and 1398 transitions. Second operand 6 states. [2020-04-18 16:02:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:15,547 INFO L93 Difference]: Finished difference Result 579 states and 1516 transitions. [2020-04-18 16:02:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1516 transitions. [2020-04-18 16:02:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:15,549 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 16:02:15,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:15,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2014506890, now seen corresponding path program 4 times [2020-04-18 16:02:15,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:15,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779692756] [2020-04-18 16:02:15,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:02:15,581 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779692756] [2020-04-18 16:02:15,581 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372597177] [2020-04-18 16:02:15,581 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:02:15,672 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 16:02:15,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:02:15,673 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2020-04-18 16:02:15,674 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:02:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:02:15,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:02:15,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-04-18 16:02:15,699 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:15,701 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:15,712 INFO L259 McrAutomatonBuilder]: Finished intersection with 54 states and 84 transitions. [2020-04-18 16:02:15,712 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:15,947 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 19 times. [2020-04-18 16:02:15,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 16:02:15,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2020-04-18 16:02:15,947 INFO L87 Difference]: Start difference. First operand 579 states and 1516 transitions. Second operand 19 states. [2020-04-18 16:02:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:16,408 INFO L93 Difference]: Finished difference Result 597 states and 1536 transitions. [2020-04-18 16:02:16,408 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1536 transitions. [2020-04-18 16:02:16,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:16,409 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 16:02:16,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:16,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2042807166, now seen corresponding path program 5 times [2020-04-18 16:02:16,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:16,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160594316] [2020-04-18 16:02:16,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:02:16,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160594316] [2020-04-18 16:02:16,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951233429] [2020-04-18 16:02:16,452 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:02:16,541 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 16:02:16,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:02:16,543 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 16:02:16,543 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:02:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:02:16,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:02:16,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-04-18 16:02:16,710 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:16,713 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:16,722 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 64 transitions. [2020-04-18 16:02:16,722 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:16,790 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 8 times. [2020-04-18 16:02:16,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 16:02:16,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2020-04-18 16:02:16,791 INFO L87 Difference]: Start difference. First operand 597 states and 1536 transitions. Second operand 16 states. [2020-04-18 16:02:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:17,315 INFO L93 Difference]: Finished difference Result 852 states and 2040 transitions. [2020-04-18 16:02:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 2040 transitions. [2020-04-18 16:02:17,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:17,316 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 16:02:17,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:17,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1815374016, now seen corresponding path program 6 times [2020-04-18 16:02:17,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:17,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48965016] [2020-04-18 16:02:17,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:02:17,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48965016] [2020-04-18 16:02:17,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711155802] [2020-04-18 16:02:17,408 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:02:17,512 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2020-04-18 16:02:17,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 16:02:17,513 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2020-04-18 16:02:17,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 16:02:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 16:02:17,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 16:02:17,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2020-04-18 16:02:17,610 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:17,611 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:17,621 INFO L259 McrAutomatonBuilder]: Finished intersection with 43 states and 58 transitions. [2020-04-18 16:02:17,621 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:17,825 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 8 times. [2020-04-18 16:02:17,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-04-18 16:02:17,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=2189, Unknown=0, NotChecked=0, Total=2652 [2020-04-18 16:02:17,826 INFO L87 Difference]: Start difference. First operand 852 states and 2040 transitions. Second operand 21 states. [2020-04-18 16:02:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:19,480 INFO L93 Difference]: Finished difference Result 928 states and 2158 transitions. [2020-04-18 16:02:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 2158 transitions. [2020-04-18 16:02:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:19,482 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 16:02:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1755840160, now seen corresponding path program 7 times [2020-04-18 16:02:19,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:19,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518308230] [2020-04-18 16:02:19,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:02:19,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518308230] [2020-04-18 16:02:19,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:02:19,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 16:02:19,538 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:19,540 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:19,545 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 32 transitions. [2020-04-18 16:02:19,546 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:19,593 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 16:02:19,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 16:02:19,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1240, Invalid=5402, Unknown=0, NotChecked=0, Total=6642 [2020-04-18 16:02:19,595 INFO L87 Difference]: Start difference. First operand 928 states and 2158 transitions. Second operand 7 states. [2020-04-18 16:02:19,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:19,906 INFO L93 Difference]: Finished difference Result 1015 states and 2323 transitions. [2020-04-18 16:02:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 2323 transitions. [2020-04-18 16:02:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 16:02:19,908 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 16:02:19,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 16:02:19,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1755372160, now seen corresponding path program 8 times [2020-04-18 16:02:19,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 16:02:19,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416514810] [2020-04-18 16:02:19,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 16:02:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 16:02:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 16:02:19,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416514810] [2020-04-18 16:02:19,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 16:02:19,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 16:02:19,970 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 16:02:19,971 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 16:02:19,977 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2020-04-18 16:02:19,977 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 16:02:19,978 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 16:02:19,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 16:02:19,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1411, Invalid=6599, Unknown=0, NotChecked=0, Total=8010 [2020-04-18 16:02:19,978 INFO L87 Difference]: Start difference. First operand 1015 states and 2323 transitions. Second operand 9 states. [2020-04-18 16:02:20,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 16:02:20,607 INFO L93 Difference]: Finished difference Result 1039 states and 2363 transitions. [2020-04-18 16:02:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 2363 transitions. [2020-04-18 16:02:20,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 16:02:20,609 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1229619233] [2020-04-18 16:02:20,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 16:02:20,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 16:02:20,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1229619233] [2020-04-18 16:02:20,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-04-18 16:02:20,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 16:02:20,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-04-18 16:02:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1757, Invalid=8955, Unknown=0, NotChecked=0, Total=10712 [2020-04-18 16:02:20,611 INFO L87 Difference]: Start difference. First operand 13888 states and 45598 transitions. Second operand 40 states. Received shutdown request... [2020-04-18 16:02:23,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2020-04-18 16:02:24,209 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 16:02:24,209 WARN L544 AbstractCegarLoop]: Verification canceled [2020-04-18 16:02:24,215 WARN L228 ceAbstractionStarter]: Timeout [2020-04-18 16:02:24,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 04:02:24 BasicIcfg [2020-04-18 16:02:24,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-18 16:02:24,217 INFO L168 Benchmark]: Toolchain (without parser) took 207985.28 ms. Allocated memory was 145.8 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 102.8 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2020-04-18 16:02:24,217 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-04-18 16:02:24,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.32 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 100.9 MB in the beginning and 163.6 MB in the end (delta: -62.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-04-18 16:02:24,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.16 ms. Allocated memory is still 204.5 MB. Free memory was 163.6 MB in the beginning and 161.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-04-18 16:02:24,218 INFO L168 Benchmark]: Boogie Preprocessor took 44.46 ms. Allocated memory is still 204.5 MB. Free memory was 161.5 MB in the beginning and 159.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-04-18 16:02:24,218 INFO L168 Benchmark]: RCFGBuilder took 475.44 ms. Allocated memory is still 204.5 MB. Free memory was 159.5 MB in the beginning and 136.3 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-04-18 16:02:24,219 INFO L168 Benchmark]: TraceAbstraction took 206615.87 ms. Allocated memory was 204.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 136.3 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2020-04-18 16:02:24,220 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.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.32 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 100.9 MB in the beginning and 163.6 MB in the end (delta: -62.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.16 ms. Allocated memory is still 204.5 MB. Free memory was 163.6 MB in the beginning and 161.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.46 ms. Allocated memory is still 204.5 MB. Free memory was 161.5 MB in the beginning and 159.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 475.44 ms. Allocated memory is still 204.5 MB. Free memory was 159.5 MB in the beginning and 136.3 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 206615.87 ms. Allocated memory was 204.5 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 136.3 MB in the beginning and 1.3 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 77 ProgramPointsBefore, 18 ProgramPointsAfterwards, 76 TransitionsBefore, 12 TransitionsAfterwards, 1242 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 13 ConcurrentYvCompositions, 5 ChoiceCompositions, 716 VarBasedMoverChecksPositive, 4 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1089 CheckedPairsTotal, 77 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 107 ProgramPointsBefore, 36 ProgramPointsAfterwards, 105 TransitionsBefore, 28 TransitionsAfterwards, 2844 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 1556 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3611 CheckedPairsTotal, 94 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 137 ProgramPointsBefore, 49 ProgramPointsAfterwards, 134 TransitionsBefore, 38 TransitionsAfterwards, 5130 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 15 ConcurrentYvCompositions, 8 ChoiceCompositions, 2775 VarBasedMoverChecksPositive, 41 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 7576 CheckedPairsTotal, 120 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 167 ProgramPointsBefore, 59 ProgramPointsAfterwards, 163 TransitionsBefore, 45 TransitionsAfterwards, 8100 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 20 ConcurrentYvCompositions, 10 ChoiceCompositions, 4127 VarBasedMoverChecksPositive, 47 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 11405 CheckedPairsTotal, 148 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 197 ProgramPointsBefore, 73 ProgramPointsAfterwards, 192 TransitionsBefore, 56 TransitionsAfterwards, 11754 CoEnabledTransitionPairs, 7 FixpointIterations, 69 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 26 ConcurrentYvCompositions, 12 ChoiceCompositions, 6175 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 17538 CheckedPairsTotal, 176 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 678]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 678). Cancelled while BasicCegarLoop was constructing difference of abstraction (13888states) and FLOYD_HOARE automaton (currently 72 states, 40 states before enhancement),while ReachableStatesComputation was computing reachable states (1255 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 71 locations, 1 error locations. Started 5 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 206.2s, OverallIterations: 40, TraceHistogramMax: 5, AutomataDifference: 71.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 43.3s, HoareTripleCheckerStatistics: 1767 SDtfs, 15662 SDslu, 11214 SDs, 0 SdLazy, 22086 SolverSat, 4163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4687 GetRequests, 3245 SyntacticMatches, 10 SemanticMatches, 1432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83861 ImplicationChecksByTransitivity, 30.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127498occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 50.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 498903 StatesRemovedByMinimization, 33 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 could not prove your program: Timeout Completed graceful shutdown