/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-ext/45_monabsex1_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 12:05:20,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 12:05:20,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 12:05:20,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 12:05:20,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 12:05:20,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 12:05:20,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 12:05:20,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 12:05:20,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 12:05:20,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 12:05:20,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 12:05:20,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 12:05:20,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 12:05:20,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 12:05:20,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 12:05:20,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 12:05:20,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 12:05:20,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 12:05:20,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 12:05:20,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 12:05:20,631 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 12:05:20,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 12:05:20,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 12:05:20,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 12:05:20,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 12:05:20,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 12:05:20,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 12:05:20,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 12:05:20,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 12:05:20,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 12:05:20,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 12:05:20,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 12:05:20,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 12:05:20,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 12:05:20,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 12:05:20,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 12:05:20,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 12:05:20,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 12:05:20,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 12:05:20,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 12:05:20,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 12:05:20,655 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 12:05:20,678 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 12:05:20,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 12:05:20,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 12:05:20,681 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 12:05:20,681 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 12:05:20,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 12:05:20,681 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 12:05:20,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 12:05:20,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 12:05:20,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 12:05:20,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 12:05:20,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 12:05:20,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 12:05:20,684 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 12:05:20,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 12:05:20,684 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 12:05:20,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 12:05:20,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 12:05:20,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 12:05:20,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 12:05:20,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 12:05:20,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 12:05:20,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 12:05:20,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 12:05:20,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 12:05:20,687 INFO L138 SettingsManager]: * Trace refinement strategy=MCR [2020-04-18 12:05:20,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 12:05:20,687 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-04-18 12:05:20,687 INFO L138 SettingsManager]: * Trace refinement strategy used in MCR=CAMEL [2020-04-18 12:05:20,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 12:05:20,689 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 12:05:20,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 12:05:20,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 12:05:20,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 12:05:20,983 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 12:05:20,983 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 12:05:20,984 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2020-04-18 12:05:21,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47ec47482/1989a5c4624d4bc9a1d7fc381d44a37b/FLAGc1e7fcd38 [2020-04-18 12:05:21,669 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 12:05:21,670 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2020-04-18 12:05:21,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47ec47482/1989a5c4624d4bc9a1d7fc381d44a37b/FLAGc1e7fcd38 [2020-04-18 12:05:21,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47ec47482/1989a5c4624d4bc9a1d7fc381d44a37b [2020-04-18 12:05:21,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 12:05:21,984 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 12:05:21,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 12:05:21,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 12:05:21,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 12:05:21,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 12:05:21" (1/1) ... [2020-04-18 12:05:21,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ea5b3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 12:05:21, skipping insertion in model container [2020-04-18 12:05:21,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 12:05:21" (1/1) ... [2020-04-18 12:05:22,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 12:05:22,060 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 12:05:22,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 12:05:22,494 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 12:05:22,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 12:05:22,632 INFO L208 MainTranslator]: Completed translation [2020-04-18 12:05:22,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 12:05:22 WrapperNode [2020-04-18 12:05:22,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 12:05:22,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 12:05:22,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 12:05:22,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 12:05:22,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 12:05:22" (1/1) ... [2020-04-18 12:05:22,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 12:05:22" (1/1) ... [2020-04-18 12:05:22,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 12:05:22,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 12:05:22,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 12:05:22,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 12:05:22,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 12:05:22" (1/1) ... [2020-04-18 12:05:22,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 12:05:22" (1/1) ... [2020-04-18 12:05:22,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 12:05:22" (1/1) ... [2020-04-18 12:05:22,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 12:05:22" (1/1) ... [2020-04-18 12:05:22,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 12:05:22" (1/1) ... [2020-04-18 12:05:22,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 12:05:22" (1/1) ... [2020-04-18 12:05:22,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 12:05:22" (1/1) ... [2020-04-18 12:05:22,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 12:05:22,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 12:05:22,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 12:05:22,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 12:05:22,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 12:05:22" (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 12:05:22,794 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-04-18 12:05:22,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-04-18 12:05:22,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 12:05:22,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 12:05:22,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 12:05:22,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 12:05:22,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 12:05:22,797 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 12:05:23,045 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 12:05:23,045 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-04-18 12:05:23,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 12:05:23 BoogieIcfgContainer [2020-04-18 12:05:23,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 12:05:23,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 12:05:23,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 12:05:23,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 12:05:23,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 12:05:21" (1/3) ... [2020-04-18 12:05:23,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3539e8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 12:05:23, skipping insertion in model container [2020-04-18 12:05:23,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 12:05:22" (2/3) ... [2020-04-18 12:05:23,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3539e8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 12:05:23, skipping insertion in model container [2020-04-18 12:05:23,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 12:05:23" (3/3) ... [2020-04-18 12:05:23,063 INFO L109 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2020-04-18 12:05:23,089 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 12:05:23,090 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 12:05:23,102 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-04-18 12:05:23,104 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 12:05:23,137 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,138 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,138 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,139 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,139 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,140 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,140 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,141 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,141 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,142 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,142 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,143 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,143 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,144 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,153 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,153 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,154 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,154 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,154 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,155 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:23,176 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-04-18 12:05:23,200 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 12:05:23,200 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 12:05:23,201 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 12:05:23,201 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 12:05:23,201 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 12:05:23,202 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 12:05:23,202 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 12:05:23,202 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 12:05:23,216 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 33 transitions, 71 flow [2020-04-18 12:05:23,217 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 71 flow [2020-04-18 12:05:23,248 INFO L129 PetriNetUnfolder]: 3/41 cut-off events. [2020-04-18 12:05:23,249 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-04-18 12:05:23,254 INFO L80 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 41 events. 3/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2020-04-18 12:05:23,255 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 71 flow [2020-04-18 12:05:23,269 INFO L129 PetriNetUnfolder]: 3/41 cut-off events. [2020-04-18 12:05:23,269 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-04-18 12:05:23,270 INFO L80 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 41 events. 3/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2020-04-18 12:05:23,271 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 240 [2020-04-18 12:05:23,272 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 12:05:23,942 INFO L206 etLargeBlockEncoding]: Checked pairs total: 167 [2020-04-18 12:05:23,942 INFO L214 etLargeBlockEncoding]: Total number of compositions: 30 [2020-04-18 12:05:23,947 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 11 places, 8 transitions, 21 flow [2020-04-18 12:05:23,961 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 19 states. [2020-04-18 12:05:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-04-18 12:05:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-04-18 12:05:23,982 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:23,983 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-04-18 12:05:23,983 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 12:05:23,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:23,993 INFO L82 PathProgramCache]: Analyzing trace with hash 4687883, now seen corresponding path program 1 times [2020-04-18 12:05:24,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:24,002 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [310604569] [2020-04-18 12:05:24,020 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:24,033 INFO L259 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2020-04-18 12:05:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2020-04-18 12:05:24,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-04-18 12:05:24,035 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:24,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:24,036 INFO L82 PathProgramCache]: Analyzing trace with hash 4687883, now seen corresponding path program 2 times [2020-04-18 12:05:24,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:24,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914015729] [2020-04-18 12:05:24,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:24,194 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 12:05:24,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914015729] [2020-04-18 12:05:24,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:24,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 12:05:24,198 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:24,198 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:24,199 INFO L259 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2020-04-18 12:05:24,199 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:24,203 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:24,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 12:05:24,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 12:05:24,210 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 2 states. [2020-04-18 12:05:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:24,214 INFO L93 Difference]: Finished difference Result 5 states and 4 transitions. [2020-04-18 12:05:24,214 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 4 transitions. [2020-04-18 12:05:24,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:24,215 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [310604569] [2020-04-18 12:05:24,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:24,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 12:05:24,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [310604569] [2020-04-18 12:05:24,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-04-18 12:05:24,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:24,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 12:05:24,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 12:05:24,224 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-04-18 12:05:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:24,226 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-04-18 12:05:24,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-04-18 12:05:24,227 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2020-04-18 12:05:24,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:24,236 INFO L225 Difference]: With dead ends: 11 [2020-04-18 12:05:24,236 INFO L226 Difference]: Without dead ends: 11 [2020-04-18 12:05:24,238 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 12:05:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-04-18 12:05:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-04-18 12:05:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-04-18 12:05:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2020-04-18 12:05:24,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 4 [2020-04-18 12:05:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:24,274 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-04-18 12:05:24,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-04-18 12:05:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-04-18 12:05:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-04-18 12:05:24,275 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:24,275 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2020-04-18 12:05:24,275 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 12:05:24,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash 210024220, now seen corresponding path program 1 times [2020-04-18 12:05:24,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:24,276 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1602348008] [2020-04-18 12:05:24,277 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:24,278 INFO L259 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-04-18 12:05:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2020-04-18 12:05:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-04-18 12:05:24,279 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:24,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:24,279 INFO L82 PathProgramCache]: Analyzing trace with hash 210024220, now seen corresponding path program 2 times [2020-04-18 12:05:24,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:24,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062860035] [2020-04-18 12:05:24,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 12:05:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 12:05:24,340 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 12:05:24,341 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 12:05:24,341 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 12:05:24,342 WARN L363 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 12:05:24,343 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-04-18 12:05:24,349 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,351 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,352 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,352 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,353 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,353 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,353 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,353 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,354 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,354 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,354 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,354 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,354 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,355 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,355 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,355 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,355 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,356 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,356 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,356 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,356 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,357 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,357 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,357 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,359 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,359 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,360 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,360 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,360 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,360 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:24,362 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-04-18 12:05:24,363 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 12:05:24,363 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 12:05:24,363 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 12:05:24,363 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 12:05:24,363 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 12:05:24,364 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 12:05:24,364 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 12:05:24,364 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 12:05:24,366 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 46 transitions, 104 flow [2020-04-18 12:05:24,367 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions, 104 flow [2020-04-18 12:05:24,382 INFO L129 PetriNetUnfolder]: 5/63 cut-off events. [2020-04-18 12:05:24,382 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-04-18 12:05:24,383 INFO L80 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 5/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 42. Up to 6 conditions per place. [2020-04-18 12:05:24,385 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions, 104 flow [2020-04-18 12:05:24,400 INFO L129 PetriNetUnfolder]: 5/63 cut-off events. [2020-04-18 12:05:24,400 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-04-18 12:05:24,401 INFO L80 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 5/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 42. Up to 6 conditions per place. [2020-04-18 12:05:24,403 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 792 [2020-04-18 12:05:24,403 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 12:05:25,026 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1029 [2020-04-18 12:05:25,027 INFO L214 etLargeBlockEncoding]: Total number of compositions: 37 [2020-04-18 12:05:25,027 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 13 transitions, 38 flow [2020-04-18 12:05:25,035 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 100 states. [2020-04-18 12:05:25,035 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2020-04-18 12:05:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 12:05:25,036 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:25,036 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 12:05:25,036 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:25,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:25,037 INFO L82 PathProgramCache]: Analyzing trace with hash 240626158, now seen corresponding path program 1 times [2020-04-18 12:05:25,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:25,038 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1150524286] [2020-04-18 12:05:25,038 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:25,039 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 12:05:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 12:05:25,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 12:05:25,040 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:25,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:25,040 INFO L82 PathProgramCache]: Analyzing trace with hash 240626158, now seen corresponding path program 2 times [2020-04-18 12:05:25,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:25,041 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999924239] [2020-04-18 12:05:25,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:25,116 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 12:05:25,117 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999924239] [2020-04-18 12:05:25,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:25,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:25,118 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:25,119 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:25,122 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 12:05:25,122 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:25,127 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:25,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:25,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:25,140 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 12:05:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:25,149 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 12:05:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 12:05:25,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:25,150 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1150524286] [2020-04-18 12:05:25,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:25,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:25,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1150524286] [2020-04-18 12:05:25,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:25,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:25,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:25,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:25,152 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2020-04-18 12:05:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:25,190 INFO L93 Difference]: Finished difference Result 96 states and 197 transitions. [2020-04-18 12:05:25,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:25,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 12:05:25,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:25,195 INFO L225 Difference]: With dead ends: 96 [2020-04-18 12:05:25,196 INFO L226 Difference]: Without dead ends: 96 [2020-04-18 12:05:25,196 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:05:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-04-18 12:05:25,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2020-04-18 12:05:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-04-18 12:05:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 180 transitions. [2020-04-18 12:05:25,215 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 180 transitions. Word has length 5 [2020-04-18 12:05:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:25,215 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 180 transitions. [2020-04-18 12:05:25,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 180 transitions. [2020-04-18 12:05:25,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 12:05:25,216 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:25,216 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:25,217 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:25,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:25,217 INFO L82 PathProgramCache]: Analyzing trace with hash 109807895, now seen corresponding path program 1 times [2020-04-18 12:05:25,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:25,218 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [650127749] [2020-04-18 12:05:25,218 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:25,219 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 12:05:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 12:05:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 12:05:25,220 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:25,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:25,220 INFO L82 PathProgramCache]: Analyzing trace with hash 109807895, now seen corresponding path program 2 times [2020-04-18 12:05:25,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:25,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818709957] [2020-04-18 12:05:25,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:25,274 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 12:05:25,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818709957] [2020-04-18 12:05:25,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:25,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:25,275 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:25,276 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:25,277 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 12:05:25,278 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:25,281 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:25,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:25,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:25,282 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-04-18 12:05:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:25,285 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2020-04-18 12:05:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2020-04-18 12:05:25,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:25,286 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [650127749] [2020-04-18 12:05:25,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:25,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:25,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [650127749] [2020-04-18 12:05:25,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:25,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:25,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:25,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:25,287 INFO L87 Difference]: Start difference. First operand 84 states and 180 transitions. Second operand 3 states. [2020-04-18 12:05:25,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:25,314 INFO L93 Difference]: Finished difference Result 84 states and 164 transitions. [2020-04-18 12:05:25,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:25,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-04-18 12:05:25,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:25,317 INFO L225 Difference]: With dead ends: 84 [2020-04-18 12:05:25,317 INFO L226 Difference]: Without dead ends: 84 [2020-04-18 12:05:25,318 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 12:05:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-04-18 12:05:25,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2020-04-18 12:05:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-04-18 12:05:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 154 transitions. [2020-04-18 12:05:25,329 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 154 transitions. Word has length 8 [2020-04-18 12:05:25,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:25,330 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 154 transitions. [2020-04-18 12:05:25,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 154 transitions. [2020-04-18 12:05:25,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:25,331 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:25,331 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:25,331 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:25,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:25,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1655579211, now seen corresponding path program 1 times [2020-04-18 12:05:25,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:25,332 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [670145571] [2020-04-18 12:05:25,333 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:25,334 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2020-04-18 12:05:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 12:05:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:25,335 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:25,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:25,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1655579211, now seen corresponding path program 2 times [2020-04-18 12:05:25,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:25,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841370392] [2020-04-18 12:05:25,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:25,401 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 12:05:25,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841370392] [2020-04-18 12:05:25,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:25,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:25,402 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:25,403 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:25,405 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 12:05:25,405 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:25,414 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:25,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:25,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 12:05:25,415 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2020-04-18 12:05:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:25,431 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-04-18 12:05:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-04-18 12:05:25,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:25,432 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [670145571] [2020-04-18 12:05:25,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:25,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:25,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [670145571] [2020-04-18 12:05:25,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 12:05:25,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:25,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:25,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:25,433 INFO L87 Difference]: Start difference. First operand 76 states and 154 transitions. Second operand 4 states. [2020-04-18 12:05:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:25,453 INFO L93 Difference]: Finished difference Result 68 states and 136 transitions. [2020-04-18 12:05:25,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:25,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-04-18 12:05:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:25,455 INFO L225 Difference]: With dead ends: 68 [2020-04-18 12:05:25,455 INFO L226 Difference]: Without dead ends: 68 [2020-04-18 12:05:25,456 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:25,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-04-18 12:05:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2020-04-18 12:05:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-04-18 12:05:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 129 transitions. [2020-04-18 12:05:25,463 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 129 transitions. Word has length 9 [2020-04-18 12:05:25,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:25,463 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 129 transitions. [2020-04-18 12:05:25,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 12:05:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 129 transitions. [2020-04-18 12:05:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:25,464 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:25,464 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2020-04-18 12:05:25,465 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:25,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:25,465 INFO L82 PathProgramCache]: Analyzing trace with hash -891005170, now seen corresponding path program 1 times [2020-04-18 12:05:25,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:25,466 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1811424010] [2020-04-18 12:05:25,466 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:25,467 INFO L259 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-04-18 12:05:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-04-18 12:05:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:25,467 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:25,468 INFO L82 PathProgramCache]: Analyzing trace with hash -891005170, now seen corresponding path program 2 times [2020-04-18 12:05:25,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:25,468 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775248072] [2020-04-18 12:05:25,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 12:05:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 12:05:25,495 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 12:05:25,495 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 12:05:25,496 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 12:05:25,496 WARN L363 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 12:05:25,497 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-04-18 12:05:25,504 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,504 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,504 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,505 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,505 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,505 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,505 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,505 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,506 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,506 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,506 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,506 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,507 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,507 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,507 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,507 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,507 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,508 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,508 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,508 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,508 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,508 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,508 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,509 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,509 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,509 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,509 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,509 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,510 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,510 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,510 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,510 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,510 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,511 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,511 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,511 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,511 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,511 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,512 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,512 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,512 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,512 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,513 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,513 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,513 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,513 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,513 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,513 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,515 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,515 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,516 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,516 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,516 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,516 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,518 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,518 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,518 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,518 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,518 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,518 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:25,520 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-04-18 12:05:25,520 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 12:05:25,520 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 12:05:25,521 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 12:05:25,521 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 12:05:25,521 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 12:05:25,521 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 12:05:25,521 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 12:05:25,521 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 12:05:25,523 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 59 transitions, 139 flow [2020-04-18 12:05:25,523 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions, 139 flow [2020-04-18 12:05:25,539 INFO L129 PetriNetUnfolder]: 7/85 cut-off events. [2020-04-18 12:05:25,539 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-04-18 12:05:25,540 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 85 events. 7/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 205 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2020-04-18 12:05:25,545 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions, 139 flow [2020-04-18 12:05:25,564 INFO L129 PetriNetUnfolder]: 7/85 cut-off events. [2020-04-18 12:05:25,564 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-04-18 12:05:25,568 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 85 events. 7/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 205 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2020-04-18 12:05:25,571 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1656 [2020-04-18 12:05:25,571 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 12:05:26,221 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2190 [2020-04-18 12:05:26,221 INFO L214 etLargeBlockEncoding]: Total number of compositions: 48 [2020-04-18 12:05:26,222 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 17 transitions, 55 flow [2020-04-18 12:05:26,238 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 404 states. [2020-04-18 12:05:26,238 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states. [2020-04-18 12:05:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 12:05:26,239 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:26,239 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 12:05:26,239 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:26,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:26,240 INFO L82 PathProgramCache]: Analyzing trace with hash 359632331, now seen corresponding path program 1 times [2020-04-18 12:05:26,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:26,240 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2094145116] [2020-04-18 12:05:26,241 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:26,241 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 12:05:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 12:05:26,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 12:05:26,242 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:26,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:26,242 INFO L82 PathProgramCache]: Analyzing trace with hash 359632331, now seen corresponding path program 2 times [2020-04-18 12:05:26,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:26,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372737134] [2020-04-18 12:05:26,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:26,264 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 12:05:26,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372737134] [2020-04-18 12:05:26,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:26,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:26,265 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:26,265 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:26,266 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 12:05:26,266 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:26,269 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:26,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:26,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:26,270 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 12:05:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:26,273 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 12:05:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 12:05:26,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:26,274 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2094145116] [2020-04-18 12:05:26,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:26,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:26,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2094145116] [2020-04-18 12:05:26,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:26,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:26,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:26,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:26,275 INFO L87 Difference]: Start difference. First operand 404 states. Second operand 3 states. [2020-04-18 12:05:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:26,310 INFO L93 Difference]: Finished difference Result 447 states and 1247 transitions. [2020-04-18 12:05:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:26,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 12:05:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:26,316 INFO L225 Difference]: With dead ends: 447 [2020-04-18 12:05:26,316 INFO L226 Difference]: Without dead ends: 447 [2020-04-18 12:05:26,317 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:05:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-04-18 12:05:26,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 378. [2020-04-18 12:05:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-04-18 12:05:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1099 transitions. [2020-04-18 12:05:26,364 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1099 transitions. Word has length 5 [2020-04-18 12:05:26,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:26,365 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1099 transitions. [2020-04-18 12:05:26,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:26,365 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1099 transitions. [2020-04-18 12:05:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 12:05:26,365 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:26,366 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:26,366 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:26,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:26,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2061810264, now seen corresponding path program 1 times [2020-04-18 12:05:26,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:26,367 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [911965258] [2020-04-18 12:05:26,367 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:26,368 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 12:05:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 12:05:26,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 12:05:26,368 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:26,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:26,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2061810264, now seen corresponding path program 2 times [2020-04-18 12:05:26,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:26,369 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254961536] [2020-04-18 12:05:26,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:26,403 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 12:05:26,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254961536] [2020-04-18 12:05:26,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:26,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:26,404 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:26,405 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:26,405 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 12:05:26,405 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:26,409 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:26,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:26,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:26,409 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-04-18 12:05:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:26,412 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2020-04-18 12:05:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2020-04-18 12:05:26,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:26,413 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [911965258] [2020-04-18 12:05:26,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:26,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:26,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [911965258] [2020-04-18 12:05:26,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:26,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:26,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:26,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:26,415 INFO L87 Difference]: Start difference. First operand 378 states and 1099 transitions. Second operand 3 states. [2020-04-18 12:05:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:26,462 INFO L93 Difference]: Finished difference Result 486 states and 1356 transitions. [2020-04-18 12:05:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:26,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-04-18 12:05:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:26,470 INFO L225 Difference]: With dead ends: 486 [2020-04-18 12:05:26,471 INFO L226 Difference]: Without dead ends: 486 [2020-04-18 12:05:26,471 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 12:05:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2020-04-18 12:05:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 412. [2020-04-18 12:05:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-04-18 12:05:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1196 transitions. [2020-04-18 12:05:26,525 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1196 transitions. Word has length 8 [2020-04-18 12:05:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:26,525 INFO L479 AbstractCegarLoop]: Abstraction has 412 states and 1196 transitions. [2020-04-18 12:05:26,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1196 transitions. [2020-04-18 12:05:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:26,526 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:26,526 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:26,527 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1871610837, now seen corresponding path program 1 times [2020-04-18 12:05:26,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:26,527 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [856409335] [2020-04-18 12:05:26,528 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:26,528 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2020-04-18 12:05:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 12:05:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:26,529 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:26,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:26,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1803820437, now seen corresponding path program 2 times [2020-04-18 12:05:26,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:26,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708048887] [2020-04-18 12:05:26,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:26,551 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 12:05:26,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708048887] [2020-04-18 12:05:26,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:26,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:26,552 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:26,552 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:26,554 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 12:05:26,554 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:26,557 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:26,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:26,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:26,558 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 12:05:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:26,564 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 12:05:26,564 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 12:05:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:26,564 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:26,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:26,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1871610837, now seen corresponding path program 3 times [2020-04-18 12:05:26,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:26,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819822997] [2020-04-18 12:05:26,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:26,621 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 12:05:26,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819822997] [2020-04-18 12:05:26,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:26,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:26,622 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:26,623 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:26,624 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 12:05:26,624 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:26,635 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:26,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:26,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 12:05:26,636 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 4 states. [2020-04-18 12:05:26,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:26,650 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 12:05:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 12:05:26,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:26,650 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [856409335] [2020-04-18 12:05:26,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:26,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:26,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [856409335] [2020-04-18 12:05:26,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 12:05:26,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:26,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:26,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:26,652 INFO L87 Difference]: Start difference. First operand 412 states and 1196 transitions. Second operand 4 states. [2020-04-18 12:05:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:26,682 INFO L93 Difference]: Finished difference Result 338 states and 962 transitions. [2020-04-18 12:05:26,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:26,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-04-18 12:05:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:26,686 INFO L225 Difference]: With dead ends: 338 [2020-04-18 12:05:26,686 INFO L226 Difference]: Without dead ends: 338 [2020-04-18 12:05:26,686 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-04-18 12:05:26,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 283. [2020-04-18 12:05:26,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2020-04-18 12:05:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 793 transitions. [2020-04-18 12:05:26,699 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 793 transitions. Word has length 9 [2020-04-18 12:05:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:26,699 INFO L479 AbstractCegarLoop]: Abstraction has 283 states and 793 transitions. [2020-04-18 12:05:26,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 12:05:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 793 transitions. [2020-04-18 12:05:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:26,700 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:26,700 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:26,701 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:26,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:26,701 INFO L82 PathProgramCache]: Analyzing trace with hash -508390409, now seen corresponding path program 1 times [2020-04-18 12:05:26,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:26,701 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1114216190] [2020-04-18 12:05:26,702 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:26,702 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2020-04-18 12:05:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 12:05:26,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:26,703 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:26,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:26,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1871610825, now seen corresponding path program 2 times [2020-04-18 12:05:26,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:26,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267808923] [2020-04-18 12:05:26,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:26,725 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 12:05:26,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267808923] [2020-04-18 12:05:26,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:26,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:26,726 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:26,727 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:26,728 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-04-18 12:05:26,728 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:26,751 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:05:26,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:05:26,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:26,751 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2020-04-18 12:05:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:26,764 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 12:05:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 12:05:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:26,765 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:26,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:26,766 INFO L82 PathProgramCache]: Analyzing trace with hash -508390409, now seen corresponding path program 3 times [2020-04-18 12:05:26,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:26,766 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704236232] [2020-04-18 12:05:26,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:26,790 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 12:05:26,790 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704236232] [2020-04-18 12:05:26,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:26,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:26,791 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:26,792 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:26,793 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 12:05:26,793 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:26,799 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:26,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:26,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:05:26,800 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2020-04-18 12:05:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:26,811 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 12:05:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 12:05:26,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:26,811 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1114216190] [2020-04-18 12:05:26,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:26,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:26,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1114216190] [2020-04-18 12:05:26,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:05:26,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:26,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:05:26,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:26,813 INFO L87 Difference]: Start difference. First operand 283 states and 793 transitions. Second operand 6 states. [2020-04-18 12:05:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:26,853 INFO L93 Difference]: Finished difference Result 233 states and 641 transitions. [2020-04-18 12:05:26,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:26,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-04-18 12:05:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:26,856 INFO L225 Difference]: With dead ends: 233 [2020-04-18 12:05:26,856 INFO L226 Difference]: Without dead ends: 233 [2020-04-18 12:05:26,857 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-04-18 12:05:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 183. [2020-04-18 12:05:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-04-18 12:05:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 489 transitions. [2020-04-18 12:05:26,866 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 489 transitions. Word has length 9 [2020-04-18 12:05:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:26,866 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 489 transitions. [2020-04-18 12:05:26,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:05:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 489 transitions. [2020-04-18 12:05:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 12:05:26,867 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:26,867 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:26,867 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:26,868 INFO L82 PathProgramCache]: Analyzing trace with hash 960774069, now seen corresponding path program 1 times [2020-04-18 12:05:26,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:26,868 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [626817110] [2020-04-18 12:05:26,869 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:26,869 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 12:05:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 12:05:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 12:05:26,870 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:26,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:26,870 INFO L82 PathProgramCache]: Analyzing trace with hash 960774069, now seen corresponding path program 2 times [2020-04-18 12:05:26,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:26,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508384270] [2020-04-18 12:05:26,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:05:26,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508384270] [2020-04-18 12:05:26,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:26,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:26,894 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:26,895 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:26,895 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 12:05:26,896 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:26,899 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:26,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:26,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:26,900 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-04-18 12:05:26,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:26,904 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-04-18 12:05:26,904 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2020-04-18 12:05:26,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:26,904 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [626817110] [2020-04-18 12:05:26,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:26,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:26,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [626817110] [2020-04-18 12:05:26,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:26,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:26,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:26,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:26,905 INFO L87 Difference]: Start difference. First operand 183 states and 489 transitions. Second operand 3 states. [2020-04-18 12:05:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:26,928 INFO L93 Difference]: Finished difference Result 243 states and 634 transitions. [2020-04-18 12:05:26,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:26,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-04-18 12:05:26,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:26,931 INFO L225 Difference]: With dead ends: 243 [2020-04-18 12:05:26,931 INFO L226 Difference]: Without dead ends: 243 [2020-04-18 12:05:26,931 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 12:05:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-04-18 12:05:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 211. [2020-04-18 12:05:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-04-18 12:05:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 570 transitions. [2020-04-18 12:05:26,941 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 570 transitions. Word has length 11 [2020-04-18 12:05:26,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:26,942 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 570 transitions. [2020-04-18 12:05:26,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 570 transitions. [2020-04-18 12:05:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:05:26,943 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:26,943 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:26,943 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:26,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:26,944 INFO L82 PathProgramCache]: Analyzing trace with hash -280773966, now seen corresponding path program 1 times [2020-04-18 12:05:26,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:26,944 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1968187790] [2020-04-18 12:05:26,945 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:26,945 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 28 transitions. [2020-04-18 12:05:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-04-18 12:05:26,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:05:26,946 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:26,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:26,947 INFO L82 PathProgramCache]: Analyzing trace with hash 5848438, now seen corresponding path program 2 times [2020-04-18 12:05:26,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:26,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947587400] [2020-04-18 12:05:26,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:05:26,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947587400] [2020-04-18 12:05:26,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:26,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:26,967 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:26,969 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:26,971 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-04-18 12:05:26,971 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:26,993 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:05:26,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:05:26,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:26,994 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-04-18 12:05:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:27,007 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-04-18 12:05:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2020-04-18 12:05:27,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:05:27,007 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:27,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:27,008 INFO L82 PathProgramCache]: Analyzing trace with hash -280773966, now seen corresponding path program 3 times [2020-04-18 12:05:27,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:27,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166810509] [2020-04-18 12:05:27,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:05:27,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166810509] [2020-04-18 12:05:27,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:27,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:27,033 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:27,034 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:27,036 INFO L259 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2020-04-18 12:05:27,036 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:27,043 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:27,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:27,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:05:27,044 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 4 states. [2020-04-18 12:05:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:27,054 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-04-18 12:05:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2020-04-18 12:05:27,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:27,055 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1968187790] [2020-04-18 12:05:27,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:27,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:27,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1968187790] [2020-04-18 12:05:27,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:05:27,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:27,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:05:27,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:27,057 INFO L87 Difference]: Start difference. First operand 211 states and 570 transitions. Second operand 6 states. [2020-04-18 12:05:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:27,102 INFO L93 Difference]: Finished difference Result 179 states and 474 transitions. [2020-04-18 12:05:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:27,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-04-18 12:05:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:27,104 INFO L225 Difference]: With dead ends: 179 [2020-04-18 12:05:27,104 INFO L226 Difference]: Without dead ends: 179 [2020-04-18 12:05:27,104 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-04-18 12:05:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2020-04-18 12:05:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-04-18 12:05:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 378 transitions. [2020-04-18 12:05:27,111 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 378 transitions. Word has length 12 [2020-04-18 12:05:27,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:27,111 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 378 transitions. [2020-04-18 12:05:27,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:05:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 378 transitions. [2020-04-18 12:05:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:05:27,112 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:27,112 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2020-04-18 12:05:27,113 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:27,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:27,113 INFO L82 PathProgramCache]: Analyzing trace with hash -280874677, now seen corresponding path program 1 times [2020-04-18 12:05:27,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:27,113 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2128532750] [2020-04-18 12:05:27,114 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:27,114 INFO L259 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2020-04-18 12:05:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-04-18 12:05:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:05:27,115 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:27,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:27,116 INFO L82 PathProgramCache]: Analyzing trace with hash -280874677, now seen corresponding path program 2 times [2020-04-18 12:05:27,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:27,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816383149] [2020-04-18 12:05:27,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 12:05:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 12:05:27,136 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 12:05:27,137 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 12:05:27,137 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 12:05:27,137 WARN L363 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 12:05:27,137 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-04-18 12:05:27,145 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,145 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,145 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,145 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,145 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,146 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,146 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,146 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,146 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,146 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,146 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,147 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,147 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,147 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,147 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,147 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,147 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,148 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,148 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,148 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,148 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,148 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,148 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,148 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,149 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,149 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,149 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,149 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,149 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,150 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,150 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,150 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,150 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,150 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,150 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,150 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,151 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,151 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,151 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,151 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,151 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,152 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,152 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,152 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,152 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,152 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,152 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,153 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,153 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,153 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,153 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,153 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,153 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,154 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,154 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,154 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,154 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,155 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,155 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,155 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,155 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,155 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,157 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,158 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,158 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,158 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,158 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,158 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,160 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,161 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,161 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,161 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,161 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,161 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,163 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,163 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,164 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,164 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,164 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,164 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:27,165 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-04-18 12:05:27,166 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 12:05:27,166 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 12:05:27,166 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 12:05:27,166 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 12:05:27,166 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 12:05:27,166 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 12:05:27,166 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 12:05:27,166 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 12:05:27,168 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 72 transitions, 176 flow [2020-04-18 12:05:27,168 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 76 places, 72 transitions, 176 flow [2020-04-18 12:05:27,184 INFO L129 PetriNetUnfolder]: 9/107 cut-off events. [2020-04-18 12:05:27,184 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-04-18 12:05:27,186 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 107 events. 9/107 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 93. Up to 10 conditions per place. [2020-04-18 12:05:27,189 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 76 places, 72 transitions, 176 flow [2020-04-18 12:05:27,203 INFO L129 PetriNetUnfolder]: 9/107 cut-off events. [2020-04-18 12:05:27,204 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-04-18 12:05:27,205 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 107 events. 9/107 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 93. Up to 10 conditions per place. [2020-04-18 12:05:27,209 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2020-04-18 12:05:27,209 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 12:05:27,959 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4331 [2020-04-18 12:05:27,960 INFO L214 etLargeBlockEncoding]: Total number of compositions: 63 [2020-04-18 12:05:27,960 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 23 transitions, 78 flow [2020-04-18 12:05:28,046 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1620 states. [2020-04-18 12:05:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states. [2020-04-18 12:05:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 12:05:28,047 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:28,047 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 12:05:28,048 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 12:05:28,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:28,048 INFO L82 PathProgramCache]: Analyzing trace with hash 500888133, now seen corresponding path program 1 times [2020-04-18 12:05:28,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:28,049 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [944563394] [2020-04-18 12:05:28,049 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:28,049 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 12:05:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 12:05:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 12:05:28,050 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:28,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash 500888133, now seen corresponding path program 2 times [2020-04-18 12:05:28,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:28,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903507740] [2020-04-18 12:05:28,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:28,073 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 12:05:28,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903507740] [2020-04-18 12:05:28,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:28,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:28,075 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:28,075 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:28,076 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 12:05:28,076 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:28,079 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:28,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:28,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:28,080 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 12:05:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:28,084 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 12:05:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 12:05:28,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:28,085 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [944563394] [2020-04-18 12:05:28,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:28,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:28,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [944563394] [2020-04-18 12:05:28,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:28,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:28,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:28,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:28,088 INFO L87 Difference]: Start difference. First operand 1620 states. Second operand 3 states. [2020-04-18 12:05:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:28,152 INFO L93 Difference]: Finished difference Result 1878 states and 6626 transitions. [2020-04-18 12:05:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:28,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 12:05:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:28,169 INFO L225 Difference]: With dead ends: 1878 [2020-04-18 12:05:28,170 INFO L226 Difference]: Without dead ends: 1878 [2020-04-18 12:05:28,170 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:05:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2020-04-18 12:05:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1572. [2020-04-18 12:05:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-04-18 12:05:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 5747 transitions. [2020-04-18 12:05:28,266 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 5747 transitions. Word has length 5 [2020-04-18 12:05:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:28,266 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 5747 transitions. [2020-04-18 12:05:28,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 5747 transitions. [2020-04-18 12:05:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 12:05:28,267 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:28,267 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:28,267 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 12:05:28,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:28,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1111452433, now seen corresponding path program 1 times [2020-04-18 12:05:28,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:28,268 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [310660967] [2020-04-18 12:05:28,268 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:28,269 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 12:05:28,269 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 12:05:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 12:05:28,269 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:28,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:28,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1111452433, now seen corresponding path program 2 times [2020-04-18 12:05:28,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:28,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349909383] [2020-04-18 12:05:28,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:28,287 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 12:05:28,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349909383] [2020-04-18 12:05:28,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:28,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:28,288 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:28,288 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:28,289 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 12:05:28,289 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:28,292 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:28,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:28,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:28,293 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-04-18 12:05:28,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:28,296 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2020-04-18 12:05:28,296 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2020-04-18 12:05:28,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:28,296 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [310660967] [2020-04-18 12:05:28,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:28,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:28,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [310660967] [2020-04-18 12:05:28,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:28,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:28,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:28,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:28,298 INFO L87 Difference]: Start difference. First operand 1572 states and 5747 transitions. Second operand 3 states. [2020-04-18 12:05:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:28,339 INFO L93 Difference]: Finished difference Result 2193 states and 7798 transitions. [2020-04-18 12:05:28,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:28,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-04-18 12:05:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:28,359 INFO L225 Difference]: With dead ends: 2193 [2020-04-18 12:05:28,360 INFO L226 Difference]: Without dead ends: 2193 [2020-04-18 12:05:28,360 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 12:05:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2020-04-18 12:05:28,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1828. [2020-04-18 12:05:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1828 states. [2020-04-18 12:05:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 6732 transitions. [2020-04-18 12:05:28,452 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 6732 transitions. Word has length 8 [2020-04-18 12:05:28,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:28,452 INFO L479 AbstractCegarLoop]: Abstraction has 1828 states and 6732 transitions. [2020-04-18 12:05:28,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 6732 transitions. [2020-04-18 12:05:28,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:28,453 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:28,453 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:28,453 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 12:05:28,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:28,453 INFO L82 PathProgramCache]: Analyzing trace with hash -231363678, now seen corresponding path program 1 times [2020-04-18 12:05:28,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:28,454 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [282510292] [2020-04-18 12:05:28,454 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:28,454 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2020-04-18 12:05:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 12:05:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:28,456 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash -231514368, now seen corresponding path program 2 times [2020-04-18 12:05:28,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:28,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297973650] [2020-04-18 12:05:28,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:28,476 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 12:05:28,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297973650] [2020-04-18 12:05:28,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:28,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:28,477 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:28,477 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:28,478 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 12:05:28,478 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:28,483 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 12:05:28,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:28,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:28,484 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 12:05:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:28,505 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 12:05:28,505 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 12:05:28,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:28,505 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:28,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:28,506 INFO L82 PathProgramCache]: Analyzing trace with hash -231363678, now seen corresponding path program 3 times [2020-04-18 12:05:28,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:28,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443934570] [2020-04-18 12:05:28,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:28,528 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 12:05:28,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443934570] [2020-04-18 12:05:28,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:28,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:28,529 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:28,530 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:28,531 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 12:05:28,531 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:28,535 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:28,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:28,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 12:05:28,536 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 4 states. [2020-04-18 12:05:28,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:28,550 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 12:05:28,551 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 12:05:28,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:28,551 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [282510292] [2020-04-18 12:05:28,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:28,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:28,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [282510292] [2020-04-18 12:05:28,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 12:05:28,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:28,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:28,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:28,553 INFO L87 Difference]: Start difference. First operand 1828 states and 6732 transitions. Second operand 4 states. [2020-04-18 12:05:28,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:28,593 INFO L93 Difference]: Finished difference Result 1463 states and 5301 transitions. [2020-04-18 12:05:28,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:28,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-04-18 12:05:28,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:28,607 INFO L225 Difference]: With dead ends: 1463 [2020-04-18 12:05:28,607 INFO L226 Difference]: Without dead ends: 1463 [2020-04-18 12:05:28,607 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:28,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-04-18 12:05:28,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1177. [2020-04-18 12:05:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2020-04-18 12:05:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 4196 transitions. [2020-04-18 12:05:28,657 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 4196 transitions. Word has length 9 [2020-04-18 12:05:28,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:28,658 INFO L479 AbstractCegarLoop]: Abstraction has 1177 states and 4196 transitions. [2020-04-18 12:05:28,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 12:05:28,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 4196 transitions. [2020-04-18 12:05:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:28,658 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:28,658 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:28,659 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 12:05:28,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:28,659 INFO L82 PathProgramCache]: Analyzing trace with hash 95288963, now seen corresponding path program 1 times [2020-04-18 12:05:28,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:28,659 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1404815088] [2020-04-18 12:05:28,660 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:28,660 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2020-04-18 12:05:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 12:05:28,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:28,661 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:28,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:28,661 INFO L82 PathProgramCache]: Analyzing trace with hash -231363683, now seen corresponding path program 2 times [2020-04-18 12:05:28,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:28,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038893645] [2020-04-18 12:05:28,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:28,677 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 12:05:28,677 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038893645] [2020-04-18 12:05:28,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:28,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:28,678 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:28,678 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:28,679 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-04-18 12:05:28,679 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:28,699 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:05:28,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:05:28,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:28,700 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2020-04-18 12:05:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:28,712 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 12:05:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 12:05:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:28,713 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:28,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:28,713 INFO L82 PathProgramCache]: Analyzing trace with hash 95288963, now seen corresponding path program 3 times [2020-04-18 12:05:28,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:28,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700404447] [2020-04-18 12:05:28,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:28,737 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 12:05:28,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700404447] [2020-04-18 12:05:28,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:28,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:28,739 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:28,739 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:28,740 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 12:05:28,740 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:28,748 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:28,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:28,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:05:28,749 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2020-04-18 12:05:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:28,759 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 12:05:28,760 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 12:05:28,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:28,760 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1404815088] [2020-04-18 12:05:28,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:28,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:28,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1404815088] [2020-04-18 12:05:28,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:05:28,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:28,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:05:28,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:28,762 INFO L87 Difference]: Start difference. First operand 1177 states and 4196 transitions. Second operand 6 states. [2020-04-18 12:05:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:28,835 INFO L93 Difference]: Finished difference Result 950 states and 3337 transitions. [2020-04-18 12:05:28,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:28,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-04-18 12:05:28,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:28,844 INFO L225 Difference]: With dead ends: 950 [2020-04-18 12:05:28,844 INFO L226 Difference]: Without dead ends: 950 [2020-04-18 12:05:28,845 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2020-04-18 12:05:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 723. [2020-04-18 12:05:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2020-04-18 12:05:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 2478 transitions. [2020-04-18 12:05:28,876 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 2478 transitions. Word has length 9 [2020-04-18 12:05:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:28,877 INFO L479 AbstractCegarLoop]: Abstraction has 723 states and 2478 transitions. [2020-04-18 12:05:28,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:05:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 2478 transitions. [2020-04-18 12:05:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 12:05:28,877 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:28,877 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:28,878 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 12:05:28,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:28,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1255400151, now seen corresponding path program 1 times [2020-04-18 12:05:28,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:28,878 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [107613101] [2020-04-18 12:05:28,879 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:28,879 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 12:05:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 12:05:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 12:05:28,880 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:28,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1255400151, now seen corresponding path program 2 times [2020-04-18 12:05:28,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:28,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571913184] [2020-04-18 12:05:28,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:05:28,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571913184] [2020-04-18 12:05:28,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:28,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:28,898 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:28,898 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:28,899 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 12:05:28,899 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:28,904 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:28,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:28,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:28,904 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-04-18 12:05:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:28,907 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-04-18 12:05:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2020-04-18 12:05:28,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:28,907 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [107613101] [2020-04-18 12:05:28,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:28,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:28,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [107613101] [2020-04-18 12:05:28,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:28,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:28,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:28,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:28,908 INFO L87 Difference]: Start difference. First operand 723 states and 2478 transitions. Second operand 3 states. [2020-04-18 12:05:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:28,941 INFO L93 Difference]: Finished difference Result 1044 states and 3505 transitions. [2020-04-18 12:05:28,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:28,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-04-18 12:05:28,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:28,950 INFO L225 Difference]: With dead ends: 1044 [2020-04-18 12:05:28,951 INFO L226 Difference]: Without dead ends: 1044 [2020-04-18 12:05:28,951 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 12:05:28,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2020-04-18 12:05:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 880. [2020-04-18 12:05:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2020-04-18 12:05:28,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 3058 transitions. [2020-04-18 12:05:28,984 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 3058 transitions. Word has length 11 [2020-04-18 12:05:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:28,985 INFO L479 AbstractCegarLoop]: Abstraction has 880 states and 3058 transitions. [2020-04-18 12:05:28,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 3058 transitions. [2020-04-18 12:05:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:05:28,985 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:28,986 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:28,986 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 12:05:28,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:28,986 INFO L82 PathProgramCache]: Analyzing trace with hash 262700715, now seen corresponding path program 1 times [2020-04-18 12:05:28,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:28,986 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1837613263] [2020-04-18 12:05:28,987 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:28,987 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 28 transitions. [2020-04-18 12:05:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-04-18 12:05:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:05:28,988 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:28,989 INFO L82 PathProgramCache]: Analyzing trace with hash 745883339, now seen corresponding path program 2 times [2020-04-18 12:05:28,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:28,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382066015] [2020-04-18 12:05:28,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:05:29,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382066015] [2020-04-18 12:05:29,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:29,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:29,008 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:29,009 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:29,010 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-04-18 12:05:29,010 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:29,031 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:05:29,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:05:29,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:29,031 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-04-18 12:05:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:29,043 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-04-18 12:05:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2020-04-18 12:05:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:05:29,044 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:29,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:29,045 INFO L82 PathProgramCache]: Analyzing trace with hash 262700715, now seen corresponding path program 3 times [2020-04-18 12:05:29,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:29,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104461750] [2020-04-18 12:05:29,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:05:29,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104461750] [2020-04-18 12:05:29,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:29,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:29,077 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:29,078 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:29,081 INFO L259 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2020-04-18 12:05:29,082 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:29,089 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:29,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:29,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:05:29,090 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 4 states. [2020-04-18 12:05:29,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:29,101 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-04-18 12:05:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2020-04-18 12:05:29,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:29,102 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1837613263] [2020-04-18 12:05:29,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:29,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:29,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1837613263] [2020-04-18 12:05:29,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:05:29,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:29,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:05:29,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:29,103 INFO L87 Difference]: Start difference. First operand 880 states and 3058 transitions. Second operand 6 states. [2020-04-18 12:05:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:29,150 INFO L93 Difference]: Finished difference Result 716 states and 2447 transitions. [2020-04-18 12:05:29,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:29,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-04-18 12:05:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:29,161 INFO L225 Difference]: With dead ends: 716 [2020-04-18 12:05:29,161 INFO L226 Difference]: Without dead ends: 716 [2020-04-18 12:05:29,162 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-04-18 12:05:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 552. [2020-04-18 12:05:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-04-18 12:05:29,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1836 transitions. [2020-04-18 12:05:29,190 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1836 transitions. Word has length 12 [2020-04-18 12:05:29,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:29,190 INFO L479 AbstractCegarLoop]: Abstraction has 552 states and 1836 transitions. [2020-04-18 12:05:29,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:05:29,191 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1836 transitions. [2020-04-18 12:05:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 12:05:29,192 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:29,192 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:29,193 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 12:05:29,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:29,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1066051238, now seen corresponding path program 1 times [2020-04-18 12:05:29,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:29,194 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [98319049] [2020-04-18 12:05:29,195 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:29,195 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 12:05:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 12:05:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 12:05:29,196 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:29,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:29,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1066051238, now seen corresponding path program 2 times [2020-04-18 12:05:29,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:29,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739100748] [2020-04-18 12:05:29,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 12:05:29,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739100748] [2020-04-18 12:05:29,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:29,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:29,237 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:29,239 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:29,240 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 12:05:29,241 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:29,246 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:29,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:29,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:29,247 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-04-18 12:05:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:29,250 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-04-18 12:05:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-04-18 12:05:29,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:29,251 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [98319049] [2020-04-18 12:05:29,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:29,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:29,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [98319049] [2020-04-18 12:05:29,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:29,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:29,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:29,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:29,252 INFO L87 Difference]: Start difference. First operand 552 states and 1836 transitions. Second operand 3 states. [2020-04-18 12:05:29,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:29,286 INFO L93 Difference]: Finished difference Result 756 states and 2485 transitions. [2020-04-18 12:05:29,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:29,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-04-18 12:05:29,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:29,296 INFO L225 Difference]: With dead ends: 756 [2020-04-18 12:05:29,297 INFO L226 Difference]: Without dead ends: 756 [2020-04-18 12:05:29,297 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 12:05:29,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2020-04-18 12:05:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 652. [2020-04-18 12:05:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2020-04-18 12:05:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 2203 transitions. [2020-04-18 12:05:29,328 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 2203 transitions. Word has length 14 [2020-04-18 12:05:29,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:29,329 INFO L479 AbstractCegarLoop]: Abstraction has 652 states and 2203 transitions. [2020-04-18 12:05:29,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:29,329 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 2203 transitions. [2020-04-18 12:05:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 12:05:29,330 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:29,331 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:29,331 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 12:05:29,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:29,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1312017708, now seen corresponding path program 1 times [2020-04-18 12:05:29,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:29,332 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1309962775] [2020-04-18 12:05:29,333 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:29,334 INFO L259 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-04-18 12:05:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-04-18 12:05:29,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 12:05:29,335 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:29,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:29,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1312017708, now seen corresponding path program 2 times [2020-04-18 12:05:29,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:29,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782297] [2020-04-18 12:05:29,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 12:05:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 12:05:29,370 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 12:05:29,370 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 12:05:29,371 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 12:05:29,371 WARN L363 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 12:05:29,372 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-04-18 12:05:29,386 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,387 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,387 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,387 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,387 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,387 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,387 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,388 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,388 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,388 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,388 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,388 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,388 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,389 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,389 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,389 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,389 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,389 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,389 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,390 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,390 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,390 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,390 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,390 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,390 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,391 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,391 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,391 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,394 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,394 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,394 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,394 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,394 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,396 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,396 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,397 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,397 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,398 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,401 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,401 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,401 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,401 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,403 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,403 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,403 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,403 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,404 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,404 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,409 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,409 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,409 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,410 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,410 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,410 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,412 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,412 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,413 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,413 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,413 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,414 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,416 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,416 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,416 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,416 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,416 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,417 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:29,419 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-04-18 12:05:29,420 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 12:05:29,421 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 12:05:29,421 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 12:05:29,421 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 12:05:29,421 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 12:05:29,421 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 12:05:29,421 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 12:05:29,422 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 12:05:29,423 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 215 flow [2020-04-18 12:05:29,423 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 215 flow [2020-04-18 12:05:29,446 INFO L129 PetriNetUnfolder]: 11/129 cut-off events. [2020-04-18 12:05:29,446 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-04-18 12:05:29,448 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 129 events. 11/129 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2020-04-18 12:05:29,455 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 215 flow [2020-04-18 12:05:29,475 INFO L129 PetriNetUnfolder]: 11/129 cut-off events. [2020-04-18 12:05:29,475 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-04-18 12:05:29,476 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 129 events. 11/129 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2020-04-18 12:05:29,482 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4320 [2020-04-18 12:05:29,482 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 12:05:30,355 INFO L206 etLargeBlockEncoding]: Checked pairs total: 6550 [2020-04-18 12:05:30,355 INFO L214 etLargeBlockEncoding]: Total number of compositions: 76 [2020-04-18 12:05:30,356 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 28 transitions, 101 flow [2020-04-18 12:05:30,860 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6484 states. [2020-04-18 12:05:30,860 INFO L276 IsEmpty]: Start isEmpty. Operand 6484 states. [2020-04-18 12:05:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 12:05:30,860 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:30,860 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 12:05:30,861 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:30,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:30,861 INFO L82 PathProgramCache]: Analyzing trace with hash 666270871, now seen corresponding path program 1 times [2020-04-18 12:05:30,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:30,861 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [645679961] [2020-04-18 12:05:30,861 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:30,862 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 12:05:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 12:05:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 12:05:30,862 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:30,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:30,862 INFO L82 PathProgramCache]: Analyzing trace with hash 666270871, now seen corresponding path program 2 times [2020-04-18 12:05:30,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:30,862 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525345969] [2020-04-18 12:05:30,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:30,879 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 12:05:30,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525345969] [2020-04-18 12:05:30,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:30,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:30,880 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:30,881 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:30,881 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 12:05:30,881 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:30,894 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:30,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:30,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:30,895 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 12:05:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:30,898 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 12:05:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 12:05:30,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:30,898 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [645679961] [2020-04-18 12:05:30,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:30,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:30,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [645679961] [2020-04-18 12:05:30,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:30,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:30,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:30,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:30,900 INFO L87 Difference]: Start difference. First operand 6484 states. Second operand 3 states. [2020-04-18 12:05:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:31,052 INFO L93 Difference]: Finished difference Result 7629 states and 32588 transitions. [2020-04-18 12:05:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:31,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 12:05:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:31,109 INFO L225 Difference]: With dead ends: 7629 [2020-04-18 12:05:31,109 INFO L226 Difference]: Without dead ends: 7629 [2020-04-18 12:05:31,110 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:05:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7629 states. [2020-04-18 12:05:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7629 to 6366. [2020-04-18 12:05:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6366 states. [2020-04-18 12:05:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6366 states to 6366 states and 28029 transitions. [2020-04-18 12:05:31,633 INFO L78 Accepts]: Start accepts. Automaton has 6366 states and 28029 transitions. Word has length 5 [2020-04-18 12:05:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:31,634 INFO L479 AbstractCegarLoop]: Abstraction has 6366 states and 28029 transitions. [2020-04-18 12:05:31,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:31,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6366 states and 28029 transitions. [2020-04-18 12:05:31,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 12:05:31,634 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:31,634 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:31,635 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:31,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:31,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1690072825, now seen corresponding path program 1 times [2020-04-18 12:05:31,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:31,635 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [169993446] [2020-04-18 12:05:31,636 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:31,636 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 12:05:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 12:05:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 12:05:31,637 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:31,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:31,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1690072825, now seen corresponding path program 2 times [2020-04-18 12:05:31,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:31,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242012995] [2020-04-18 12:05:31,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:31,662 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 12:05:31,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242012995] [2020-04-18 12:05:31,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:31,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:31,664 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:31,664 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:31,665 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 12:05:31,665 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:31,668 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:31,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:31,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:31,668 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-04-18 12:05:31,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:31,671 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2020-04-18 12:05:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2020-04-18 12:05:31,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:31,671 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [169993446] [2020-04-18 12:05:31,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:31,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:31,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [169993446] [2020-04-18 12:05:31,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:31,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:31,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:31,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:31,673 INFO L87 Difference]: Start difference. First operand 6366 states and 28029 transitions. Second operand 3 states. [2020-04-18 12:05:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:31,770 INFO L93 Difference]: Finished difference Result 9120 states and 39254 transitions. [2020-04-18 12:05:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:31,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-04-18 12:05:31,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:31,818 INFO L225 Difference]: With dead ends: 9120 [2020-04-18 12:05:31,818 INFO L226 Difference]: Without dead ends: 9120 [2020-04-18 12:05:31,818 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 12:05:31,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9120 states. [2020-04-18 12:05:32,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9120 to 7564. [2020-04-18 12:05:32,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2020-04-18 12:05:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 33556 transitions. [2020-04-18 12:05:32,794 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 33556 transitions. Word has length 8 [2020-04-18 12:05:32,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:32,795 INFO L479 AbstractCegarLoop]: Abstraction has 7564 states and 33556 transitions. [2020-04-18 12:05:32,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 33556 transitions. [2020-04-18 12:05:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:32,795 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:32,795 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:32,796 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:32,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:32,796 INFO L82 PathProgramCache]: Analyzing trace with hash 868276956, now seen corresponding path program 1 times [2020-04-18 12:05:32,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:32,796 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [408433477] [2020-04-18 12:05:32,797 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:32,797 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2020-04-18 12:05:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 12:05:32,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:32,798 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:32,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:32,798 INFO L82 PathProgramCache]: Analyzing trace with hash 962075826, now seen corresponding path program 2 times [2020-04-18 12:05:32,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:32,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464031250] [2020-04-18 12:05:32,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:32,814 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 12:05:32,814 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464031250] [2020-04-18 12:05:32,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:32,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:32,815 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:32,815 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:32,816 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 12:05:32,816 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:32,819 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:32,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:32,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:32,820 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 12:05:32,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:32,825 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 12:05:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 12:05:32,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:32,826 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:32,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:32,826 INFO L82 PathProgramCache]: Analyzing trace with hash 868276956, now seen corresponding path program 3 times [2020-04-18 12:05:32,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:32,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133549090] [2020-04-18 12:05:32,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:32,845 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 12:05:32,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133549090] [2020-04-18 12:05:32,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:32,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:32,846 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:32,847 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:32,847 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 12:05:32,848 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:32,852 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:32,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:32,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 12:05:32,853 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 4 states. [2020-04-18 12:05:32,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:32,863 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 12:05:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 12:05:32,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:32,863 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [408433477] [2020-04-18 12:05:32,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:32,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:32,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [408433477] [2020-04-18 12:05:32,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 12:05:32,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:32,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:32,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:32,865 INFO L87 Difference]: Start difference. First operand 7564 states and 33556 transitions. Second operand 4 states. [2020-04-18 12:05:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:32,938 INFO L93 Difference]: Finished difference Result 6008 states and 26302 transitions. [2020-04-18 12:05:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:32,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-04-18 12:05:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:32,970 INFO L225 Difference]: With dead ends: 6008 [2020-04-18 12:05:32,970 INFO L226 Difference]: Without dead ends: 6008 [2020-04-18 12:05:32,970 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-04-18 12:05:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 4771. [2020-04-18 12:05:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4771 states. [2020-04-18 12:05:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 20598 transitions. [2020-04-18 12:05:33,271 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 20598 transitions. Word has length 9 [2020-04-18 12:05:33,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:33,271 INFO L479 AbstractCegarLoop]: Abstraction has 4771 states and 20598 transitions. [2020-04-18 12:05:33,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 12:05:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 20598 transitions. [2020-04-18 12:05:33,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:33,272 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:33,272 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:33,272 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:33,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:33,273 INFO L82 PathProgramCache]: Analyzing trace with hash 852652394, now seen corresponding path program 1 times [2020-04-18 12:05:33,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:33,273 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1092797837] [2020-04-18 12:05:33,273 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:33,274 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2020-04-18 12:05:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 12:05:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:33,274 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:33,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:33,275 INFO L82 PathProgramCache]: Analyzing trace with hash 868276948, now seen corresponding path program 2 times [2020-04-18 12:05:33,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:33,275 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685180541] [2020-04-18 12:05:33,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:33,289 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 12:05:33,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685180541] [2020-04-18 12:05:33,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:33,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:33,290 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:33,291 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:33,292 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-04-18 12:05:33,292 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:33,317 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:05:33,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:05:33,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:33,318 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2020-04-18 12:05:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:33,330 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 12:05:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 12:05:33,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:33,331 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:33,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:33,331 INFO L82 PathProgramCache]: Analyzing trace with hash 852652394, now seen corresponding path program 3 times [2020-04-18 12:05:33,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:33,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215395859] [2020-04-18 12:05:33,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:33,353 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 12:05:33,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215395859] [2020-04-18 12:05:33,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:33,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:33,355 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:33,356 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:33,356 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 12:05:33,357 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:33,363 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:33,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:33,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:05:33,364 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2020-04-18 12:05:33,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:33,376 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 12:05:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 12:05:33,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:33,377 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1092797837] [2020-04-18 12:05:33,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:33,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:33,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1092797837] [2020-04-18 12:05:33,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:05:33,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:33,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:05:33,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:33,381 INFO L87 Difference]: Start difference. First operand 4771 states and 20598 transitions. Second operand 6 states. [2020-04-18 12:05:33,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:33,464 INFO L93 Difference]: Finished difference Result 3827 states and 16326 transitions. [2020-04-18 12:05:33,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:33,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-04-18 12:05:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:33,482 INFO L225 Difference]: With dead ends: 3827 [2020-04-18 12:05:33,482 INFO L226 Difference]: Without dead ends: 3827 [2020-04-18 12:05:33,485 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:33,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2020-04-18 12:05:33,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 2883. [2020-04-18 12:05:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2883 states. [2020-04-18 12:05:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 12054 transitions. [2020-04-18 12:05:33,749 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 12054 transitions. Word has length 9 [2020-04-18 12:05:33,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:33,749 INFO L479 AbstractCegarLoop]: Abstraction has 2883 states and 12054 transitions. [2020-04-18 12:05:33,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:05:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 12054 transitions. [2020-04-18 12:05:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 12:05:33,749 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:33,750 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:33,750 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:33,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:33,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1095418705, now seen corresponding path program 1 times [2020-04-18 12:05:33,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:33,751 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [528698796] [2020-04-18 12:05:33,751 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:33,751 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 12:05:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 12:05:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 12:05:33,752 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:33,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:33,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1095418705, now seen corresponding path program 2 times [2020-04-18 12:05:33,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:33,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125552771] [2020-04-18 12:05:33,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:33,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:05:33,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125552771] [2020-04-18 12:05:33,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:33,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:33,778 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:33,778 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:33,780 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 12:05:33,781 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:33,785 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:33,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:33,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:33,786 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-04-18 12:05:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:33,789 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-04-18 12:05:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2020-04-18 12:05:33,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:33,790 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [528698796] [2020-04-18 12:05:33,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:33,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:33,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [528698796] [2020-04-18 12:05:33,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:33,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:33,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:33,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:33,791 INFO L87 Difference]: Start difference. First operand 2883 states and 12054 transitions. Second operand 3 states. [2020-04-18 12:05:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:33,851 INFO L93 Difference]: Finished difference Result 4275 states and 17545 transitions. [2020-04-18 12:05:33,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:33,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-04-18 12:05:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:33,869 INFO L225 Difference]: With dead ends: 4275 [2020-04-18 12:05:33,869 INFO L226 Difference]: Without dead ends: 4275 [2020-04-18 12:05:33,870 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 12:05:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2020-04-18 12:05:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 3574. [2020-04-18 12:05:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2020-04-18 12:05:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 15125 transitions. [2020-04-18 12:05:34,037 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 15125 transitions. Word has length 11 [2020-04-18 12:05:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:34,037 INFO L479 AbstractCegarLoop]: Abstraction has 3574 states and 15125 transitions. [2020-04-18 12:05:34,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 15125 transitions. [2020-04-18 12:05:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:05:34,038 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:34,038 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:34,038 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:34,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:34,038 INFO L82 PathProgramCache]: Analyzing trace with hash 401760447, now seen corresponding path program 1 times [2020-04-18 12:05:34,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:34,039 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1728718618] [2020-04-18 12:05:34,039 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:34,040 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 22 transitions. [2020-04-18 12:05:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 12:05:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:05:34,040 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:34,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:34,041 INFO L82 PathProgramCache]: Analyzing trace with hash 789549611, now seen corresponding path program 2 times [2020-04-18 12:05:34,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:34,041 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255494972] [2020-04-18 12:05:34,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:05:34,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255494972] [2020-04-18 12:05:34,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:34,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:34,062 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:34,063 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:34,064 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 21 transitions. [2020-04-18 12:05:34,064 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:34,087 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:05:34,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:05:34,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:34,088 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2020-04-18 12:05:34,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:34,101 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-04-18 12:05:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-04-18 12:05:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:05:34,102 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:34,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:34,102 INFO L82 PathProgramCache]: Analyzing trace with hash 401760447, now seen corresponding path program 3 times [2020-04-18 12:05:34,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:34,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907356046] [2020-04-18 12:05:34,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:05:34,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907356046] [2020-04-18 12:05:34,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:34,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:34,128 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:34,129 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:34,130 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 19 transitions. [2020-04-18 12:05:34,130 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:34,137 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:34,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:34,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:05:34,138 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 4 states. [2020-04-18 12:05:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:34,149 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-04-18 12:05:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-04-18 12:05:34,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:34,150 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1728718618] [2020-04-18 12:05:34,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:34,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:34,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1728718618] [2020-04-18 12:05:34,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:05:34,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:34,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:05:34,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:34,151 INFO L87 Difference]: Start difference. First operand 3574 states and 15125 transitions. Second operand 6 states. [2020-04-18 12:05:34,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:34,218 INFO L93 Difference]: Finished difference Result 2873 states and 12004 transitions. [2020-04-18 12:05:34,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:34,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-04-18 12:05:34,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:34,230 INFO L225 Difference]: With dead ends: 2873 [2020-04-18 12:05:34,230 INFO L226 Difference]: Without dead ends: 2873 [2020-04-18 12:05:34,231 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:34,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-04-18 12:05:34,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2172. [2020-04-18 12:05:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2172 states. [2020-04-18 12:05:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 8883 transitions. [2020-04-18 12:05:34,327 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 8883 transitions. Word has length 12 [2020-04-18 12:05:34,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:34,328 INFO L479 AbstractCegarLoop]: Abstraction has 2172 states and 8883 transitions. [2020-04-18 12:05:34,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:05:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 8883 transitions. [2020-04-18 12:05:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 12:05:34,328 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:34,329 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:34,329 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:34,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:34,329 INFO L82 PathProgramCache]: Analyzing trace with hash -596519610, now seen corresponding path program 1 times [2020-04-18 12:05:34,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:34,330 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [987740888] [2020-04-18 12:05:34,331 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:34,331 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 12:05:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 12:05:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 12:05:34,332 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:34,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:34,332 INFO L82 PathProgramCache]: Analyzing trace with hash -596519610, now seen corresponding path program 2 times [2020-04-18 12:05:34,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:34,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423232384] [2020-04-18 12:05:34,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 12:05:34,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423232384] [2020-04-18 12:05:34,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:34,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:34,350 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:34,351 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:34,352 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 12:05:34,352 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:34,356 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:34,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:34,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:34,357 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-04-18 12:05:34,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:34,360 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-04-18 12:05:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-04-18 12:05:34,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:34,360 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [987740888] [2020-04-18 12:05:34,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:34,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:34,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [987740888] [2020-04-18 12:05:34,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:34,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:34,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:34,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:34,362 INFO L87 Difference]: Start difference. First operand 2172 states and 8883 transitions. Second operand 3 states. [2020-04-18 12:05:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:34,586 INFO L93 Difference]: Finished difference Result 3177 states and 12799 transitions. [2020-04-18 12:05:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:34,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-04-18 12:05:34,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:34,597 INFO L225 Difference]: With dead ends: 3177 [2020-04-18 12:05:34,597 INFO L226 Difference]: Without dead ends: 3177 [2020-04-18 12:05:34,598 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 12:05:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2020-04-18 12:05:34,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2671. [2020-04-18 12:05:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2020-04-18 12:05:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 11075 transitions. [2020-04-18 12:05:34,695 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 11075 transitions. Word has length 14 [2020-04-18 12:05:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:34,695 INFO L479 AbstractCegarLoop]: Abstraction has 2671 states and 11075 transitions. [2020-04-18 12:05:34,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 11075 transitions. [2020-04-18 12:05:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 12:05:34,696 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:34,696 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:34,696 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:34,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:34,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1312236012, now seen corresponding path program 1 times [2020-04-18 12:05:34,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:34,697 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1435784731] [2020-04-18 12:05:34,698 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:34,698 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-04-18 12:05:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-04-18 12:05:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 12:05:34,699 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:34,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:34,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2092154442, now seen corresponding path program 2 times [2020-04-18 12:05:34,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:34,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869758462] [2020-04-18 12:05:34,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 12:05:34,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869758462] [2020-04-18 12:05:34,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:34,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:34,715 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:34,716 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:34,718 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 30 transitions. [2020-04-18 12:05:34,718 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:34,739 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:05:34,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:05:34,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:34,740 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-04-18 12:05:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:34,753 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-04-18 12:05:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-04-18 12:05:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 12:05:34,754 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:34,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:34,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1312236012, now seen corresponding path program 3 times [2020-04-18 12:05:34,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:34,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799036861] [2020-04-18 12:05:34,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 12:05:34,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799036861] [2020-04-18 12:05:34,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:34,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:34,775 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:34,776 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:34,778 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 28 transitions. [2020-04-18 12:05:34,778 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:34,785 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:34,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:34,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:05:34,785 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 4 states. [2020-04-18 12:05:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:34,796 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-04-18 12:05:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-04-18 12:05:34,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:34,796 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1435784731] [2020-04-18 12:05:34,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:34,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:34,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1435784731] [2020-04-18 12:05:34,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:05:34,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:34,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:05:34,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:34,798 INFO L87 Difference]: Start difference. First operand 2671 states and 11075 transitions. Second operand 6 states. [2020-04-18 12:05:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:34,857 INFO L93 Difference]: Finished difference Result 2165 states and 8845 transitions. [2020-04-18 12:05:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:34,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-04-18 12:05:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:34,864 INFO L225 Difference]: With dead ends: 2165 [2020-04-18 12:05:34,864 INFO L226 Difference]: Without dead ends: 2165 [2020-04-18 12:05:34,865 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2020-04-18 12:05:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1659. [2020-04-18 12:05:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2020-04-18 12:05:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 6615 transitions. [2020-04-18 12:05:34,935 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 6615 transitions. Word has length 15 [2020-04-18 12:05:34,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:34,936 INFO L479 AbstractCegarLoop]: Abstraction has 1659 states and 6615 transitions. [2020-04-18 12:05:34,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:05:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 6615 transitions. [2020-04-18 12:05:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 12:05:34,938 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:34,938 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:34,938 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:34,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1514810044, now seen corresponding path program 1 times [2020-04-18 12:05:34,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:34,941 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [656297492] [2020-04-18 12:05:34,942 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:34,942 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-04-18 12:05:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 12:05:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 12:05:34,943 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:34,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:34,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1514810044, now seen corresponding path program 2 times [2020-04-18 12:05:34,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:34,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388413691] [2020-04-18 12:05:34,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 12:05:34,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388413691] [2020-04-18 12:05:34,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:34,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:34,974 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:34,975 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:34,976 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-04-18 12:05:34,976 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:34,980 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:34,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:34,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:34,981 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 12:05:34,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:34,984 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2020-04-18 12:05:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2020-04-18 12:05:34,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:34,984 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [656297492] [2020-04-18 12:05:34,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:34,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:34,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [656297492] [2020-04-18 12:05:34,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:34,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:34,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:34,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:34,986 INFO L87 Difference]: Start difference. First operand 1659 states and 6615 transitions. Second operand 3 states. [2020-04-18 12:05:35,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:35,021 INFO L93 Difference]: Finished difference Result 2295 states and 9088 transitions. [2020-04-18 12:05:35,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:35,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-04-18 12:05:35,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:35,027 INFO L225 Difference]: With dead ends: 2295 [2020-04-18 12:05:35,027 INFO L226 Difference]: Without dead ends: 2295 [2020-04-18 12:05:35,028 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 12:05:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2020-04-18 12:05:35,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 1975. [2020-04-18 12:05:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2020-04-18 12:05:35,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 8000 transitions. [2020-04-18 12:05:35,082 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 8000 transitions. Word has length 17 [2020-04-18 12:05:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:35,082 INFO L479 AbstractCegarLoop]: Abstraction has 1975 states and 8000 transitions. [2020-04-18 12:05:35,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:35,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 8000 transitions. [2020-04-18 12:05:35,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 12:05:35,084 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:35,084 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:35,084 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:35,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:35,085 INFO L82 PathProgramCache]: Analyzing trace with hash -285527274, now seen corresponding path program 1 times [2020-04-18 12:05:35,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:35,085 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1715691353] [2020-04-18 12:05:35,086 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:35,086 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 34 transitions. [2020-04-18 12:05:35,087 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-04-18 12:05:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 12:05:35,087 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:35,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:35,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1114453212, now seen corresponding path program 2 times [2020-04-18 12:05:35,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:35,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517528349] [2020-04-18 12:05:35,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:35,105 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 12:05:35,105 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517528349] [2020-04-18 12:05:35,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:35,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:35,106 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:35,108 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:35,111 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 33 transitions. [2020-04-18 12:05:35,111 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:35,147 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:05:35,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:05:35,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:35,147 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-04-18 12:05:35,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:35,167 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2020-04-18 12:05:35,168 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2020-04-18 12:05:35,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 12:05:35,168 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:35,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:35,169 INFO L82 PathProgramCache]: Analyzing trace with hash -285527274, now seen corresponding path program 3 times [2020-04-18 12:05:35,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:35,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063092126] [2020-04-18 12:05:35,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 12:05:35,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063092126] [2020-04-18 12:05:35,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:35,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:35,200 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:35,202 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:35,205 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 31 transitions. [2020-04-18 12:05:35,206 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:35,216 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:35,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:35,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:05:35,217 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 4 states. [2020-04-18 12:05:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:35,232 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2020-04-18 12:05:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2020-04-18 12:05:35,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:35,233 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1715691353] [2020-04-18 12:05:35,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:35,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:35,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1715691353] [2020-04-18 12:05:35,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:05:35,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:35,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:05:35,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:35,234 INFO L87 Difference]: Start difference. First operand 1975 states and 8000 transitions. Second operand 6 states. [2020-04-18 12:05:35,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:35,301 INFO L93 Difference]: Finished difference Result 1655 states and 6592 transitions. [2020-04-18 12:05:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:35,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-04-18 12:05:35,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:35,309 INFO L225 Difference]: With dead ends: 1655 [2020-04-18 12:05:35,310 INFO L226 Difference]: Without dead ends: 1655 [2020-04-18 12:05:35,310 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:35,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2020-04-18 12:05:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1335. [2020-04-18 12:05:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335 states. [2020-04-18 12:05:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 5184 transitions. [2020-04-18 12:05:35,373 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 5184 transitions. Word has length 18 [2020-04-18 12:05:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:35,373 INFO L479 AbstractCegarLoop]: Abstraction has 1335 states and 5184 transitions. [2020-04-18 12:05:35,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:05:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 5184 transitions. [2020-04-18 12:05:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 12:05:35,376 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:35,377 INFO L425 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:35,377 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:35,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:35,378 INFO L82 PathProgramCache]: Analyzing trace with hash -285687237, now seen corresponding path program 1 times [2020-04-18 12:05:35,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:35,378 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1055551938] [2020-04-18 12:05:35,379 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:35,380 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 12:05:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-04-18 12:05:35,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 12:05:35,381 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:35,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:35,382 INFO L82 PathProgramCache]: Analyzing trace with hash -285687237, now seen corresponding path program 2 times [2020-04-18 12:05:35,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:35,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109254445] [2020-04-18 12:05:35,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 12:05:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 12:05:35,413 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 12:05:35,413 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 12:05:35,413 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 12:05:35,414 WARN L363 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 12:05:35,416 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-04-18 12:05:35,426 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,427 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,427 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,427 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,427 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,427 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,427 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,427 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,428 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,428 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,429 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,429 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,429 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,429 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,429 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,429 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,429 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,430 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,431 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,431 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,432 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,432 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,433 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,433 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,433 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,433 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,433 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,433 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,433 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,434 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,434 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,434 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,434 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,434 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,434 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,434 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,435 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,435 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,435 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,436 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,436 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,436 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,437 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,437 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,437 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,437 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,437 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,437 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,437 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,438 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,438 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,438 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,438 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,439 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,439 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,439 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,439 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,439 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,440 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,440 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,440 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,440 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,440 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,440 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,440 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,442 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,442 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,442 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,442 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,443 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,443 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,443 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,443 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,445 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,445 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,445 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,445 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,445 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,445 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,447 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,447 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,447 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,447 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,447 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,447 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,449 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,450 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,450 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,450 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,450 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,450 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,452 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,452 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,452 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,452 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,452 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,453 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,454 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,454 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,454 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,454 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,455 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,455 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:35,456 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-04-18 12:05:35,456 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 12:05:35,456 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 12:05:35,456 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 12:05:35,457 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 12:05:35,457 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 12:05:35,457 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 12:05:35,457 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 12:05:35,458 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 12:05:35,459 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 98 transitions, 256 flow [2020-04-18 12:05:35,459 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 98 transitions, 256 flow [2020-04-18 12:05:35,476 INFO L129 PetriNetUnfolder]: 13/151 cut-off events. [2020-04-18 12:05:35,477 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-04-18 12:05:35,478 INFO L80 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 151 events. 13/151 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 434 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2020-04-18 12:05:35,485 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 98 transitions, 256 flow [2020-04-18 12:05:35,506 INFO L129 PetriNetUnfolder]: 13/151 cut-off events. [2020-04-18 12:05:35,506 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-04-18 12:05:35,508 INFO L80 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 151 events. 13/151 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 434 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2020-04-18 12:05:35,515 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 6120 [2020-04-18 12:05:35,515 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 12:05:36,552 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-04-18 12:05:36,596 INFO L206 etLargeBlockEncoding]: Checked pairs total: 10455 [2020-04-18 12:05:36,596 INFO L214 etLargeBlockEncoding]: Total number of compositions: 89 [2020-04-18 12:05:36,596 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions, 126 flow [2020-04-18 12:05:40,353 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25940 states. [2020-04-18 12:05:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 25940 states. [2020-04-18 12:05:40,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 12:05:40,354 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:40,354 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 12:05:40,354 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash 862156483, now seen corresponding path program 1 times [2020-04-18 12:05:40,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:40,355 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1646606951] [2020-04-18 12:05:40,355 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:40,355 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 12:05:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 12:05:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 12:05:40,355 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:40,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:40,356 INFO L82 PathProgramCache]: Analyzing trace with hash 862156483, now seen corresponding path program 2 times [2020-04-18 12:05:40,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:40,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351139708] [2020-04-18 12:05:40,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:40,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 12:05:40,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351139708] [2020-04-18 12:05:40,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:40,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:40,369 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:40,369 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:40,369 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 12:05:40,369 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:40,383 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:40,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:40,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:40,384 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 12:05:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:40,387 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 12:05:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 12:05:40,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:40,387 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1646606951] [2020-04-18 12:05:40,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:40,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:40,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1646606951] [2020-04-18 12:05:40,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:40,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:40,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:40,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:40,389 INFO L87 Difference]: Start difference. First operand 25940 states. Second operand 3 states. [2020-04-18 12:05:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:41,872 INFO L93 Difference]: Finished difference Result 30660 states and 153869 transitions. [2020-04-18 12:05:41,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:41,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 12:05:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:41,978 INFO L225 Difference]: With dead ends: 30660 [2020-04-18 12:05:41,978 INFO L226 Difference]: Without dead ends: 30660 [2020-04-18 12:05:41,978 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:05:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30660 states. [2020-04-18 12:05:43,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30660 to 25560. [2020-04-18 12:05:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25560 states. [2020-04-18 12:05:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25560 states to 25560 states and 131665 transitions. [2020-04-18 12:05:43,929 INFO L78 Accepts]: Start accepts. Automaton has 25560 states and 131665 transitions. Word has length 5 [2020-04-18 12:05:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:43,929 INFO L479 AbstractCegarLoop]: Abstraction has 25560 states and 131665 transitions. [2020-04-18 12:05:43,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 25560 states and 131665 transitions. [2020-04-18 12:05:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 12:05:43,929 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:43,929 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:43,930 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:43,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:43,930 INFO L82 PathProgramCache]: Analyzing trace with hash 422134040, now seen corresponding path program 1 times [2020-04-18 12:05:43,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:43,930 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [628602431] [2020-04-18 12:05:43,930 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:43,931 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 12:05:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 12:05:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 12:05:43,931 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:43,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:43,932 INFO L82 PathProgramCache]: Analyzing trace with hash 422134040, now seen corresponding path program 2 times [2020-04-18 12:05:43,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:43,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350055864] [2020-04-18 12:05:43,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:43,944 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 12:05:43,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350055864] [2020-04-18 12:05:43,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:43,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:43,945 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:43,945 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:43,946 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 12:05:43,946 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:43,949 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:43,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:43,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:43,949 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-04-18 12:05:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:43,952 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2020-04-18 12:05:43,952 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2020-04-18 12:05:43,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:43,952 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [628602431] [2020-04-18 12:05:43,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:43,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:43,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [628602431] [2020-04-18 12:05:43,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:43,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:43,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:43,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:43,954 INFO L87 Difference]: Start difference. First operand 25560 states and 131665 transitions. Second operand 3 states. [2020-04-18 12:05:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:44,227 INFO L93 Difference]: Finished difference Result 36927 states and 186525 transitions. [2020-04-18 12:05:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:44,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-04-18 12:05:44,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:44,356 INFO L225 Difference]: With dead ends: 36927 [2020-04-18 12:05:44,356 INFO L226 Difference]: Without dead ends: 36927 [2020-04-18 12:05:44,356 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 12:05:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36927 states. [2020-04-18 12:05:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36927 to 30580. [2020-04-18 12:05:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30580 states. [2020-04-18 12:05:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30580 states to 30580 states and 158564 transitions. [2020-04-18 12:05:48,465 INFO L78 Accepts]: Start accepts. Automaton has 30580 states and 158564 transitions. Word has length 8 [2020-04-18 12:05:48,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:48,465 INFO L479 AbstractCegarLoop]: Abstraction has 30580 states and 158564 transitions. [2020-04-18 12:05:48,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:48,465 INFO L276 IsEmpty]: Start isEmpty. Operand 30580 states and 158564 transitions. [2020-04-18 12:05:48,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:48,466 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:48,466 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:48,466 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:48,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:48,466 INFO L82 PathProgramCache]: Analyzing trace with hash 203971322, now seen corresponding path program 1 times [2020-04-18 12:05:48,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:48,466 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [833800605] [2020-04-18 12:05:48,467 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:48,467 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2020-04-18 12:05:48,467 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 12:05:48,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:48,467 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:48,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:48,467 INFO L82 PathProgramCache]: Analyzing trace with hash 204004172, now seen corresponding path program 2 times [2020-04-18 12:05:48,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:48,468 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150805648] [2020-04-18 12:05:48,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-04-18 12:05:48,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150805648] [2020-04-18 12:05:48,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:48,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:48,497 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:48,498 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:48,499 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 12:05:48,499 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:48,502 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 12:05:48,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:48,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:48,503 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 12:05:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:48,508 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 12:05:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 12:05:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:48,508 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:48,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:48,509 INFO L82 PathProgramCache]: Analyzing trace with hash 203971322, now seen corresponding path program 3 times [2020-04-18 12:05:48,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:48,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973910559] [2020-04-18 12:05:48,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:48,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-04-18 12:05:48,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973910559] [2020-04-18 12:05:48,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:48,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:48,526 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:48,526 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:48,527 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 12:05:48,527 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:48,532 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:05:48,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:48,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 12:05:48,532 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 4 states. [2020-04-18 12:05:48,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:48,543 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 12:05:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 12:05:48,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:48,544 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [833800605] [2020-04-18 12:05:48,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:48,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:48,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [833800605] [2020-04-18 12:05:48,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 12:05:48,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:48,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:48,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:48,545 INFO L87 Difference]: Start difference. First operand 30580 states and 158564 transitions. Second operand 4 states. [2020-04-18 12:05:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:48,820 INFO L93 Difference]: Finished difference Result 24233 states and 124256 transitions. [2020-04-18 12:05:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:48,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-04-18 12:05:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:48,948 INFO L225 Difference]: With dead ends: 24233 [2020-04-18 12:05:48,948 INFO L226 Difference]: Without dead ends: 24233 [2020-04-18 12:05:48,948 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:49,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24233 states. [2020-04-18 12:05:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24233 to 19165. [2020-04-18 12:05:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19165 states. [2020-04-18 12:05:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19165 states to 19165 states and 97114 transitions. [2020-04-18 12:05:51,782 INFO L78 Accepts]: Start accepts. Automaton has 19165 states and 97114 transitions. Word has length 9 [2020-04-18 12:05:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:51,783 INFO L479 AbstractCegarLoop]: Abstraction has 19165 states and 97114 transitions. [2020-04-18 12:05:51,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 12:05:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 19165 states and 97114 transitions. [2020-04-18 12:05:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:51,783 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:51,783 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:51,783 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:51,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:51,784 INFO L82 PathProgramCache]: Analyzing trace with hash 201256629, now seen corresponding path program 1 times [2020-04-18 12:05:51,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:51,784 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1304901428] [2020-04-18 12:05:51,784 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:51,784 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2020-04-18 12:05:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 12:05:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:51,785 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:51,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:51,785 INFO L82 PathProgramCache]: Analyzing trace with hash 203971299, now seen corresponding path program 2 times [2020-04-18 12:05:51,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:51,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908708123] [2020-04-18 12:05:51,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:51,798 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 12:05:51,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908708123] [2020-04-18 12:05:51,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:51,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:51,799 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:51,800 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:51,800 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-04-18 12:05:51,800 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:51,830 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:05:51,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:05:51,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:51,831 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2020-04-18 12:05:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:51,856 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 12:05:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 12:05:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:05:51,856 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:51,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash 201256629, now seen corresponding path program 3 times [2020-04-18 12:05:51,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:51,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754781998] [2020-04-18 12:05:51,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:51,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 12:05:51,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754781998] [2020-04-18 12:05:51,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:51,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:51,875 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:51,876 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:51,876 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 12:05:51,877 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:51,883 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:51,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:51,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:05:51,883 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2020-04-18 12:05:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:51,894 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 12:05:51,894 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 12:05:51,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:51,894 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1304901428] [2020-04-18 12:05:51,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:51,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:51,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1304901428] [2020-04-18 12:05:51,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:05:51,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:51,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:05:51,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:51,896 INFO L87 Difference]: Start difference. First operand 19165 states and 97114 transitions. Second operand 6 states. [2020-04-18 12:05:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:52,082 INFO L93 Difference]: Finished difference Result 15344 states and 76976 transitions. [2020-04-18 12:05:52,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:52,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-04-18 12:05:52,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:52,146 INFO L225 Difference]: With dead ends: 15344 [2020-04-18 12:05:52,146 INFO L226 Difference]: Without dead ends: 15344 [2020-04-18 12:05:52,147 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15344 states. [2020-04-18 12:05:52,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15344 to 11523. [2020-04-18 12:05:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11523 states. [2020-04-18 12:05:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11523 states to 11523 states and 56838 transitions. [2020-04-18 12:05:52,758 INFO L78 Accepts]: Start accepts. Automaton has 11523 states and 56838 transitions. Word has length 9 [2020-04-18 12:05:52,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:52,758 INFO L479 AbstractCegarLoop]: Abstraction has 11523 states and 56838 transitions. [2020-04-18 12:05:52,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:05:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 11523 states and 56838 transitions. [2020-04-18 12:05:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 12:05:52,758 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:52,758 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:52,758 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:52,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:52,759 INFO L82 PathProgramCache]: Analyzing trace with hash -40974610, now seen corresponding path program 1 times [2020-04-18 12:05:52,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:52,759 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [984226859] [2020-04-18 12:05:52,759 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:52,760 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 12:05:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 12:05:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 12:05:52,760 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:52,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:52,760 INFO L82 PathProgramCache]: Analyzing trace with hash -40974610, now seen corresponding path program 2 times [2020-04-18 12:05:52,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:52,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834149772] [2020-04-18 12:05:52,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:05:52,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834149772] [2020-04-18 12:05:52,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:52,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:52,775 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:52,776 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:52,776 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 12:05:52,777 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:52,779 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:52,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:52,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:52,780 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-04-18 12:05:52,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:52,783 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-04-18 12:05:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2020-04-18 12:05:52,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:52,783 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [984226859] [2020-04-18 12:05:52,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:52,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:52,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [984226859] [2020-04-18 12:05:52,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:52,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:52,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:52,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:52,785 INFO L87 Difference]: Start difference. First operand 11523 states and 56838 transitions. Second operand 3 states. [2020-04-18 12:05:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:53,251 INFO L93 Difference]: Finished difference Result 17226 states and 83578 transitions. [2020-04-18 12:05:53,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:53,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-04-18 12:05:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:53,307 INFO L225 Difference]: With dead ends: 17226 [2020-04-18 12:05:53,308 INFO L226 Difference]: Without dead ends: 17226 [2020-04-18 12:05:53,308 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 12:05:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17226 states. [2020-04-18 12:05:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17226 to 14368. [2020-04-18 12:05:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14368 states. [2020-04-18 12:05:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14368 states to 14368 states and 71601 transitions. [2020-04-18 12:05:53,956 INFO L78 Accepts]: Start accepts. Automaton has 14368 states and 71601 transitions. Word has length 11 [2020-04-18 12:05:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:53,956 INFO L479 AbstractCegarLoop]: Abstraction has 14368 states and 71601 transitions. [2020-04-18 12:05:53,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 14368 states and 71601 transitions. [2020-04-18 12:05:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:05:53,957 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:53,957 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:53,957 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:53,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:53,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1270210238, now seen corresponding path program 1 times [2020-04-18 12:05:53,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:53,958 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [19030334] [2020-04-18 12:05:53,958 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:53,959 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 22 transitions. [2020-04-18 12:05:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 12:05:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:05:53,959 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:53,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash -314645844, now seen corresponding path program 2 times [2020-04-18 12:05:53,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:53,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807523008] [2020-04-18 12:05:53,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:53,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:05:53,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807523008] [2020-04-18 12:05:53,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:53,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:53,985 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:53,986 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:53,987 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 21 transitions. [2020-04-18 12:05:53,987 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:54,022 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:05:54,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:05:54,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:54,022 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2020-04-18 12:05:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:54,037 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-04-18 12:05:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-04-18 12:05:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:05:54,037 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:54,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:54,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1270210238, now seen corresponding path program 3 times [2020-04-18 12:05:54,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:54,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93528192] [2020-04-18 12:05:54,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:05:54,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93528192] [2020-04-18 12:05:54,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:54,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:54,059 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:54,059 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:54,060 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 19 transitions. [2020-04-18 12:05:54,060 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:54,067 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:54,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:54,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:05:54,068 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 4 states. [2020-04-18 12:05:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:54,079 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-04-18 12:05:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-04-18 12:05:54,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:54,079 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [19030334] [2020-04-18 12:05:54,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:54,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:54,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [19030334] [2020-04-18 12:05:54,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:05:54,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:54,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:05:54,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:54,081 INFO L87 Difference]: Start difference. First operand 14368 states and 71601 transitions. Second operand 6 states. [2020-04-18 12:05:54,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:54,205 INFO L93 Difference]: Finished difference Result 11510 states and 56766 transitions. [2020-04-18 12:05:54,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:54,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-04-18 12:05:54,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:54,244 INFO L225 Difference]: With dead ends: 11510 [2020-04-18 12:05:54,244 INFO L226 Difference]: Without dead ends: 11510 [2020-04-18 12:05:54,245 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11510 states. [2020-04-18 12:05:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11510 to 8652. [2020-04-18 12:05:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8652 states. [2020-04-18 12:05:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8652 states to 8652 states and 41931 transitions. [2020-04-18 12:05:54,590 INFO L78 Accepts]: Start accepts. Automaton has 8652 states and 41931 transitions. Word has length 12 [2020-04-18 12:05:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:54,590 INFO L479 AbstractCegarLoop]: Abstraction has 8652 states and 41931 transitions. [2020-04-18 12:05:54,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:05:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 8652 states and 41931 transitions. [2020-04-18 12:05:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 12:05:54,591 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:54,591 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:54,591 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:54,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:54,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1064251902, now seen corresponding path program 1 times [2020-04-18 12:05:54,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:54,592 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [182642505] [2020-04-18 12:05:54,593 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:54,593 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 12:05:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 12:05:54,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 12:05:54,594 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:54,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:54,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1064251902, now seen corresponding path program 2 times [2020-04-18 12:05:54,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:54,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669141224] [2020-04-18 12:05:54,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 12:05:54,631 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669141224] [2020-04-18 12:05:54,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:54,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:54,632 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:54,633 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:54,633 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 12:05:54,634 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:54,636 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:54,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:54,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:54,637 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-04-18 12:05:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:54,640 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-04-18 12:05:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-04-18 12:05:54,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:54,640 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [182642505] [2020-04-18 12:05:54,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:54,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:54,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [182642505] [2020-04-18 12:05:54,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:54,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:54,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:54,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:54,641 INFO L87 Difference]: Start difference. First operand 8652 states and 41931 transitions. Second operand 3 states. [2020-04-18 12:05:54,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:54,780 INFO L93 Difference]: Finished difference Result 12888 states and 61498 transitions. [2020-04-18 12:05:54,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:54,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-04-18 12:05:54,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:54,832 INFO L225 Difference]: With dead ends: 12888 [2020-04-18 12:05:54,832 INFO L226 Difference]: Without dead ends: 12888 [2020-04-18 12:05:54,833 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 12:05:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12888 states. [2020-04-18 12:05:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12888 to 10765. [2020-04-18 12:05:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10765 states. [2020-04-18 12:05:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10765 states to 10765 states and 52746 transitions. [2020-04-18 12:05:55,843 INFO L78 Accepts]: Start accepts. Automaton has 10765 states and 52746 transitions. Word has length 14 [2020-04-18 12:05:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:55,843 INFO L479 AbstractCegarLoop]: Abstraction has 10765 states and 52746 transitions. [2020-04-18 12:05:55,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 10765 states and 52746 transitions. [2020-04-18 12:05:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 12:05:55,845 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:55,845 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:55,845 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:55,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:55,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1367932408, now seen corresponding path program 1 times [2020-04-18 12:05:55,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:55,846 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1188418610] [2020-04-18 12:05:55,847 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:55,847 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-04-18 12:05:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-04-18 12:05:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 12:05:55,849 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:55,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:55,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2138911108, now seen corresponding path program 2 times [2020-04-18 12:05:55,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:55,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174147593] [2020-04-18 12:05:55,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 12:05:55,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174147593] [2020-04-18 12:05:55,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:55,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:55,871 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:55,872 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:55,874 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 30 transitions. [2020-04-18 12:05:55,874 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:55,898 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:05:55,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:05:55,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:55,898 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-04-18 12:05:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:55,915 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-04-18 12:05:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-04-18 12:05:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 12:05:55,916 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1367932408, now seen corresponding path program 3 times [2020-04-18 12:05:55,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:55,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15717041] [2020-04-18 12:05:55,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 12:05:55,936 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15717041] [2020-04-18 12:05:55,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:55,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:55,937 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:55,938 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:55,940 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 28 transitions. [2020-04-18 12:05:55,940 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:55,946 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:55,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:55,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:05:55,946 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 4 states. [2020-04-18 12:05:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:55,957 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-04-18 12:05:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-04-18 12:05:55,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:55,957 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1188418610] [2020-04-18 12:05:55,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:55,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:55,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1188418610] [2020-04-18 12:05:55,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:05:55,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:55,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:05:55,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:55,958 INFO L87 Difference]: Start difference. First operand 10765 states and 52746 transitions. Second operand 6 states. [2020-04-18 12:05:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:56,082 INFO L93 Difference]: Finished difference Result 8642 states and 41871 transitions. [2020-04-18 12:05:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:56,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-04-18 12:05:56,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:56,119 INFO L225 Difference]: With dead ends: 8642 [2020-04-18 12:05:56,119 INFO L226 Difference]: Without dead ends: 8642 [2020-04-18 12:05:56,120 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8642 states. [2020-04-18 12:05:56,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8642 to 6519. [2020-04-18 12:05:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6519 states. [2020-04-18 12:05:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6519 states to 6519 states and 30996 transitions. [2020-04-18 12:05:56,418 INFO L78 Accepts]: Start accepts. Automaton has 6519 states and 30996 transitions. Word has length 15 [2020-04-18 12:05:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:56,418 INFO L479 AbstractCegarLoop]: Abstraction has 6519 states and 30996 transitions. [2020-04-18 12:05:56,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:05:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 6519 states and 30996 transitions. [2020-04-18 12:05:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 12:05:56,419 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:56,419 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:56,419 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:56,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:56,420 INFO L82 PathProgramCache]: Analyzing trace with hash 152749525, now seen corresponding path program 1 times [2020-04-18 12:05:56,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:56,420 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2135637192] [2020-04-18 12:05:56,421 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:56,421 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-04-18 12:05:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 12:05:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 12:05:56,422 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:56,422 INFO L82 PathProgramCache]: Analyzing trace with hash 152749525, now seen corresponding path program 2 times [2020-04-18 12:05:56,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:56,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92427552] [2020-04-18 12:05:56,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 12:05:56,435 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92427552] [2020-04-18 12:05:56,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:56,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:56,435 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:56,436 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:56,438 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-04-18 12:05:56,438 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:56,447 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:56,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:56,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:56,448 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 12:05:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:56,455 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2020-04-18 12:05:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2020-04-18 12:05:56,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:56,456 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2135637192] [2020-04-18 12:05:56,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:56,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:56,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2135637192] [2020-04-18 12:05:56,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:56,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:56,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:56,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:56,457 INFO L87 Difference]: Start difference. First operand 6519 states and 30996 transitions. Second operand 3 states. [2020-04-18 12:05:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:56,536 INFO L93 Difference]: Finished difference Result 9576 states and 44989 transitions. [2020-04-18 12:05:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:56,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-04-18 12:05:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:56,562 INFO L225 Difference]: With dead ends: 9576 [2020-04-18 12:05:56,562 INFO L226 Difference]: Without dead ends: 9576 [2020-04-18 12:05:56,562 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 12:05:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9576 states. [2020-04-18 12:05:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9576 to 8044. [2020-04-18 12:05:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8044 states. [2020-04-18 12:05:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8044 states to 8044 states and 38736 transitions. [2020-04-18 12:05:56,830 INFO L78 Accepts]: Start accepts. Automaton has 8044 states and 38736 transitions. Word has length 17 [2020-04-18 12:05:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:56,830 INFO L479 AbstractCegarLoop]: Abstraction has 8044 states and 38736 transitions. [2020-04-18 12:05:56,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 8044 states and 38736 transitions. [2020-04-18 12:05:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 12:05:56,832 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:56,833 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:56,833 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:56,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:56,833 INFO L82 PathProgramCache]: Analyzing trace with hash 440270196, now seen corresponding path program 1 times [2020-04-18 12:05:56,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:56,833 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1391666871] [2020-04-18 12:05:56,834 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:56,835 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-04-18 12:05:56,835 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-04-18 12:05:56,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 12:05:56,835 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:56,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:56,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1252627610, now seen corresponding path program 2 times [2020-04-18 12:05:56,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:56,836 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663424637] [2020-04-18 12:05:56,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:56,864 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 12:05:56,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663424637] [2020-04-18 12:05:56,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:56,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:56,865 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:56,866 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:56,867 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 27 transitions. [2020-04-18 12:05:56,868 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:56,896 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:05:56,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:05:56,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:56,897 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-04-18 12:05:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:56,918 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-04-18 12:05:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-04-18 12:05:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 12:05:56,919 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:56,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:56,919 INFO L82 PathProgramCache]: Analyzing trace with hash 440270196, now seen corresponding path program 3 times [2020-04-18 12:05:56,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:56,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663660352] [2020-04-18 12:05:56,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 12:05:56,940 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663660352] [2020-04-18 12:05:56,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:56,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:56,940 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:56,942 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:56,943 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 25 transitions. [2020-04-18 12:05:56,943 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:56,951 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:56,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:56,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:05:56,952 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2020-04-18 12:05:56,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:56,962 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-04-18 12:05:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-04-18 12:05:56,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:56,962 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1391666871] [2020-04-18 12:05:56,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:56,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:56,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1391666871] [2020-04-18 12:05:56,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:05:56,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:56,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:05:56,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:56,964 INFO L87 Difference]: Start difference. First operand 8044 states and 38736 transitions. Second operand 6 states. [2020-04-18 12:05:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:57,054 INFO L93 Difference]: Finished difference Result 6512 states and 30951 transitions. [2020-04-18 12:05:57,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:57,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-04-18 12:05:57,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:57,071 INFO L225 Difference]: With dead ends: 6512 [2020-04-18 12:05:57,071 INFO L226 Difference]: Without dead ends: 6512 [2020-04-18 12:05:57,071 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6512 states. [2020-04-18 12:05:57,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6512 to 4980. [2020-04-18 12:05:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4980 states. [2020-04-18 12:05:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4980 states to 4980 states and 23166 transitions. [2020-04-18 12:05:57,237 INFO L78 Accepts]: Start accepts. Automaton has 4980 states and 23166 transitions. Word has length 18 [2020-04-18 12:05:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:57,237 INFO L479 AbstractCegarLoop]: Abstraction has 4980 states and 23166 transitions. [2020-04-18 12:05:57,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:05:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4980 states and 23166 transitions. [2020-04-18 12:05:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 12:05:57,239 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:57,239 INFO L425 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:57,240 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:57,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:57,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2026385382, now seen corresponding path program 1 times [2020-04-18 12:05:57,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:57,240 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1994658953] [2020-04-18 12:05:57,241 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:57,242 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2020-04-18 12:05:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-04-18 12:05:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 12:05:57,242 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:57,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2026385382, now seen corresponding path program 2 times [2020-04-18 12:05:57,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:57,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784901884] [2020-04-18 12:05:57,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-04-18 12:05:57,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784901884] [2020-04-18 12:05:57,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:57,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:57,261 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:57,262 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:57,264 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2020-04-18 12:05:57,264 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:57,267 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:57,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:57,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:57,268 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2020-04-18 12:05:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:57,271 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-04-18 12:05:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-04-18 12:05:57,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:57,271 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1994658953] [2020-04-18 12:05:57,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:57,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:05:57,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1994658953] [2020-04-18 12:05:57,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:05:57,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:57,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:05:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:05:57,272 INFO L87 Difference]: Start difference. First operand 4980 states and 23166 transitions. Second operand 3 states. [2020-04-18 12:05:57,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:57,355 INFO L93 Difference]: Finished difference Result 6912 states and 31999 transitions. [2020-04-18 12:05:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:57,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-04-18 12:05:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:57,374 INFO L225 Difference]: With dead ends: 6912 [2020-04-18 12:05:57,374 INFO L226 Difference]: Without dead ends: 6912 [2020-04-18 12:05:57,375 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 12:05:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6912 states. [2020-04-18 12:05:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6912 to 5944. [2020-04-18 12:05:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5944 states. [2020-04-18 12:05:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5944 states to 5944 states and 28053 transitions. [2020-04-18 12:05:57,621 INFO L78 Accepts]: Start accepts. Automaton has 5944 states and 28053 transitions. Word has length 20 [2020-04-18 12:05:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:57,622 INFO L479 AbstractCegarLoop]: Abstraction has 5944 states and 28053 transitions. [2020-04-18 12:05:57,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:05:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5944 states and 28053 transitions. [2020-04-18 12:05:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 12:05:57,624 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:57,625 INFO L425 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:57,625 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:57,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:57,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1606559931, now seen corresponding path program 1 times [2020-04-18 12:05:57,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:57,625 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1521659802] [2020-04-18 12:05:57,626 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:57,627 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 37 transitions. [2020-04-18 12:05:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-04-18 12:05:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 12:05:57,627 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:57,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:57,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2106052863, now seen corresponding path program 2 times [2020-04-18 12:05:57,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:57,628 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868844953] [2020-04-18 12:05:57,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-04-18 12:05:57,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868844953] [2020-04-18 12:05:57,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:57,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:05:57,642 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:57,643 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:57,646 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 36 transitions. [2020-04-18 12:05:57,646 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:57,671 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:05:57,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:05:57,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:05:57,672 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-04-18 12:05:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:57,684 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-04-18 12:05:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-04-18 12:05:57,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 12:05:57,685 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:05:57,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:57,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1606559931, now seen corresponding path program 3 times [2020-04-18 12:05:57,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:57,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141428066] [2020-04-18 12:05:57,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:05:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-04-18 12:05:57,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141428066] [2020-04-18 12:05:57,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:05:57,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:05:57,721 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:05:57,723 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:57,725 INFO L259 McrAutomatonBuilder]: Finished intersection with 29 states and 34 transitions. [2020-04-18 12:05:57,726 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:05:57,732 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:05:57,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:05:57,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:05:57,733 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 4 states. [2020-04-18 12:05:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:57,743 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-04-18 12:05:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-04-18 12:05:57,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:05:57,744 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1521659802] [2020-04-18 12:05:57,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:05:57,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:05:57,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1521659802] [2020-04-18 12:05:57,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:05:57,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:05:57,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:05:57,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:57,745 INFO L87 Difference]: Start difference. First operand 5944 states and 28053 transitions. Second operand 6 states. [2020-04-18 12:05:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:05:57,812 INFO L93 Difference]: Finished difference Result 4976 states and 23139 transitions. [2020-04-18 12:05:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:05:57,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-04-18 12:05:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:05:57,825 INFO L225 Difference]: With dead ends: 4976 [2020-04-18 12:05:57,826 INFO L226 Difference]: Without dead ends: 4976 [2020-04-18 12:05:57,826 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:05:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4976 states. [2020-04-18 12:05:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4976 to 4008. [2020-04-18 12:05:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4008 states. [2020-04-18 12:05:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 18225 transitions. [2020-04-18 12:05:57,965 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 18225 transitions. Word has length 21 [2020-04-18 12:05:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:05:57,965 INFO L479 AbstractCegarLoop]: Abstraction has 4008 states and 18225 transitions. [2020-04-18 12:05:57,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:05:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 18225 transitions. [2020-04-18 12:05:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 12:05:57,968 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:05:57,968 INFO L425 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:05:57,968 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:05:57,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:57,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1606739912, now seen corresponding path program 1 times [2020-04-18 12:05:57,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:05:57,969 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1018245132] [2020-04-18 12:05:57,970 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:05:57,971 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-04-18 12:05:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-04-18 12:05:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 12:05:57,971 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:05:57,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:05:57,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1606739912, now seen corresponding path program 2 times [2020-04-18 12:05:57,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:05:57,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698487854] [2020-04-18 12:05:57,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:05:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 12:05:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 12:05:57,989 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 12:05:57,990 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 12:05:57,990 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 12:05:57,991 WARN L363 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 12:05:57,991 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2020-04-18 12:05:58,000 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,000 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,001 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,001 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,001 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,001 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,001 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,001 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,001 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,002 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,002 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,002 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,002 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,002 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,003 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,003 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,003 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,003 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,003 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,003 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,003 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,003 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,004 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,004 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,004 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,004 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,004 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,004 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,005 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,005 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,005 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,005 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,005 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,006 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,006 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,006 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,006 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,007 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,007 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,008 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,008 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,008 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,008 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,008 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,008 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,008 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,008 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,009 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,009 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,009 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,009 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,009 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,009 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,009 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,010 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,010 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,011 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,011 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,011 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,011 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,011 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,011 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,011 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,012 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,012 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,013 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,013 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,013 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,013 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,013 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,013 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,014 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,014 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,014 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,014 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,015 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,015 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,015 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,015 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,016 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,016 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,018 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,019 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,019 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,019 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,019 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,019 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,021 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,021 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,021 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,021 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,021 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,021 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,023 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,023 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,023 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,023 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,023 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,023 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,024 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,025 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,025 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,025 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,025 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,025 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,027 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,027 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,027 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,027 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,027 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,027 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,029 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,029 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,029 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,029 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,029 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,030 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:05:58,031 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-04-18 12:05:58,031 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 12:05:58,031 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 12:05:58,031 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 12:05:58,031 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 12:05:58,031 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 12:05:58,031 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 12:05:58,032 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 12:05:58,032 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 12:05:58,033 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 111 transitions, 299 flow [2020-04-18 12:05:58,033 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions, 299 flow [2020-04-18 12:05:58,060 INFO L129 PetriNetUnfolder]: 15/173 cut-off events. [2020-04-18 12:05:58,060 INFO L130 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2020-04-18 12:05:58,063 INFO L80 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 173 events. 15/173 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 517 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 182. Up to 16 conditions per place. [2020-04-18 12:05:58,075 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions, 299 flow [2020-04-18 12:05:58,101 INFO L129 PetriNetUnfolder]: 15/173 cut-off events. [2020-04-18 12:05:58,101 INFO L130 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2020-04-18 12:05:58,103 INFO L80 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 173 events. 15/173 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 517 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 182. Up to 16 conditions per place. [2020-04-18 12:05:58,109 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 8232 [2020-04-18 12:05:58,110 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 12:05:59,211 INFO L206 etLargeBlockEncoding]: Checked pairs total: 13260 [2020-04-18 12:05:59,212 INFO L214 etLargeBlockEncoding]: Total number of compositions: 95 [2020-04-18 12:05:59,212 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 34 transitions, 145 flow [2020-04-18 12:06:36,955 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 103764 states. [2020-04-18 12:06:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 103764 states. [2020-04-18 12:06:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 12:06:36,956 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:06:36,956 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 12:06:36,956 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:06:36,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:06:36,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1079248743, now seen corresponding path program 1 times [2020-04-18 12:06:36,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:06:36,957 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1230826893] [2020-04-18 12:06:36,957 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:06:36,957 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 12:06:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 12:06:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 12:06:36,958 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:06:36,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:06:36,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1079248743, now seen corresponding path program 2 times [2020-04-18 12:06:36,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:06:36,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137286373] [2020-04-18 12:06:36,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:06:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:06:36,978 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 12:06:36,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137286373] [2020-04-18 12:06:36,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:06:36,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:06:36,979 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:06:36,979 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:06:36,979 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 12:06:36,980 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:06:36,982 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:06:36,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:06:36,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:06:36,983 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 12:06:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:06:36,985 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 12:06:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 12:06:36,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:06:36,986 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1230826893] [2020-04-18 12:06:36,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:06:36,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:06:36,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1230826893] [2020-04-18 12:06:36,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:06:36,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:06:36,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:06:36,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:06:36,987 INFO L87 Difference]: Start difference. First operand 103764 states. Second operand 3 states. [2020-04-18 12:06:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:06:38,536 INFO L93 Difference]: Finished difference Result 122811 states and 708293 transitions. [2020-04-18 12:06:38,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:06:38,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 12:06:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:06:39,033 INFO L225 Difference]: With dead ends: 122811 [2020-04-18 12:06:39,033 INFO L226 Difference]: Without dead ends: 122811 [2020-04-18 12:06:39,033 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:06:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122811 states. [2020-04-18 12:06:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122811 to 102354. [2020-04-18 12:06:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102354 states. [2020-04-18 12:06:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102354 states to 102354 states and 603935 transitions. [2020-04-18 12:06:56,813 INFO L78 Accepts]: Start accepts. Automaton has 102354 states and 603935 transitions. Word has length 5 [2020-04-18 12:06:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:06:56,813 INFO L479 AbstractCegarLoop]: Abstraction has 102354 states and 603935 transitions. [2020-04-18 12:06:56,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:06:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 102354 states and 603935 transitions. [2020-04-18 12:06:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 12:06:56,813 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:06:56,814 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 12:06:56,814 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:06:56,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:06:56,814 INFO L82 PathProgramCache]: Analyzing trace with hash -423468189, now seen corresponding path program 1 times [2020-04-18 12:06:56,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:06:56,814 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1989109300] [2020-04-18 12:06:56,815 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:06:56,815 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 12:06:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 12:06:56,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 12:06:56,815 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:06:56,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:06:56,816 INFO L82 PathProgramCache]: Analyzing trace with hash -423468189, now seen corresponding path program 2 times [2020-04-18 12:06:56,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:06:56,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011311390] [2020-04-18 12:06:56,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:06:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:06:56,830 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 12:06:56,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011311390] [2020-04-18 12:06:56,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:06:56,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:06:56,831 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:06:56,831 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:06:56,832 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 12:06:56,832 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:06:56,835 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:06:56,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:06:56,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:06:56,836 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-04-18 12:06:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:06:56,840 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2020-04-18 12:06:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2020-04-18 12:06:56,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:06:56,841 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1989109300] [2020-04-18 12:06:56,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:06:56,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:06:56,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1989109300] [2020-04-18 12:06:56,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:06:56,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:06:56,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:06:56,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:06:56,842 INFO L87 Difference]: Start difference. First operand 102354 states and 603935 transitions. Second operand 3 states. [2020-04-18 12:06:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:06:57,937 INFO L93 Difference]: Finished difference Result 148254 states and 859795 transitions. [2020-04-18 12:06:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:06:57,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-04-18 12:06:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:06:58,531 INFO L225 Difference]: With dead ends: 148254 [2020-04-18 12:06:58,532 INFO L226 Difference]: Without dead ends: 148254 [2020-04-18 12:06:58,532 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 12:07:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148254 states. [2020-04-18 12:07:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148254 to 122716. [2020-04-18 12:07:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122716 states. [2020-04-18 12:07:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122716 states to 122716 states and 728220 transitions. [2020-04-18 12:07:19,507 INFO L78 Accepts]: Start accepts. Automaton has 122716 states and 728220 transitions. Word has length 8 [2020-04-18 12:07:19,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:07:19,507 INFO L479 AbstractCegarLoop]: Abstraction has 122716 states and 728220 transitions. [2020-04-18 12:07:19,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:07:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 122716 states and 728220 transitions. [2020-04-18 12:07:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:07:19,508 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:07:19,508 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:07:19,508 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:07:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:07:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash -242594376, now seen corresponding path program 1 times [2020-04-18 12:07:19,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:07:19,509 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1455922517] [2020-04-18 12:07:19,509 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:07:19,510 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2020-04-18 12:07:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 12:07:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:07:19,510 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:07:19,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:07:19,511 INFO L82 PathProgramCache]: Analyzing trace with hash -242595696, now seen corresponding path program 2 times [2020-04-18 12:07:19,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:07:19,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867559109] [2020-04-18 12:07:19,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:07:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:07:19,520 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 12:07:19,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867559109] [2020-04-18 12:07:19,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:07:19,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:07:19,521 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:07:19,521 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:07:19,522 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 12:07:19,522 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:07:19,526 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 12:07:19,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:07:19,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:07:19,526 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 12:07:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:07:19,535 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 12:07:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 12:07:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:07:19,536 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:07:19,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:07:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash -242594376, now seen corresponding path program 3 times [2020-04-18 12:07:19,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:07:19,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959203875] [2020-04-18 12:07:19,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:07:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:07:19,566 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 12:07:19,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959203875] [2020-04-18 12:07:19,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:07:19,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:07:19,567 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:07:19,568 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:07:19,569 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 12:07:19,569 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:07:19,575 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 12:07:19,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:07:19,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 12:07:19,575 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 4 states. [2020-04-18 12:07:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:07:19,584 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 12:07:19,584 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 12:07:19,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:07:19,585 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1455922517] [2020-04-18 12:07:19,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:07:19,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:07:19,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1455922517] [2020-04-18 12:07:19,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 12:07:19,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:07:19,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:07:19,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:07:19,586 INFO L87 Difference]: Start difference. First operand 122716 states and 728220 transitions. Second operand 4 states. [2020-04-18 12:07:25,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:07:25,482 INFO L93 Difference]: Finished difference Result 97178 states and 571107 transitions. [2020-04-18 12:07:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:07:25,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-04-18 12:07:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:07:25,859 INFO L225 Difference]: With dead ends: 97178 [2020-04-18 12:07:25,859 INFO L226 Difference]: Without dead ends: 97178 [2020-04-18 12:07:25,860 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:07:32,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97178 states. [2020-04-18 12:07:34,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97178 to 76759. [2020-04-18 12:07:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76759 states. [2020-04-18 12:07:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76759 states to 76759 states and 446504 transitions. [2020-04-18 12:07:34,799 INFO L78 Accepts]: Start accepts. Automaton has 76759 states and 446504 transitions. Word has length 9 [2020-04-18 12:07:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:07:34,800 INFO L479 AbstractCegarLoop]: Abstraction has 76759 states and 446504 transitions. [2020-04-18 12:07:34,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 12:07:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 76759 states and 446504 transitions. [2020-04-18 12:07:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:07:34,800 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:07:34,800 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:07:34,800 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:07:34,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:07:34,801 INFO L82 PathProgramCache]: Analyzing trace with hash -242609250, now seen corresponding path program 1 times [2020-04-18 12:07:34,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:07:34,801 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [940527320] [2020-04-18 12:07:34,801 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:07:34,802 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2020-04-18 12:07:34,802 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 12:07:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:07:34,802 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:07:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:07:34,802 INFO L82 PathProgramCache]: Analyzing trace with hash -242610870, now seen corresponding path program 2 times [2020-04-18 12:07:34,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:07:34,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603771230] [2020-04-18 12:07:34,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:07:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:07:34,813 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 12:07:34,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603771230] [2020-04-18 12:07:34,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:07:34,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:07:34,814 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:07:34,814 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:07:34,815 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-04-18 12:07:34,815 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:07:34,818 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:07:34,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:07:34,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:07:34,819 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-04-18 12:07:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:07:34,823 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 12:07:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 12:07:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 12:07:34,824 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:07:34,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:07:34,824 INFO L82 PathProgramCache]: Analyzing trace with hash -242609250, now seen corresponding path program 3 times [2020-04-18 12:07:34,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:07:34,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568132037] [2020-04-18 12:07:34,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:07:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:07:34,841 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 12:07:34,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568132037] [2020-04-18 12:07:34,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:07:34,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:07:34,842 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:07:34,842 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:07:34,843 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 12:07:34,843 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:07:34,847 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:07:34,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:07:34,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 12:07:34,848 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2020-04-18 12:07:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:07:34,857 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 12:07:34,857 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 12:07:34,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:07:34,857 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [940527320] [2020-04-18 12:07:34,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:07:34,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:07:34,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [940527320] [2020-04-18 12:07:34,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 12:07:34,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:07:34,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:07:34,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:07:34,859 INFO L87 Difference]: Start difference. First operand 76759 states and 446504 transitions. Second operand 4 states. [2020-04-18 12:07:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:07:36,627 INFO L93 Difference]: Finished difference Result 61421 states and 354199 transitions. [2020-04-18 12:07:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:07:36,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-04-18 12:07:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:07:36,877 INFO L225 Difference]: With dead ends: 61421 [2020-04-18 12:07:36,877 INFO L226 Difference]: Without dead ends: 61421 [2020-04-18 12:07:36,878 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:07:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61421 states. [2020-04-18 12:07:46,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61421 to 46083. [2020-04-18 12:07:46,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46083 states. [2020-04-18 12:07:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46083 states to 46083 states and 261894 transitions. [2020-04-18 12:07:46,533 INFO L78 Accepts]: Start accepts. Automaton has 46083 states and 261894 transitions. Word has length 9 [2020-04-18 12:07:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:07:46,533 INFO L479 AbstractCegarLoop]: Abstraction has 46083 states and 261894 transitions. [2020-04-18 12:07:46,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 12:07:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 46083 states and 261894 transitions. [2020-04-18 12:07:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 12:07:46,533 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:07:46,534 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-04-18 12:07:46,534 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:07:46,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:07:46,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1404864702, now seen corresponding path program 1 times [2020-04-18 12:07:46,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:07:46,534 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1655029756] [2020-04-18 12:07:46,534 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:07:46,535 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 12:07:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 12:07:46,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 12:07:46,535 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:07:46,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:07:46,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1404864702, now seen corresponding path program 2 times [2020-04-18 12:07:46,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:07:46,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584876900] [2020-04-18 12:07:46,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:07:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:07:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:07:46,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584876900] [2020-04-18 12:07:46,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:07:46,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:07:46,546 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:07:46,546 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:07:46,546 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 12:07:46,547 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:07:46,551 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:07:46,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:07:46,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:07:46,551 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-04-18 12:07:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:07:46,553 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-04-18 12:07:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2020-04-18 12:07:46,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:07:46,553 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1655029756] [2020-04-18 12:07:46,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:07:46,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:07:46,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1655029756] [2020-04-18 12:07:46,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:07:46,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:07:46,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:07:46,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:07:46,554 INFO L87 Difference]: Start difference. First operand 46083 states and 261894 transitions. Second operand 3 states. [2020-04-18 12:07:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:07:47,708 INFO L93 Difference]: Finished difference Result 69057 states and 386770 transitions. [2020-04-18 12:07:47,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:07:47,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-04-18 12:07:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:07:47,987 INFO L225 Difference]: With dead ends: 69057 [2020-04-18 12:07:47,988 INFO L226 Difference]: Without dead ends: 69057 [2020-04-18 12:07:47,988 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 12:07:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69057 states. [2020-04-18 12:07:56,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69057 to 57562. [2020-04-18 12:07:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57562 states. [2020-04-18 12:07:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57562 states to 57562 states and 330031 transitions. [2020-04-18 12:07:57,044 INFO L78 Accepts]: Start accepts. Automaton has 57562 states and 330031 transitions. Word has length 11 [2020-04-18 12:07:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:07:57,044 INFO L479 AbstractCegarLoop]: Abstraction has 57562 states and 330031 transitions. [2020-04-18 12:07:57,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:07:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 57562 states and 330031 transitions. [2020-04-18 12:07:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:07:57,044 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:07:57,044 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:07:57,045 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:07:57,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:07:57,045 INFO L82 PathProgramCache]: Analyzing trace with hash -601130141, now seen corresponding path program 1 times [2020-04-18 12:07:57,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:07:57,045 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [773858146] [2020-04-18 12:07:57,046 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:07:57,046 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 28 transitions. [2020-04-18 12:07:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-04-18 12:07:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:07:57,047 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:07:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:07:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash -601131701, now seen corresponding path program 2 times [2020-04-18 12:07:57,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:07:57,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185358549] [2020-04-18 12:07:57,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:07:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:07:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:07:57,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185358549] [2020-04-18 12:07:57,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:07:57,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:07:57,060 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:07:57,061 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:07:57,062 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-04-18 12:07:57,062 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:07:57,065 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:07:57,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:07:57,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:07:57,066 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2020-04-18 12:07:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:07:57,070 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-04-18 12:07:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2020-04-18 12:07:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 12:07:57,071 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:07:57,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:07:57,071 INFO L82 PathProgramCache]: Analyzing trace with hash -601130141, now seen corresponding path program 3 times [2020-04-18 12:07:57,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:07:57,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125558860] [2020-04-18 12:07:57,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:07:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:07:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 12:07:57,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125558860] [2020-04-18 12:07:57,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:07:57,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:07:57,088 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:07:57,089 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:07:57,091 INFO L259 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2020-04-18 12:07:57,091 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:07:57,096 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:07:57,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:07:57,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 12:07:57,096 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 4 states. [2020-04-18 12:07:57,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:07:57,107 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-04-18 12:07:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2020-04-18 12:07:57,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:07:57,108 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [773858146] [2020-04-18 12:07:57,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:07:57,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:07:57,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [773858146] [2020-04-18 12:07:57,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 12:07:57,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:07:57,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:07:57,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:07:57,109 INFO L87 Difference]: Start difference. First operand 57562 states and 330031 transitions. Second operand 4 states. [2020-04-18 12:07:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:07:57,442 INFO L93 Difference]: Finished difference Result 46067 states and 261797 transitions. [2020-04-18 12:07:57,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:07:57,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-04-18 12:07:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:07:57,608 INFO L225 Difference]: With dead ends: 46067 [2020-04-18 12:07:57,608 INFO L226 Difference]: Without dead ends: 46067 [2020-04-18 12:07:57,608 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:08:00,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46067 states. [2020-04-18 12:08:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46067 to 34572. [2020-04-18 12:08:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34572 states. [2020-04-18 12:08:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34572 states to 34572 states and 193563 transitions. [2020-04-18 12:08:04,175 INFO L78 Accepts]: Start accepts. Automaton has 34572 states and 193563 transitions. Word has length 12 [2020-04-18 12:08:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:08:04,175 INFO L479 AbstractCegarLoop]: Abstraction has 34572 states and 193563 transitions. [2020-04-18 12:08:04,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 12:08:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 34572 states and 193563 transitions. [2020-04-18 12:08:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 12:08:04,175 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:08:04,176 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:08:04,176 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:08:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1950756351, now seen corresponding path program 1 times [2020-04-18 12:08:04,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:08:04,176 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [55826149] [2020-04-18 12:08:04,177 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:04,177 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 12:08:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 12:08:04,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 12:08:04,177 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:08:04,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:04,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1950756351, now seen corresponding path program 2 times [2020-04-18 12:08:04,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:08:04,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817459753] [2020-04-18 12:08:04,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:08:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:08:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 12:08:04,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817459753] [2020-04-18 12:08:04,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:08:04,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:08:04,189 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:08:04,189 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:04,190 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 12:08:04,191 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:08:04,193 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:08:04,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:08:04,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:08:04,194 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-04-18 12:08:04,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:04,197 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-04-18 12:08:04,197 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-04-18 12:08:04,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:08:04,197 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [55826149] [2020-04-18 12:08:04,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:08:04,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:08:04,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [55826149] [2020-04-18 12:08:04,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:08:04,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:08:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:08:04,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:08:04,198 INFO L87 Difference]: Start difference. First operand 34572 states and 193563 transitions. Second operand 3 states. [2020-04-18 12:08:04,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:04,616 INFO L93 Difference]: Finished difference Result 51759 states and 285634 transitions. [2020-04-18 12:08:04,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:08:04,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-04-18 12:08:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:08:04,799 INFO L225 Difference]: With dead ends: 51759 [2020-04-18 12:08:04,799 INFO L226 Difference]: Without dead ends: 51759 [2020-04-18 12:08:04,799 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 12:08:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51759 states. [2020-04-18 12:08:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51759 to 43159. [2020-04-18 12:08:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43159 states. [2020-04-18 12:08:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43159 states to 43159 states and 243856 transitions. [2020-04-18 12:08:08,628 INFO L78 Accepts]: Start accepts. Automaton has 43159 states and 243856 transitions. Word has length 14 [2020-04-18 12:08:08,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:08:08,628 INFO L479 AbstractCegarLoop]: Abstraction has 43159 states and 243856 transitions. [2020-04-18 12:08:08,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:08:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 43159 states and 243856 transitions. [2020-04-18 12:08:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 12:08:08,629 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:08:08,629 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:08:08,629 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:08:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash 343906870, now seen corresponding path program 1 times [2020-04-18 12:08:08,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:08:08,629 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1123635428] [2020-04-18 12:08:08,630 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:08,630 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 25 transitions. [2020-04-18 12:08:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-04-18 12:08:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 12:08:08,630 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:08:08,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:08,631 INFO L82 PathProgramCache]: Analyzing trace with hash 343905820, now seen corresponding path program 2 times [2020-04-18 12:08:08,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:08:08,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116098918] [2020-04-18 12:08:08,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:08:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:08:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 12:08:08,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116098918] [2020-04-18 12:08:08,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:08:08,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:08:08,646 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:08:08,647 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:08,649 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 24 transitions. [2020-04-18 12:08:08,649 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:08:08,652 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:08:08,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:08:08,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:08:08,652 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2020-04-18 12:08:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:08,658 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-04-18 12:08:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-04-18 12:08:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 12:08:08,658 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:08:08,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:08,659 INFO L82 PathProgramCache]: Analyzing trace with hash 343906870, now seen corresponding path program 3 times [2020-04-18 12:08:08,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:08:08,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896244206] [2020-04-18 12:08:08,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:08:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:08:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 12:08:08,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896244206] [2020-04-18 12:08:08,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:08:08,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:08:08,678 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:08:08,679 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:08,681 INFO L259 McrAutomatonBuilder]: Finished intersection with 20 states and 22 transitions. [2020-04-18 12:08:08,681 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:08:08,685 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:08:08,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:08:08,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 12:08:08,685 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 4 states. [2020-04-18 12:08:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:08,694 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-04-18 12:08:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-04-18 12:08:08,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:08:08,695 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1123635428] [2020-04-18 12:08:08,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:08:08,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:08:08,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1123635428] [2020-04-18 12:08:08,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 12:08:08,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:08:08,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:08:08,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:08:08,696 INFO L87 Difference]: Start difference. First operand 43159 states and 243856 transitions. Second operand 4 states. [2020-04-18 12:08:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:08,952 INFO L93 Difference]: Finished difference Result 34559 states and 193478 transitions. [2020-04-18 12:08:08,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:08:08,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-04-18 12:08:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:08:09,068 INFO L225 Difference]: With dead ends: 34559 [2020-04-18 12:08:09,069 INFO L226 Difference]: Without dead ends: 34559 [2020-04-18 12:08:09,069 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:08:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34559 states. [2020-04-18 12:08:11,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34559 to 25959. [2020-04-18 12:08:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25959 states. [2020-04-18 12:08:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25959 states to 25959 states and 143100 transitions. [2020-04-18 12:08:11,534 INFO L78 Accepts]: Start accepts. Automaton has 25959 states and 143100 transitions. Word has length 15 [2020-04-18 12:08:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:08:11,534 INFO L479 AbstractCegarLoop]: Abstraction has 25959 states and 143100 transitions. [2020-04-18 12:08:11,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 12:08:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 25959 states and 143100 transitions. [2020-04-18 12:08:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 12:08:11,535 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:08:11,535 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:08:11,535 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:08:11,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:11,536 INFO L82 PathProgramCache]: Analyzing trace with hash -408592942, now seen corresponding path program 1 times [2020-04-18 12:08:11,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:08:11,536 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2060919627] [2020-04-18 12:08:11,536 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:11,537 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-04-18 12:08:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 12:08:11,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 12:08:11,537 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:08:11,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:11,538 INFO L82 PathProgramCache]: Analyzing trace with hash -408592942, now seen corresponding path program 2 times [2020-04-18 12:08:11,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:08:11,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168966819] [2020-04-18 12:08:11,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:08:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:08:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 12:08:11,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168966819] [2020-04-18 12:08:11,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:08:11,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:08:11,550 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:08:11,551 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:11,552 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-04-18 12:08:11,552 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:08:11,555 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:08:11,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:08:11,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:08:11,556 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 12:08:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:11,558 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2020-04-18 12:08:11,559 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2020-04-18 12:08:11,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:08:11,559 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2060919627] [2020-04-18 12:08:11,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:08:11,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:08:11,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2060919627] [2020-04-18 12:08:11,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:08:11,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:08:11,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:08:11,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:08:11,560 INFO L87 Difference]: Start difference. First operand 25959 states and 143100 transitions. Second operand 3 states. [2020-04-18 12:08:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:11,829 INFO L93 Difference]: Finished difference Result 38727 states and 210643 transitions. [2020-04-18 12:08:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:08:11,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-04-18 12:08:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:08:11,963 INFO L225 Difference]: With dead ends: 38727 [2020-04-18 12:08:11,963 INFO L226 Difference]: Without dead ends: 38727 [2020-04-18 12:08:11,963 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 12:08:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38727 states. [2020-04-18 12:08:14,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38727 to 32338. [2020-04-18 12:08:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32338 states. [2020-04-18 12:08:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32338 states to 32338 states and 180031 transitions. [2020-04-18 12:08:14,400 INFO L78 Accepts]: Start accepts. Automaton has 32338 states and 180031 transitions. Word has length 17 [2020-04-18 12:08:14,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:08:14,400 INFO L479 AbstractCegarLoop]: Abstraction has 32338 states and 180031 transitions. [2020-04-18 12:08:14,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:08:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 32338 states and 180031 transitions. [2020-04-18 12:08:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 12:08:14,401 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:08:14,401 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:08:14,401 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:08:14,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:14,401 INFO L82 PathProgramCache]: Analyzing trace with hash 218524327, now seen corresponding path program 1 times [2020-04-18 12:08:14,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:08:14,401 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2018035318] [2020-04-18 12:08:14,402 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:14,402 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-04-18 12:08:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-04-18 12:08:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 12:08:14,403 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:08:14,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:14,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1651387971, now seen corresponding path program 2 times [2020-04-18 12:08:14,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:08:14,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101732218] [2020-04-18 12:08:14,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:08:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:08:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 12:08:14,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101732218] [2020-04-18 12:08:14,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:08:14,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:08:14,416 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:08:14,417 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:14,419 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 27 transitions. [2020-04-18 12:08:14,419 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:08:14,440 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:08:14,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:08:14,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:08:14,441 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-04-18 12:08:14,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:14,460 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-04-18 12:08:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-04-18 12:08:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 12:08:14,461 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:08:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:14,461 INFO L82 PathProgramCache]: Analyzing trace with hash 218524327, now seen corresponding path program 3 times [2020-04-18 12:08:14,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:08:14,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201470572] [2020-04-18 12:08:14,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:08:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:08:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 12:08:14,484 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201470572] [2020-04-18 12:08:14,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:08:14,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:08:14,485 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:08:14,486 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:14,488 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 25 transitions. [2020-04-18 12:08:14,488 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:08:14,496 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:08:14,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:08:14,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:08:14,497 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2020-04-18 12:08:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:14,507 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-04-18 12:08:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-04-18 12:08:14,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:08:14,507 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2018035318] [2020-04-18 12:08:14,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:08:14,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:08:14,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2018035318] [2020-04-18 12:08:14,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:08:14,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:08:14,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:08:14,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:08:14,508 INFO L87 Difference]: Start difference. First operand 32338 states and 180031 transitions. Second operand 6 states. [2020-04-18 12:08:14,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:14,870 INFO L93 Difference]: Finished difference Result 25949 states and 143030 transitions. [2020-04-18 12:08:14,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:08:14,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-04-18 12:08:14,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:08:15,009 INFO L225 Difference]: With dead ends: 25949 [2020-04-18 12:08:15,009 INFO L226 Difference]: Without dead ends: 25949 [2020-04-18 12:08:15,009 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:08:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25949 states. [2020-04-18 12:08:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25949 to 19560. [2020-04-18 12:08:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19560 states. [2020-04-18 12:08:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19560 states to 19560 states and 106029 transitions. [2020-04-18 12:08:16,590 INFO L78 Accepts]: Start accepts. Automaton has 19560 states and 106029 transitions. Word has length 18 [2020-04-18 12:08:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:08:16,590 INFO L479 AbstractCegarLoop]: Abstraction has 19560 states and 106029 transitions. [2020-04-18 12:08:16,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:08:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 19560 states and 106029 transitions. [2020-04-18 12:08:16,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 12:08:16,592 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:08:16,592 INFO L425 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:08:16,592 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:08:16,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:16,592 INFO L82 PathProgramCache]: Analyzing trace with hash -640482004, now seen corresponding path program 1 times [2020-04-18 12:08:16,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:08:16,593 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1460380660] [2020-04-18 12:08:16,593 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:16,594 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2020-04-18 12:08:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-04-18 12:08:16,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 12:08:16,594 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:08:16,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:16,594 INFO L82 PathProgramCache]: Analyzing trace with hash -640482004, now seen corresponding path program 2 times [2020-04-18 12:08:16,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:08:16,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077029469] [2020-04-18 12:08:16,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:08:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:08:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-04-18 12:08:16,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077029469] [2020-04-18 12:08:16,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:08:16,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:08:16,608 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:08:16,609 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:16,612 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2020-04-18 12:08:16,612 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:08:16,615 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:08:16,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:08:16,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:08:16,615 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2020-04-18 12:08:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:16,618 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-04-18 12:08:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-04-18 12:08:16,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:08:16,618 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1460380660] [2020-04-18 12:08:16,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:08:16,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:08:16,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1460380660] [2020-04-18 12:08:16,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:08:16,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:08:16,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:08:16,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:08:16,621 INFO L87 Difference]: Start difference. First operand 19560 states and 106029 transitions. Second operand 3 states. [2020-04-18 12:08:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:16,842 INFO L93 Difference]: Finished difference Result 28773 states and 154399 transitions. [2020-04-18 12:08:16,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:08:16,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-04-18 12:08:16,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:08:16,953 INFO L225 Difference]: With dead ends: 28773 [2020-04-18 12:08:16,953 INFO L226 Difference]: Without dead ends: 28773 [2020-04-18 12:08:16,953 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 12:08:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28773 states. [2020-04-18 12:08:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28773 to 24163. [2020-04-18 12:08:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24163 states. [2020-04-18 12:08:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24163 states to 24163 states and 132493 transitions. [2020-04-18 12:08:18,632 INFO L78 Accepts]: Start accepts. Automaton has 24163 states and 132493 transitions. Word has length 20 [2020-04-18 12:08:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:08:18,632 INFO L479 AbstractCegarLoop]: Abstraction has 24163 states and 132493 transitions. [2020-04-18 12:08:18,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:08:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 24163 states and 132493 transitions. [2020-04-18 12:08:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 12:08:18,634 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:08:18,634 INFO L425 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:08:18,635 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:08:18,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:18,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1619896945, now seen corresponding path program 1 times [2020-04-18 12:08:18,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:08:18,635 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1064840861] [2020-04-18 12:08:18,636 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:18,637 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 31 transitions. [2020-04-18 12:08:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-04-18 12:08:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 12:08:18,637 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:08:18,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1299505867, now seen corresponding path program 2 times [2020-04-18 12:08:18,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:08:18,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763986421] [2020-04-18 12:08:18,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:08:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:08:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-04-18 12:08:18,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763986421] [2020-04-18 12:08:18,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:08:18,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:08:18,651 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:08:18,652 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:18,655 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 30 transitions. [2020-04-18 12:08:18,655 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:08:18,674 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 12:08:18,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 12:08:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 12:08:18,675 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-04-18 12:08:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:18,686 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-04-18 12:08:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-04-18 12:08:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 12:08:18,686 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 12:08:18,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:18,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1619896945, now seen corresponding path program 3 times [2020-04-18 12:08:18,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:08:18,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819467575] [2020-04-18 12:08:18,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:08:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:08:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-04-18 12:08:18,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819467575] [2020-04-18 12:08:18,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:08:18,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 12:08:18,715 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:08:18,716 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:18,719 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 28 transitions. [2020-04-18 12:08:18,720 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:08:18,726 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:08:18,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 12:08:18,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 12:08:18,726 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 4 states. [2020-04-18 12:08:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:18,736 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-04-18 12:08:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-04-18 12:08:18,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:08:18,736 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1064840861] [2020-04-18 12:08:18,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:08:18,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 12:08:18,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1064840861] [2020-04-18 12:08:18,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 12:08:18,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:08:18,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 12:08:18,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:08:18,738 INFO L87 Difference]: Start difference. First operand 24163 states and 132493 transitions. Second operand 6 states. [2020-04-18 12:08:19,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:19,011 INFO L93 Difference]: Finished difference Result 19553 states and 105977 transitions. [2020-04-18 12:08:19,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:08:19,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-04-18 12:08:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:08:19,091 INFO L225 Difference]: With dead ends: 19553 [2020-04-18 12:08:19,091 INFO L226 Difference]: Without dead ends: 19553 [2020-04-18 12:08:19,091 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 12:08:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19553 states. [2020-04-18 12:08:19,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19553 to 14943. [2020-04-18 12:08:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2020-04-18 12:08:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 79461 transitions. [2020-04-18 12:08:19,975 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 79461 transitions. Word has length 21 [2020-04-18 12:08:19,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:08:19,975 INFO L479 AbstractCegarLoop]: Abstraction has 14943 states and 79461 transitions. [2020-04-18 12:08:19,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 12:08:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 79461 transitions. [2020-04-18 12:08:19,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 12:08:19,979 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:08:19,979 INFO L425 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:08:19,980 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:08:19,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:19,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1741862694, now seen corresponding path program 1 times [2020-04-18 12:08:19,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:08:19,981 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1112809157] [2020-04-18 12:08:19,981 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:19,983 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-04-18 12:08:19,983 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-04-18 12:08:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 12:08:19,983 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:08:19,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:19,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1741862694, now seen corresponding path program 2 times [2020-04-18 12:08:19,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:08:19,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063143937] [2020-04-18 12:08:19,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:08:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 12:08:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-04-18 12:08:20,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063143937] [2020-04-18 12:08:20,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 12:08:20,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 12:08:20,012 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 12:08:20,013 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:20,016 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-04-18 12:08:20,016 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 12:08:20,020 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 12:08:20,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:08:20,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:08:20,021 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2020-04-18 12:08:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:20,023 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2020-04-18 12:08:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2020-04-18 12:08:20,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 12:08:20,024 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1112809157] [2020-04-18 12:08:20,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 12:08:20,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 12:08:20,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1112809157] [2020-04-18 12:08:20,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 12:08:20,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 12:08:20,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 12:08:20,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 12:08:20,025 INFO L87 Difference]: Start difference. First operand 14943 states and 79461 transitions. Second operand 3 states. [2020-04-18 12:08:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 12:08:20,177 INFO L93 Difference]: Finished difference Result 20763 states and 109990 transitions. [2020-04-18 12:08:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 12:08:20,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-04-18 12:08:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 12:08:20,241 INFO L225 Difference]: With dead ends: 20763 [2020-04-18 12:08:20,241 INFO L226 Difference]: Without dead ends: 20763 [2020-04-18 12:08:20,241 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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 12:08:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20763 states. [2020-04-18 12:08:21,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20763 to 17851. [2020-04-18 12:08:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17851 states. [2020-04-18 12:08:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17851 states to 17851 states and 96166 transitions. [2020-04-18 12:08:21,362 INFO L78 Accepts]: Start accepts. Automaton has 17851 states and 96166 transitions. Word has length 23 [2020-04-18 12:08:21,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 12:08:21,362 INFO L479 AbstractCegarLoop]: Abstraction has 17851 states and 96166 transitions. [2020-04-18 12:08:21,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 12:08:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 17851 states and 96166 transitions. [2020-04-18 12:08:21,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 12:08:21,367 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 12:08:21,367 INFO L425 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 12:08:21,367 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 12:08:21,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:21,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1837019004, now seen corresponding path program 1 times [2020-04-18 12:08:21,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 12:08:21,368 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [772224184] [2020-04-18 12:08:21,368 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 12:08:21,369 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 24 transitions. [2020-04-18 12:08:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-04-18 12:08:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 12:08:21,369 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 12:08:21,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 12:08:21,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1837019004, now seen corresponding path program 2 times [2020-04-18 12:08:21,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 12:08:21,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483932351] [2020-04-18 12:08:21,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 12:08:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 12:08:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 12:08:21,384 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 12:08:21,385 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 12:08:21,385 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 12:08:21,385 WARN L363 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 12:08:21,386 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2020-04-18 12:08:21,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,406 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,406 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,407 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,407 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,408 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,408 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,408 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,408 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,408 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,408 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,408 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,409 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,409 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,409 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,409 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,409 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,409 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,409 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,410 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,410 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,410 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,410 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,410 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,410 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,410 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,411 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,411 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,411 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,411 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,411 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,411 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,411 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,411 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,412 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,412 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,412 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,412 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,412 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,412 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,412 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,413 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,413 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,413 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,413 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,413 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,413 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,413 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,414 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,414 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,414 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,414 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,414 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,414 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,414 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,415 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,415 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,415 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,415 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,415 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,415 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,415 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,415 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,416 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,416 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,416 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,416 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,416 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,416 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,416 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,416 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,417 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,417 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,417 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,417 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,417 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,417 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,417 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,417 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,418 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,418 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,418 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,418 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,418 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,418 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,418 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,419 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,419 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,419 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,419 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,419 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,419 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,430 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,431 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,431 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,431 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,433 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,433 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,433 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,433 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,433 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,433 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,435 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,435 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,435 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,435 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,435 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,435 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,437 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,438 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,438 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,438 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,438 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,438 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,439 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,439 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,439 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,440 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,440 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,440 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,441 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,441 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,441 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,441 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,442 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,442 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,443 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,443 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,443 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,443 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,443 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,444 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 12:08:21,445 INFO L251 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-04-18 12:08:21,445 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 12:08:21,445 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 12:08:21,445 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 12:08:21,445 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 12:08:21,445 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 12:08:21,445 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 12:08:21,446 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 12:08:21,446 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 12:08:21,447 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 344 flow [2020-04-18 12:08:21,447 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 344 flow [2020-04-18 12:08:21,471 INFO L129 PetriNetUnfolder]: 17/195 cut-off events. [2020-04-18 12:08:21,471 INFO L130 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2020-04-18 12:08:21,474 INFO L80 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 195 events. 17/195 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 596 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 214. Up to 18 conditions per place. [2020-04-18 12:08:21,481 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 344 flow [2020-04-18 12:08:21,504 INFO L129 PetriNetUnfolder]: 17/195 cut-off events. [2020-04-18 12:08:21,504 INFO L130 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2020-04-18 12:08:21,506 INFO L80 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 195 events. 17/195 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 596 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 214. Up to 18 conditions per place. [2020-04-18 12:08:21,514 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10656 [2020-04-18 12:08:21,515 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-04-18 12:08:22,701 INFO L206 etLargeBlockEncoding]: Checked pairs total: 14959 [2020-04-18 12:08:22,701 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2020-04-18 12:08:22,701 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 38 transitions, 172 flow Received shutdown request... [2020-04-18 12:09:03,461 WARN L544 AbstractCegarLoop]: Verification canceled [2020-04-18 12:09:03,464 WARN L228 ceAbstractionStarter]: Timeout [2020-04-18 12:09:03,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 12:09:03 BasicIcfg [2020-04-18 12:09:03,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-18 12:09:03,466 INFO L168 Benchmark]: Toolchain (without parser) took 221504.10 ms. Allocated memory was 140.5 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 101.6 MB in the beginning and 1.1 GB in the end (delta: -972.0 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2020-04-18 12:09:03,466 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-04-18 12:09:03,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.85 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 99.7 MB in the beginning and 161.0 MB in the end (delta: -61.3 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2020-04-18 12:09:03,467 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.77 ms. Allocated memory is still 202.9 MB. Free memory was 161.0 MB in the beginning and 158.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-04-18 12:09:03,468 INFO L168 Benchmark]: Boogie Preprocessor took 26.33 ms. Allocated memory is still 202.9 MB. Free memory was 158.9 MB in the beginning and 157.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-04-18 12:09:03,468 INFO L168 Benchmark]: RCFGBuilder took 322.79 ms. Allocated memory is still 202.9 MB. Free memory was 157.5 MB in the beginning and 141.7 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2020-04-18 12:09:03,468 INFO L168 Benchmark]: TraceAbstraction took 220414.25 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 141.0 MB in the beginning and 1.1 GB in the end (delta: -932.6 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2020-04-18 12:09:03,470 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.19 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 647.85 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 99.7 MB in the beginning and 161.0 MB in the end (delta: -61.3 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.77 ms. Allocated memory is still 202.9 MB. Free memory was 161.0 MB in the beginning and 158.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.33 ms. Allocated memory is still 202.9 MB. Free memory was 158.9 MB in the beginning and 157.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 322.79 ms. Allocated memory is still 202.9 MB. Free memory was 157.5 MB in the beginning and 141.7 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 220414.25 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 141.0 MB in the beginning and 1.1 GB in the end (delta: -932.6 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 34 ProgramPointsBefore, 11 ProgramPointsAfterwards, 33 TransitionsBefore, 8 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 119 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 167 CheckedPairsTotal, 30 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.6s, 48 ProgramPointsBefore, 18 ProgramPointsAfterwards, 46 TransitionsBefore, 13 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 465 VarBasedMoverChecksPositive, 21 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1029 CheckedPairsTotal, 37 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.6s, 62 ProgramPointsBefore, 24 ProgramPointsAfterwards, 59 TransitionsBefore, 17 TransitionsAfterwards, 1656 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 4 ChoiceCompositions, 966 VarBasedMoverChecksPositive, 29 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2190 CheckedPairsTotal, 48 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 76 ProgramPointsBefore, 30 ProgramPointsAfterwards, 72 TransitionsBefore, 23 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 3 ChoiceCompositions, 1585 VarBasedMoverChecksPositive, 41 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4331 CheckedPairsTotal, 63 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.9s, 90 ProgramPointsBefore, 36 ProgramPointsAfterwards, 85 TransitionsBefore, 28 TransitionsAfterwards, 4320 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 18 ConcurrentYvCompositions, 3 ChoiceCompositions, 2461 VarBasedMoverChecksPositive, 58 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 6550 CheckedPairsTotal, 76 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.1s, 104 ProgramPointsBefore, 42 ProgramPointsAfterwards, 98 TransitionsBefore, 33 TransitionsAfterwards, 6120 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 21 ConcurrentYvCompositions, 3 ChoiceCompositions, 3490 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 10455 CheckedPairsTotal, 89 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.1s, 118 ProgramPointsBefore, 48 ProgramPointsAfterwards, 111 TransitionsBefore, 34 TransitionsAfterwards, 8232 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 26 ConcurrentYvCompositions, 7 ChoiceCompositions, 4656 VarBasedMoverChecksPositive, 73 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 13260 CheckedPairsTotal, 95 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.2s, 132 ProgramPointsBefore, 54 ProgramPointsAfterwards, 124 TransitionsBefore, 38 TransitionsAfterwards, 10656 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 6256 VarBasedMoverChecksPositive, 83 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 14959 CheckedPairsTotal, 105 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 680). Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 54 places, 38 transitions, 172 flow. Already constructed 144756 states. Currently 38434 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 8 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 219.9s, OverallIterations: 59, TraceHistogramMax: 8, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 90.3s, HoareTripleCheckerStatistics: 1566 SDtfs, 1089 SDslu, 1109 SDs, 0 SdLazy, 1449 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 947 GetRequests, 818 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122716occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 102.7s AutomataMinimizationTime, 52 MinimizatonAttempts, 192156 StatesRemovedByMinimization, 51 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