/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:36:57,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:36:57,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:36:57,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:36:57,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:36:57,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:36:57,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:36:57,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:36:57,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:36:57,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:36:57,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:36:57,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:36:57,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:36:57,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:36:57,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:36:57,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:36:57,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:36:57,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:36:57,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:36:57,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:36:57,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:36:57,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:36:57,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:36:57,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:36:57,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:36:57,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:36:57,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:36:57,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:36:57,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:36:57,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:36:57,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:36:57,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:36:57,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:36:57,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:36:57,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:36:57,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:36:57,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:36:57,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:36:57,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:36:57,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:36:57,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:36:57,157 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:36:57,179 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:36:57,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:36:57,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:36:57,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:36:57,181 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:36:57,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:36:57,181 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:36:57,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:36:57,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:36:57,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:36:57,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:36:57,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:36:57,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:36:57,183 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:36:57,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:36:57,183 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:36:57,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:36:57,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:36:57,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:36:57,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:36:57,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:36:57,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:36:57,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:36:57,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:36:57,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:36:57,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:36:57,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:36:57,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:36:57,185 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:36:57,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:36:57,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:36:57,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:36:57,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:36:57,507 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:36:57,508 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:36:57,509 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2019-12-27 00:36:57,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf5ee625/b92bc43736be468380f0c71fa1a52bba/FLAG009ee598f [2019-12-27 00:36:58,132 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:36:58,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2019-12-27 00:36:58,149 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf5ee625/b92bc43736be468380f0c71fa1a52bba/FLAG009ee598f [2019-12-27 00:36:58,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cf5ee625/b92bc43736be468380f0c71fa1a52bba [2019-12-27 00:36:58,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:36:58,495 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:36:58,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:36:58,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:36:58,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:36:58,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:36:58" (1/1) ... [2019-12-27 00:36:58,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e696350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:58, skipping insertion in model container [2019-12-27 00:36:58,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:36:58" (1/1) ... [2019-12-27 00:36:58,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:36:58,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:36:59,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:36:59,039 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:36:59,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:36:59,168 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:36:59,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:59 WrapperNode [2019-12-27 00:36:59,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:36:59,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:36:59,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:36:59,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:36:59,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:59" (1/1) ... [2019-12-27 00:36:59,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:59" (1/1) ... [2019-12-27 00:36:59,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:36:59,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:36:59,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:36:59,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:36:59,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:59" (1/1) ... [2019-12-27 00:36:59,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:59" (1/1) ... [2019-12-27 00:36:59,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:59" (1/1) ... [2019-12-27 00:36:59,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:59" (1/1) ... [2019-12-27 00:36:59,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:59" (1/1) ... [2019-12-27 00:36:59,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:59" (1/1) ... [2019-12-27 00:36:59,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:59" (1/1) ... [2019-12-27 00:36:59,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:36:59,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:36:59,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:36:59,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:36:59,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:36:59,326 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 00:36:59,326 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 00:36:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 00:36:59,327 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 00:36:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:36:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:36:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:36:59,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:36:59,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:36:59,329 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 00:36:59,682 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:36:59,683 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-27 00:36:59,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:36:59 BoogieIcfgContainer [2019-12-27 00:36:59,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:36:59,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:36:59,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:36:59,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:36:59,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:36:58" (1/3) ... [2019-12-27 00:36:59,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cbb519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:36:59, skipping insertion in model container [2019-12-27 00:36:59,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:36:59" (2/3) ... [2019-12-27 00:36:59,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57cbb519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:36:59, skipping insertion in model container [2019-12-27 00:36:59,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:36:59" (3/3) ... [2019-12-27 00:36:59,692 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-2.i [2019-12-27 00:36:59,700 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:36:59,701 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:36:59,708 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 00:36:59,709 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:36:59,733 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,733 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,734 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,734 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,734 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,734 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,735 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,735 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,736 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,736 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,736 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,736 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,737 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,737 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,737 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,738 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,738 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,742 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,742 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,743 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,743 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,743 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,750 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,750 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,750 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,751 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,751 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,751 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:36:59,766 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 00:36:59,783 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:36:59,783 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:36:59,783 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:36:59,784 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:36:59,784 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:36:59,784 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:36:59,784 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:36:59,784 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:36:59,799 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 53 transitions [2019-12-27 00:36:59,801 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions [2019-12-27 00:36:59,849 INFO L132 PetriNetUnfolder]: 3/63 cut-off events. [2019-12-27 00:36:59,849 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:36:59,856 INFO L76 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 63 events. 3/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs. 0/57 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2019-12-27 00:36:59,859 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions [2019-12-27 00:36:59,881 INFO L132 PetriNetUnfolder]: 3/63 cut-off events. [2019-12-27 00:36:59,881 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:36:59,883 INFO L76 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 63 events. 3/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs. 0/57 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2019-12-27 00:36:59,885 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 592 [2019-12-27 00:36:59,886 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:37:01,379 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 00:37:01,494 INFO L206 etLargeBlockEncoding]: Checked pairs total: 489 [2019-12-27 00:37:01,494 INFO L214 etLargeBlockEncoding]: Total number of compositions: 46 [2019-12-27 00:37:01,498 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-27 00:37:01,508 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-27 00:37:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-27 00:37:01,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:37:01,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:01,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:37:01,518 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:01,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:01,525 INFO L82 PathProgramCache]: Analyzing trace with hash 210014, now seen corresponding path program 1 times [2019-12-27 00:37:01,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:01,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39580886] [2019-12-27 00:37:01,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:01,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39580886] [2019-12-27 00:37:01,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:01,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:37:01,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011744923] [2019-12-27 00:37:01,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:37:01,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:01,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:37:01,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:37:01,888 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-27 00:37:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:01,932 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-27 00:37:01,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:37:01,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:37:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:01,945 INFO L225 Difference]: With dead ends: 35 [2019-12-27 00:37:01,946 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 00:37:01,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:37:01,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 00:37:01,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-27 00:37:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 00:37:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-27 00:37:01,978 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-27 00:37:01,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:01,978 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-27 00:37:01,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:37:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-27 00:37:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 00:37:01,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:01,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:01,979 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:01,980 INFO L82 PathProgramCache]: Analyzing trace with hash 647068079, now seen corresponding path program 1 times [2019-12-27 00:37:01,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:01,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919084966] [2019-12-27 00:37:01,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:02,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919084966] [2019-12-27 00:37:02,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:02,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:37:02,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153804611] [2019-12-27 00:37:02,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:37:02,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:02,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:37:02,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:37:02,113 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-27 00:37:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:02,135 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-27 00:37:02,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:37:02,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 00:37:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:02,136 INFO L225 Difference]: With dead ends: 26 [2019-12-27 00:37:02,137 INFO L226 Difference]: Without dead ends: 24 [2019-12-27 00:37:02,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:37:02,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-27 00:37:02,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-27 00:37:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 00:37:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-27 00:37:02,142 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-27 00:37:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:02,142 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-27 00:37:02,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:37:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-27 00:37:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 00:37:02,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:02,143 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:02,143 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:02,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1415732781, now seen corresponding path program 1 times [2019-12-27 00:37:02,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:02,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580054983] [2019-12-27 00:37:02,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:02,206 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:37:02,206 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:37:02,207 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:37:02,207 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 00:37:02,216 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,217 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,217 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,217 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,217 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,217 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,218 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,218 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,218 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,218 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,218 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,219 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,219 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,219 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,220 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,220 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,220 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,220 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,220 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,220 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,221 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,221 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,221 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,221 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,222 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,222 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,222 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,222 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,222 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,223 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,223 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,223 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,223 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,223 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,224 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,224 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,224 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,224 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,225 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,226 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,227 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,227 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,227 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,227 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,229 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,229 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,229 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,230 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,230 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,230 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,232 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,232 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,232 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,232 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,232 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,233 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:02,234 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 00:37:02,234 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:37:02,235 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:37:02,235 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:37:02,235 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:37:02,235 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:37:02,235 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:37:02,235 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:37:02,235 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:37:02,238 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-27 00:37:02,238 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 00:37:02,271 INFO L132 PetriNetUnfolder]: 4/84 cut-off events. [2019-12-27 00:37:02,271 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 00:37:02,274 INFO L76 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 84 events. 4/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs. 0/76 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2019-12-27 00:37:02,277 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 00:37:02,301 INFO L132 PetriNetUnfolder]: 4/84 cut-off events. [2019-12-27 00:37:02,301 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 00:37:02,303 INFO L76 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 84 events. 4/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs. 0/76 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2019-12-27 00:37:02,305 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 920 [2019-12-27 00:37:02,306 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:37:03,753 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 00:37:03,859 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1034 [2019-12-27 00:37:03,859 INFO L214 etLargeBlockEncoding]: Total number of compositions: 57 [2019-12-27 00:37:03,859 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-27 00:37:03,872 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-27 00:37:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-27 00:37:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:37:03,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:03,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:37:03,873 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:03,873 INFO L82 PathProgramCache]: Analyzing trace with hash 353600, now seen corresponding path program 1 times [2019-12-27 00:37:03,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:03,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841645798] [2019-12-27 00:37:03,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:03,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841645798] [2019-12-27 00:37:03,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:03,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:37:03,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510656147] [2019-12-27 00:37:03,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:37:03,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:03,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:37:03,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:37:03,929 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-27 00:37:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:03,973 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-27 00:37:03,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:37:03,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:37:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:03,978 INFO L225 Difference]: With dead ends: 185 [2019-12-27 00:37:03,979 INFO L226 Difference]: Without dead ends: 171 [2019-12-27 00:37:03,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:37:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-27 00:37:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-27 00:37:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-27 00:37:04,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-27 00:37:04,004 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-27 00:37:04,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:04,004 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-27 00:37:04,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:37:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-27 00:37:04,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:37:04,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:04,005 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:04,006 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:04,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:04,006 INFO L82 PathProgramCache]: Analyzing trace with hash -677960350, now seen corresponding path program 1 times [2019-12-27 00:37:04,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:04,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982129817] [2019-12-27 00:37:04,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:04,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982129817] [2019-12-27 00:37:04,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:04,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:04,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172817248] [2019-12-27 00:37:04,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:04,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:04,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:04,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:04,084 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-27 00:37:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:04,205 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-27 00:37:04,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:04,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:37:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:04,210 INFO L225 Difference]: With dead ends: 204 [2019-12-27 00:37:04,210 INFO L226 Difference]: Without dead ends: 201 [2019-12-27 00:37:04,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-27 00:37:04,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-27 00:37:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 00:37:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-27 00:37:04,229 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-27 00:37:04,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:04,230 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-27 00:37:04,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:04,230 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-27 00:37:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:37:04,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:04,232 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:04,233 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:04,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:04,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1901960811, now seen corresponding path program 1 times [2019-12-27 00:37:04,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:04,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283782674] [2019-12-27 00:37:04,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:37:04,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283782674] [2019-12-27 00:37:04,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:04,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:04,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085264822] [2019-12-27 00:37:04,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:04,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:04,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:04,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:04,297 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-27 00:37:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:04,393 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-27 00:37:04,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:04,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:37:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:04,397 INFO L225 Difference]: With dead ends: 189 [2019-12-27 00:37:04,397 INFO L226 Difference]: Without dead ends: 185 [2019-12-27 00:37:04,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:04,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-27 00:37:04,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-27 00:37:04,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-27 00:37:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-27 00:37:04,413 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-27 00:37:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:04,414 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-27 00:37:04,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-27 00:37:04,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:37:04,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:04,416 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:04,416 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:04,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:04,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1166778350, now seen corresponding path program 1 times [2019-12-27 00:37:04,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:04,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559837971] [2019-12-27 00:37:04,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:04,454 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:37:04,455 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:37:04,455 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:37:04,455 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 00:37:04,465 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,465 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,465 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,465 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,465 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,466 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,466 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,466 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,466 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,466 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,466 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,467 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,467 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,467 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,467 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,467 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,468 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,468 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,468 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,468 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,468 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,469 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,469 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,469 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,469 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,470 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,470 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,470 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,470 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,470 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,471 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,471 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,471 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,471 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,472 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,472 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,472 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,472 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,472 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,473 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,473 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,473 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,473 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,474 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,474 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,474 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,474 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,474 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,474 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,475 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,475 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,475 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,475 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,476 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,476 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,476 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,477 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,478 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,478 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,478 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,478 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,480 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,480 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,480 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,480 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,480 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,482 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,482 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,482 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,482 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,482 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,482 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,483 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,483 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,484 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,484 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,484 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,484 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,485 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,486 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,486 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,486 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,486 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,486 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:04,488 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 00:37:04,488 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:37:04,488 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:37:04,488 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:37:04,488 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:37:04,489 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:37:04,489 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:37:04,489 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:37:04,489 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:37:04,491 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 85 transitions [2019-12-27 00:37:04,492 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions [2019-12-27 00:37:04,510 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 00:37:04,510 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 00:37:04,512 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 00:37:04,516 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions [2019-12-27 00:37:04,532 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 00:37:04,533 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 00:37:04,534 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 00:37:04,537 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1308 [2019-12-27 00:37:04,537 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:37:06,062 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 00:37:06,139 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1615 [2019-12-27 00:37:06,140 INFO L214 etLargeBlockEncoding]: Total number of compositions: 69 [2019-12-27 00:37:06,140 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-27 00:37:06,166 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-27 00:37:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-27 00:37:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:37:06,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:06,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:37:06,167 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash 525945, now seen corresponding path program 1 times [2019-12-27 00:37:06,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:06,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687536616] [2019-12-27 00:37:06,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:06,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687536616] [2019-12-27 00:37:06,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:06,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:37:06,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275050482] [2019-12-27 00:37:06,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:37:06,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:06,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:37:06,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:37:06,210 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-27 00:37:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:06,247 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-27 00:37:06,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:37:06,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:37:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:06,254 INFO L225 Difference]: With dead ends: 600 [2019-12-27 00:37:06,254 INFO L226 Difference]: Without dead ends: 559 [2019-12-27 00:37:06,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:37:06,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-27 00:37:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-27 00:37:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-27 00:37:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-27 00:37:06,290 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-27 00:37:06,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:06,290 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-27 00:37:06,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:37:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-27 00:37:06,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:37:06,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:06,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:06,294 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:06,294 INFO L82 PathProgramCache]: Analyzing trace with hash -2106616436, now seen corresponding path program 1 times [2019-12-27 00:37:06,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:06,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187264792] [2019-12-27 00:37:06,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:06,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187264792] [2019-12-27 00:37:06,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:06,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:06,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052844922] [2019-12-27 00:37:06,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:06,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:06,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:06,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:06,380 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-27 00:37:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:06,491 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-27 00:37:06,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:06,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:37:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:06,498 INFO L225 Difference]: With dead ends: 802 [2019-12-27 00:37:06,499 INFO L226 Difference]: Without dead ends: 799 [2019-12-27 00:37:06,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:06,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-27 00:37:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-27 00:37:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 00:37:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-27 00:37:06,525 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-27 00:37:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:06,525 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-27 00:37:06,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-27 00:37:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:37:06,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:06,527 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:06,527 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:06,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1813947824, now seen corresponding path program 1 times [2019-12-27 00:37:06,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:06,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798670907] [2019-12-27 00:37:06,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:37:06,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798670907] [2019-12-27 00:37:06,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:06,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:06,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500111657] [2019-12-27 00:37:06,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:06,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:06,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:06,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:06,599 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-27 00:37:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:06,717 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-27 00:37:06,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:06,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:37:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:06,724 INFO L225 Difference]: With dead ends: 832 [2019-12-27 00:37:06,724 INFO L226 Difference]: Without dead ends: 828 [2019-12-27 00:37:06,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-27 00:37:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-27 00:37:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 00:37:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-27 00:37:06,777 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-27 00:37:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:06,778 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-27 00:37:06,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-27 00:37:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:37:06,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:06,780 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:06,780 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:06,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash -693557262, now seen corresponding path program 1 times [2019-12-27 00:37:06,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:06,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027868991] [2019-12-27 00:37:06,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:06,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:06,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027868991] [2019-12-27 00:37:06,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876629970] [2019-12-27 00:37:06,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:06,954 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:06,957 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:07,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:07,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:07,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945522643] [2019-12-27 00:37:07,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:07,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:07,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:07,044 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 12 states. [2019-12-27 00:37:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:07,417 INFO L93 Difference]: Finished difference Result 1052 states and 2813 transitions. [2019-12-27 00:37:07,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:07,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 00:37:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:07,425 INFO L225 Difference]: With dead ends: 1052 [2019-12-27 00:37:07,425 INFO L226 Difference]: Without dead ends: 1048 [2019-12-27 00:37:07,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-27 00:37:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 587. [2019-12-27 00:37:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-27 00:37:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-27 00:37:07,451 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-27 00:37:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:07,452 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-27 00:37:07,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-27 00:37:07,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:37:07,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:07,453 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:07,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:07,657 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:07,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:07,657 INFO L82 PathProgramCache]: Analyzing trace with hash -552862538, now seen corresponding path program 2 times [2019-12-27 00:37:07,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:07,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971544215] [2019-12-27 00:37:07,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:37:07,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971544215] [2019-12-27 00:37:07,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:07,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:07,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073045906] [2019-12-27 00:37:07,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:07,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:07,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:07,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:07,739 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-27 00:37:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:08,021 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-27 00:37:08,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:08,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 00:37:08,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:08,033 INFO L225 Difference]: With dead ends: 1050 [2019-12-27 00:37:08,033 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 00:37:08,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:37:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 00:37:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-27 00:37:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 00:37:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-27 00:37:08,056 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-27 00:37:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:08,056 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-27 00:37:08,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-27 00:37:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:37:08,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:08,057 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:08,058 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:08,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:08,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1197543999, now seen corresponding path program 1 times [2019-12-27 00:37:08,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:08,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949654896] [2019-12-27 00:37:08,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:08,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949654896] [2019-12-27 00:37:08,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:08,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:08,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251453828] [2019-12-27 00:37:08,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:08,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:08,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:08,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:08,132 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-27 00:37:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:08,235 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-27 00:37:08,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:08,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:37:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:08,244 INFO L225 Difference]: With dead ends: 736 [2019-12-27 00:37:08,244 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 00:37:08,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 00:37:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-27 00:37:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-27 00:37:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-27 00:37:08,263 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-27 00:37:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:08,263 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-27 00:37:08,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-27 00:37:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:37:08,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:08,265 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:08,265 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:08,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1527881090, now seen corresponding path program 1 times [2019-12-27 00:37:08,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:08,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034057682] [2019-12-27 00:37:08,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:08,319 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:37:08,319 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:37:08,319 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:37:08,319 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 00:37:08,337 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,337 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,337 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,337 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,338 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,338 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,338 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,339 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,339 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,340 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,340 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,340 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,340 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,340 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,341 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,341 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,341 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,341 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,341 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,341 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,342 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,342 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,342 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,342 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,342 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,343 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,343 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,343 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,344 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,344 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,344 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,344 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,344 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,345 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,345 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,345 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,345 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,345 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,346 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,346 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,346 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,346 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,346 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,347 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,348 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,351 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,351 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,352 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,352 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,352 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,352 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,353 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,353 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,353 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,353 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,353 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,353 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,354 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,355 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,355 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,355 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,355 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,356 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,357 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,357 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,357 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,357 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,358 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,359 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,359 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,359 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,360 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,360 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,361 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,361 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,361 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,361 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,361 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,361 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,362 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,363 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,363 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,363 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,363 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,363 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,364 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,364 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,365 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,365 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,365 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,365 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,366 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,366 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,366 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,366 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,367 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,367 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:08,368 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 00:37:08,368 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:37:08,368 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:37:08,368 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:37:08,368 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:37:08,369 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:37:08,369 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:37:08,369 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:37:08,369 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:37:08,370 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 101 transitions [2019-12-27 00:37:08,371 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 114 places, 101 transitions [2019-12-27 00:37:08,393 INFO L132 PetriNetUnfolder]: 6/126 cut-off events. [2019-12-27 00:37:08,394 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 00:37:08,396 INFO L76 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 126 events. 6/126 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs. 0/114 useless extension candidates. Maximal degree in co-relation 146. Up to 10 conditions per place. [2019-12-27 00:37:08,401 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 114 places, 101 transitions [2019-12-27 00:37:08,445 INFO L132 PetriNetUnfolder]: 6/126 cut-off events. [2019-12-27 00:37:08,445 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 00:37:08,447 INFO L76 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 126 events. 6/126 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs. 0/114 useless extension candidates. Maximal degree in co-relation 146. Up to 10 conditions per place. [2019-12-27 00:37:08,451 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1756 [2019-12-27 00:37:08,452 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:37:10,163 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-12-27 00:37:10,389 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2111 [2019-12-27 00:37:10,389 INFO L214 etLargeBlockEncoding]: Total number of compositions: 84 [2019-12-27 00:37:10,389 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-27 00:37:10,499 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-27 00:37:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-27 00:37:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:37:10,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:10,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:37:10,500 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:10,501 INFO L82 PathProgramCache]: Analyzing trace with hash 729974, now seen corresponding path program 1 times [2019-12-27 00:37:10,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:10,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405706703] [2019-12-27 00:37:10,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:10,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405706703] [2019-12-27 00:37:10,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:10,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:37:10,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716946189] [2019-12-27 00:37:10,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:37:10,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:10,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:37:10,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:37:10,521 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-27 00:37:10,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:10,567 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-27 00:37:10,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:37:10,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:37:10,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:10,585 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 00:37:10,585 INFO L226 Difference]: Without dead ends: 1767 [2019-12-27 00:37:10,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:37:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-27 00:37:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-27 00:37:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-27 00:37:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-27 00:37:10,649 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-27 00:37:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:10,649 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-27 00:37:10,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:37:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-27 00:37:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:37:10,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:10,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:10,650 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:10,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1449000874, now seen corresponding path program 1 times [2019-12-27 00:37:10,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:10,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889447875] [2019-12-27 00:37:10,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:10,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889447875] [2019-12-27 00:37:10,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:10,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:10,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298292239] [2019-12-27 00:37:10,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:10,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:10,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:10,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:10,685 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-27 00:37:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:10,780 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-27 00:37:10,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:10,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:37:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:10,802 INFO L225 Difference]: With dead ends: 2826 [2019-12-27 00:37:10,803 INFO L226 Difference]: Without dead ends: 2823 [2019-12-27 00:37:10,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-27 00:37:10,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-27 00:37:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-27 00:37:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-27 00:37:10,887 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-27 00:37:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:10,888 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-27 00:37:10,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-27 00:37:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:37:10,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:10,889 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:10,889 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:10,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:10,889 INFO L82 PathProgramCache]: Analyzing trace with hash 302089454, now seen corresponding path program 1 times [2019-12-27 00:37:10,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:10,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076849733] [2019-12-27 00:37:10,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:37:10,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076849733] [2019-12-27 00:37:10,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:10,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:10,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917896261] [2019-12-27 00:37:10,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:10,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:10,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:10,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:10,931 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-27 00:37:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:11,065 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-27 00:37:11,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:11,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:37:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:11,096 INFO L225 Difference]: With dead ends: 3124 [2019-12-27 00:37:11,096 INFO L226 Difference]: Without dead ends: 3120 [2019-12-27 00:37:11,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-27 00:37:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-27 00:37:11,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-27 00:37:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-27 00:37:11,261 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-27 00:37:11,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:11,261 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-27 00:37:11,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-27 00:37:11,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:37:11,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:11,262 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:11,262 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:11,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:11,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1953005855, now seen corresponding path program 1 times [2019-12-27 00:37:11,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:11,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840573117] [2019-12-27 00:37:11,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:11,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840573117] [2019-12-27 00:37:11,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254171660] [2019-12-27 00:37:11,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:11,376 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:11,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:11,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:11,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:11,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360189436] [2019-12-27 00:37:11,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:11,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:11,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:11,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:11,438 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 12 states. [2019-12-27 00:37:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:11,824 INFO L93 Difference]: Finished difference Result 4460 states and 14778 transitions. [2019-12-27 00:37:11,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:11,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 00:37:11,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:11,866 INFO L225 Difference]: With dead ends: 4460 [2019-12-27 00:37:11,866 INFO L226 Difference]: Without dead ends: 4456 [2019-12-27 00:37:11,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2019-12-27 00:37:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 2109. [2019-12-27 00:37:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-27 00:37:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-27 00:37:11,971 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-27 00:37:11,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:11,971 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-27 00:37:11,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:11,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-27 00:37:11,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:37:11,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:11,972 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:12,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:12,176 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:12,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1749825449, now seen corresponding path program 2 times [2019-12-27 00:37:12,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:12,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071250755] [2019-12-27 00:37:12,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:37:12,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071250755] [2019-12-27 00:37:12,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:12,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:12,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002074957] [2019-12-27 00:37:12,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:12,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:12,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:12,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:12,232 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-27 00:37:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:12,523 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-27 00:37:12,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:12,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 00:37:12,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:12,539 INFO L225 Difference]: With dead ends: 4522 [2019-12-27 00:37:12,540 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 00:37:12,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:37:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 00:37:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-27 00:37:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 00:37:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-27 00:37:12,694 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-27 00:37:12,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:12,695 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-27 00:37:12,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-27 00:37:12,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:37:12,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:12,696 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:12,697 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:12,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1726909890, now seen corresponding path program 1 times [2019-12-27 00:37:12,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:12,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697195040] [2019-12-27 00:37:12,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:12,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697195040] [2019-12-27 00:37:12,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:12,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:12,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702832092] [2019-12-27 00:37:12,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:12,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:12,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:12,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:12,767 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-27 00:37:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:12,874 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-27 00:37:12,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:12,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:37:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:12,887 INFO L225 Difference]: With dead ends: 3208 [2019-12-27 00:37:12,887 INFO L226 Difference]: Without dead ends: 3200 [2019-12-27 00:37:12,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:12,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-27 00:37:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-27 00:37:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-27 00:37:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-27 00:37:12,970 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-27 00:37:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:12,970 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-27 00:37:12,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-27 00:37:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:12,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:12,972 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:12,972 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:12,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:12,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2140493091, now seen corresponding path program 1 times [2019-12-27 00:37:12,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:12,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780864884] [2019-12-27 00:37:12,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:13,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780864884] [2019-12-27 00:37:13,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407987750] [2019-12-27 00:37:13,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:13,146 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:13,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:13,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:13,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:13,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537715702] [2019-12-27 00:37:13,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:13,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:13,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:13,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:13,301 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 12 states. [2019-12-27 00:37:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:13,757 INFO L93 Difference]: Finished difference Result 4759 states and 15906 transitions. [2019-12-27 00:37:13,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:13,758 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 00:37:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:13,774 INFO L225 Difference]: With dead ends: 4759 [2019-12-27 00:37:13,774 INFO L226 Difference]: Without dead ends: 4753 [2019-12-27 00:37:13,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2019-12-27 00:37:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 2270. [2019-12-27 00:37:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-27 00:37:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-27 00:37:13,875 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-27 00:37:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:13,875 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-27 00:37:13,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-27 00:37:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:13,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:13,877 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:14,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:14,088 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:14,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1012596352, now seen corresponding path program 1 times [2019-12-27 00:37:14,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:14,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248515543] [2019-12-27 00:37:14,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:37:14,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248515543] [2019-12-27 00:37:14,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504516252] [2019-12-27 00:37:14,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:14,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:14,210 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:14,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:37:14,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:14,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:14,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068109351] [2019-12-27 00:37:14,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:14,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:14,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:14,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:14,297 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 12 states. [2019-12-27 00:37:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:14,721 INFO L93 Difference]: Finished difference Result 4884 states and 16344 transitions. [2019-12-27 00:37:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:14,721 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 00:37:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:14,738 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 00:37:14,738 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 00:37:14,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 00:37:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2267. [2019-12-27 00:37:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-27 00:37:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-27 00:37:14,844 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-27 00:37:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:14,844 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-27 00:37:14,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-27 00:37:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:14,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:14,846 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:15,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:15,051 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:15,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:15,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1703029164, now seen corresponding path program 2 times [2019-12-27 00:37:15,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:15,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706685891] [2019-12-27 00:37:15,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:15,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706685891] [2019-12-27 00:37:15,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:15,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:15,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017587420] [2019-12-27 00:37:15,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:15,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:15,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:15,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:15,112 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-27 00:37:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:15,378 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-27 00:37:15,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:15,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:37:15,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:15,396 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 00:37:15,396 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 00:37:15,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:37:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 00:37:15,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-27 00:37:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-27 00:37:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-27 00:37:15,488 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-27 00:37:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:15,488 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-27 00:37:15,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-27 00:37:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:15,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:15,490 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:15,490 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1703042649, now seen corresponding path program 2 times [2019-12-27 00:37:15,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:15,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888224174] [2019-12-27 00:37:15,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:15,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888224174] [2019-12-27 00:37:15,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:15,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:15,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278505097] [2019-12-27 00:37:15,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:15,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:15,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:15,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:15,543 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-27 00:37:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:15,826 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-27 00:37:15,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:15,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:37:15,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:15,841 INFO L225 Difference]: With dead ends: 4737 [2019-12-27 00:37:15,841 INFO L226 Difference]: Without dead ends: 4728 [2019-12-27 00:37:15,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:37:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-27 00:37:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-27 00:37:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-27 00:37:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-27 00:37:15,918 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-27 00:37:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:15,919 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-27 00:37:15,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-27 00:37:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:15,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:15,921 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:15,921 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:15,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:15,921 INFO L82 PathProgramCache]: Analyzing trace with hash 269937843, now seen corresponding path program 1 times [2019-12-27 00:37:15,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:15,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426968788] [2019-12-27 00:37:15,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:16,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426968788] [2019-12-27 00:37:16,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284002640] [2019-12-27 00:37:16,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:16,146 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:16,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:16,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:16,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:16,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484745889] [2019-12-27 00:37:16,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:16,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:16,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:16,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:16,244 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 16 states. [2019-12-27 00:37:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:17,162 INFO L93 Difference]: Finished difference Result 5995 states and 18718 transitions. [2019-12-27 00:37:17,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:17,162 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:37:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:17,176 INFO L225 Difference]: With dead ends: 5995 [2019-12-27 00:37:17,177 INFO L226 Difference]: Without dead ends: 5991 [2019-12-27 00:37:17,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2019-12-27 00:37:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 2101. [2019-12-27 00:37:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-27 00:37:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-27 00:37:17,267 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-27 00:37:17,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:17,268 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-27 00:37:17,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-27 00:37:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:17,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:17,270 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:17,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:17,474 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:17,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:17,474 INFO L82 PathProgramCache]: Analyzing trace with hash 275473203, now seen corresponding path program 2 times [2019-12-27 00:37:17,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:17,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728771975] [2019-12-27 00:37:17,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:17,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728771975] [2019-12-27 00:37:17,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429312214] [2019-12-27 00:37:17,555 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:17,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:37:17,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:17,644 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:17,646 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:17,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:17,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:17,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096422804] [2019-12-27 00:37:17,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:17,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:17,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:17,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:17,759 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 16 states. [2019-12-27 00:37:18,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:18,622 INFO L93 Difference]: Finished difference Result 5889 states and 18361 transitions. [2019-12-27 00:37:18,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:18,623 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:37:18,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:18,635 INFO L225 Difference]: With dead ends: 5889 [2019-12-27 00:37:18,635 INFO L226 Difference]: Without dead ends: 5883 [2019-12-27 00:37:18,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2019-12-27 00:37:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 2071. [2019-12-27 00:37:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-27 00:37:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-27 00:37:18,719 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-27 00:37:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:18,719 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-27 00:37:18,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-27 00:37:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:18,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:18,723 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:18,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:18,927 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:18,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:18,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1870977495, now seen corresponding path program 3 times [2019-12-27 00:37:18,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:18,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647836863] [2019-12-27 00:37:18,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:37:18,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647836863] [2019-12-27 00:37:18,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894165234] [2019-12-27 00:37:18,999 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:19,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:37:19,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:19,076 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:19,079 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:37:19,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:19,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:19,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775650990] [2019-12-27 00:37:19,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:19,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:19,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:19,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:19,179 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 16 states. [2019-12-27 00:37:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:19,966 INFO L93 Difference]: Finished difference Result 5888 states and 18357 transitions. [2019-12-27 00:37:19,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:19,966 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:37:19,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:19,980 INFO L225 Difference]: With dead ends: 5888 [2019-12-27 00:37:19,981 INFO L226 Difference]: Without dead ends: 5884 [2019-12-27 00:37:19,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2019-12-27 00:37:20,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 1997. [2019-12-27 00:37:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-27 00:37:20,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-27 00:37:20,065 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-27 00:37:20,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:20,065 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-27 00:37:20,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:20,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-27 00:37:20,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:20,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:20,068 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:20,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:20,272 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:20,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:20,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1852496535, now seen corresponding path program 4 times [2019-12-27 00:37:20,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:20,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190446117] [2019-12-27 00:37:20,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:37:20,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190446117] [2019-12-27 00:37:20,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734010036] [2019-12-27 00:37:20,346 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:20,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:37:20,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:20,481 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:20,482 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:37:20,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:20,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:20,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250208190] [2019-12-27 00:37:20,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:20,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:20,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:20,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:20,595 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 16 states. [2019-12-27 00:37:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:21,390 INFO L93 Difference]: Finished difference Result 5819 states and 18141 transitions. [2019-12-27 00:37:21,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:21,391 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:37:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:21,400 INFO L225 Difference]: With dead ends: 5819 [2019-12-27 00:37:21,401 INFO L226 Difference]: Without dead ends: 5813 [2019-12-27 00:37:21,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2019-12-27 00:37:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 1967. [2019-12-27 00:37:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-27 00:37:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-27 00:37:21,489 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-27 00:37:21,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:21,490 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-27 00:37:21,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-27 00:37:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:21,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:21,495 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:21,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:21,699 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:21,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:21,700 INFO L82 PathProgramCache]: Analyzing trace with hash -748339188, now seen corresponding path program 1 times [2019-12-27 00:37:21,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:21,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523758605] [2019-12-27 00:37:21,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:37:21,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523758605] [2019-12-27 00:37:21,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:21,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:21,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746594595] [2019-12-27 00:37:21,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:21,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:21,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:21,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:21,754 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-27 00:37:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:21,849 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-27 00:37:21,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:21,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 00:37:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:21,856 INFO L225 Difference]: With dead ends: 3010 [2019-12-27 00:37:21,856 INFO L226 Difference]: Without dead ends: 2994 [2019-12-27 00:37:21,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-27 00:37:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-27 00:37:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-27 00:37:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-27 00:37:21,910 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-27 00:37:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:21,911 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-27 00:37:21,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-27 00:37:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:21,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:21,913 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:21,913 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:21,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:21,913 INFO L82 PathProgramCache]: Analyzing trace with hash -228501443, now seen corresponding path program 5 times [2019-12-27 00:37:21,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:21,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569814379] [2019-12-27 00:37:21,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:21,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569814379] [2019-12-27 00:37:21,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:21,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:37:21,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141112192] [2019-12-27 00:37:21,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:37:21,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:21,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:37:21,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:37:21,985 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-27 00:37:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:22,635 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-27 00:37:22,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:22,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:37:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:22,647 INFO L225 Difference]: With dead ends: 6140 [2019-12-27 00:37:22,648 INFO L226 Difference]: Without dead ends: 6133 [2019-12-27 00:37:22,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:37:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-27 00:37:22,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-27 00:37:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-27 00:37:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-27 00:37:22,790 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-27 00:37:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:22,790 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-27 00:37:22,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:37:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-27 00:37:22,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:22,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:22,794 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:22,794 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:22,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:22,794 INFO L82 PathProgramCache]: Analyzing trace with hash -241447043, now seen corresponding path program 6 times [2019-12-27 00:37:22,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:22,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896555463] [2019-12-27 00:37:22,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:22,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896555463] [2019-12-27 00:37:22,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:22,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:37:22,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507565562] [2019-12-27 00:37:22,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:37:22,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:22,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:37:22,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:37:22,861 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-27 00:37:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:23,509 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-27 00:37:23,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:23,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:37:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:23,522 INFO L225 Difference]: With dead ends: 6012 [2019-12-27 00:37:23,522 INFO L226 Difference]: Without dead ends: 6002 [2019-12-27 00:37:23,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:37:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-27 00:37:23,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-27 00:37:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-27 00:37:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-27 00:37:23,601 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-27 00:37:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:23,601 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-27 00:37:23,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:37:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-27 00:37:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:37:23,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:23,603 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:23,603 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:23,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:23,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1727522141, now seen corresponding path program 1 times [2019-12-27 00:37:23,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:23,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309748969] [2019-12-27 00:37:23,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:37:23,628 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:37:23,628 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:37:23,629 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:37:23,629 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 00:37:23,643 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,643 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,643 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,644 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,644 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,644 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,644 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,644 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,644 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,644 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,645 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,645 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,645 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,645 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,645 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,645 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,645 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,646 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,646 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,646 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,646 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,646 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,646 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,647 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,647 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,647 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,647 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,647 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,647 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,648 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,648 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,648 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,648 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,648 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,648 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,648 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,649 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,649 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,649 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,649 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,649 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,649 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,649 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,649 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,650 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,650 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,650 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,650 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,650 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,650 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,650 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,651 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,651 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,651 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,651 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,651 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,651 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,651 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,651 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,652 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,652 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,652 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,652 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,652 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,652 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,652 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,653 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,653 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,653 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,653 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,653 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,653 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,653 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,653 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,654 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,654 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,654 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,654 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,654 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,654 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,654 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,655 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,655 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,655 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,655 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,655 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,655 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,656 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,656 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,656 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,658 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,658 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,659 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,659 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,659 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,661 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,661 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,661 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,662 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,662 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,664 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,664 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,664 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,665 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,665 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,667 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,667 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,667 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,668 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,668 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,670 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,670 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,670 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,671 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,671 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,671 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,673 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,673 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,673 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,673 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,674 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,674 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,676 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,676 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,676 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,677 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,677 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,677 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,678 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,678 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,678 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,679 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,679 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,679 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,680 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,680 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,680 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,681 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,681 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,681 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:37:23,682 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 00:37:23,683 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:37:23,683 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:37:23,683 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:37:23,683 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:37:23,683 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:37:23,683 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:37:23,683 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:37:23,683 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:37:23,685 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 117 transitions [2019-12-27 00:37:23,685 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 117 transitions [2019-12-27 00:37:23,709 INFO L132 PetriNetUnfolder]: 7/147 cut-off events. [2019-12-27 00:37:23,709 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 00:37:23,712 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 147 events. 7/147 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 222 event pairs. 0/133 useless extension candidates. Maximal degree in co-relation 174. Up to 12 conditions per place. [2019-12-27 00:37:23,721 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 117 transitions [2019-12-27 00:37:23,744 INFO L132 PetriNetUnfolder]: 7/147 cut-off events. [2019-12-27 00:37:23,745 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 00:37:23,747 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 147 events. 7/147 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 222 event pairs. 0/133 useless extension candidates. Maximal degree in co-relation 174. Up to 12 conditions per place. [2019-12-27 00:37:23,764 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2264 [2019-12-27 00:37:23,765 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:37:25,416 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-27 00:37:25,691 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2604 [2019-12-27 00:37:25,692 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 00:37:25,692 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-27 00:37:25,975 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-27 00:37:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-27 00:37:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:37:25,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:25,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:37:25,976 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:25,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:25,976 INFO L82 PathProgramCache]: Analyzing trace with hash 963853, now seen corresponding path program 1 times [2019-12-27 00:37:25,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:25,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664526466] [2019-12-27 00:37:25,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:26,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664526466] [2019-12-27 00:37:26,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:26,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:37:26,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356430212] [2019-12-27 00:37:26,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:37:26,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:26,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:37:26,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:37:26,005 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-27 00:37:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:26,070 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-27 00:37:26,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:37:26,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:37:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:26,091 INFO L225 Difference]: With dead ends: 5844 [2019-12-27 00:37:26,091 INFO L226 Difference]: Without dead ends: 5479 [2019-12-27 00:37:26,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:37:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-27 00:37:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-27 00:37:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-27 00:37:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-27 00:37:26,231 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-27 00:37:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:26,231 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-27 00:37:26,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:37:26,231 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-27 00:37:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:37:26,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:26,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:26,232 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:26,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:26,232 INFO L82 PathProgramCache]: Analyzing trace with hash 91439009, now seen corresponding path program 1 times [2019-12-27 00:37:26,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:26,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825880351] [2019-12-27 00:37:26,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:26,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825880351] [2019-12-27 00:37:26,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:26,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:26,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069209415] [2019-12-27 00:37:26,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:26,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:26,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:26,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:26,288 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-27 00:37:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:26,446 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-27 00:37:26,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:26,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:37:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:26,478 INFO L225 Difference]: With dead ends: 9358 [2019-12-27 00:37:26,478 INFO L226 Difference]: Without dead ends: 9355 [2019-12-27 00:37:26,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:26,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-27 00:37:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-27 00:37:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-27 00:37:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-27 00:37:27,318 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-27 00:37:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:27,318 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-27 00:37:27,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-27 00:37:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:37:27,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:27,319 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:27,319 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:27,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:27,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1001063187, now seen corresponding path program 1 times [2019-12-27 00:37:27,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:27,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146549459] [2019-12-27 00:37:27,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:37:27,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146549459] [2019-12-27 00:37:27,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:27,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:27,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656595968] [2019-12-27 00:37:27,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:27,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:27,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:27,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:27,359 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-27 00:37:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:27,507 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-27 00:37:27,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:27,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:37:27,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:27,533 INFO L225 Difference]: With dead ends: 10720 [2019-12-27 00:37:27,533 INFO L226 Difference]: Without dead ends: 10716 [2019-12-27 00:37:27,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:27,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-27 00:37:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-27 00:37:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-27 00:37:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-27 00:37:27,731 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-27 00:37:27,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:27,731 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-27 00:37:27,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-27 00:37:27,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:37:27,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:27,732 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:27,732 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:27,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:27,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1798371701, now seen corresponding path program 1 times [2019-12-27 00:37:27,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:27,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449749889] [2019-12-27 00:37:27,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:27,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449749889] [2019-12-27 00:37:27,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912244745] [2019-12-27 00:37:27,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:27,871 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:27,872 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:27,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:27,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:27,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728703653] [2019-12-27 00:37:27,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:27,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:27,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:27,942 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 12 states. [2019-12-27 00:37:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:28,320 INFO L93 Difference]: Finished difference Result 16250 states and 64977 transitions. [2019-12-27 00:37:28,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:28,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 00:37:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:28,354 INFO L225 Difference]: With dead ends: 16250 [2019-12-27 00:37:28,355 INFO L226 Difference]: Without dead ends: 16246 [2019-12-27 00:37:28,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:28,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16246 states. [2019-12-27 00:37:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16246 to 7067. [2019-12-27 00:37:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-27 00:37:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-27 00:37:28,698 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-27 00:37:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:28,699 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-27 00:37:28,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-27 00:37:28,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:37:28,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:28,699 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:28,902 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:28,903 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:28,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:28,903 INFO L82 PathProgramCache]: Analyzing trace with hash -50954293, now seen corresponding path program 2 times [2019-12-27 00:37:28,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:28,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009443535] [2019-12-27 00:37:28,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:37:28,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009443535] [2019-12-27 00:37:28,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:28,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:28,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666445157] [2019-12-27 00:37:28,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:28,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:28,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:28,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:28,954 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-27 00:37:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:29,284 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-27 00:37:29,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:29,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 00:37:29,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:29,319 INFO L225 Difference]: With dead ends: 16584 [2019-12-27 00:37:29,319 INFO L226 Difference]: Without dead ends: 16579 [2019-12-27 00:37:29,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:37:29,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-27 00:37:29,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-27 00:37:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-27 00:37:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-27 00:37:29,511 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-27 00:37:29,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:29,511 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-27 00:37:29,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-27 00:37:29,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:37:29,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:29,512 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:29,512 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:29,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:29,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2086390321, now seen corresponding path program 1 times [2019-12-27 00:37:29,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:29,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512090444] [2019-12-27 00:37:29,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:29,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512090444] [2019-12-27 00:37:29,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:29,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:29,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808435324] [2019-12-27 00:37:29,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:29,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:29,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:29,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:29,544 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-27 00:37:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:29,675 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-27 00:37:29,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:29,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:37:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:29,701 INFO L225 Difference]: With dead ends: 11876 [2019-12-27 00:37:29,701 INFO L226 Difference]: Without dead ends: 11868 [2019-12-27 00:37:29,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:29,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-27 00:37:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-27 00:37:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-27 00:37:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-27 00:37:29,877 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-27 00:37:29,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:29,877 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-27 00:37:29,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-27 00:37:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:29,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:29,878 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:29,879 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:29,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:29,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2036081631, now seen corresponding path program 1 times [2019-12-27 00:37:29,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:29,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484954337] [2019-12-27 00:37:29,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:30,104 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-27 00:37:30,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:30,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484954337] [2019-12-27 00:37:30,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849436738] [2019-12-27 00:37:30,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:30,210 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:30,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:30,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:30,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:30,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:30,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378023245] [2019-12-27 00:37:30,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:30,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:30,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:30,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:30,276 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 12 states. [2019-12-27 00:37:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:30,630 INFO L93 Difference]: Finished difference Result 18509 states and 75177 transitions. [2019-12-27 00:37:30,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:30,630 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 00:37:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:30,672 INFO L225 Difference]: With dead ends: 18509 [2019-12-27 00:37:30,673 INFO L226 Difference]: Without dead ends: 18503 [2019-12-27 00:37:30,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18503 states. [2019-12-27 00:37:30,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18503 to 8204. [2019-12-27 00:37:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-27 00:37:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-27 00:37:30,914 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-27 00:37:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:30,914 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-27 00:37:30,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-27 00:37:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:30,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:30,915 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:31,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:31,116 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:31,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:31,117 INFO L82 PathProgramCache]: Analyzing trace with hash -728631447, now seen corresponding path program 2 times [2019-12-27 00:37:31,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:31,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922853113] [2019-12-27 00:37:31,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:31,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922853113] [2019-12-27 00:37:31,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:31,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:31,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516398795] [2019-12-27 00:37:31,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:31,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:31,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:31,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:31,165 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 7 states. [2019-12-27 00:37:31,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:31,536 INFO L93 Difference]: Finished difference Result 18912 states and 76848 transitions. [2019-12-27 00:37:31,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:31,536 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:37:31,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:31,604 INFO L225 Difference]: With dead ends: 18912 [2019-12-27 00:37:31,605 INFO L226 Difference]: Without dead ends: 18903 [2019-12-27 00:37:31,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:37:31,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18903 states. [2019-12-27 00:37:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18903 to 7911. [2019-12-27 00:37:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7911 states. [2019-12-27 00:37:32,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7911 states to 7911 states and 36783 transitions. [2019-12-27 00:37:32,147 INFO L78 Accepts]: Start accepts. Automaton has 7911 states and 36783 transitions. Word has length 19 [2019-12-27 00:37:32,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:32,148 INFO L462 AbstractCegarLoop]: Abstraction has 7911 states and 36783 transitions. [2019-12-27 00:37:32,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand 7911 states and 36783 transitions. [2019-12-27 00:37:32,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:32,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:32,149 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:32,149 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:32,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:32,150 INFO L82 PathProgramCache]: Analyzing trace with hash -728623232, now seen corresponding path program 1 times [2019-12-27 00:37:32,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:32,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135218746] [2019-12-27 00:37:32,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:32,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135218746] [2019-12-27 00:37:32,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:32,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:32,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101106432] [2019-12-27 00:37:32,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:32,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:32,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:32,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:32,204 INFO L87 Difference]: Start difference. First operand 7911 states and 36783 transitions. Second operand 7 states. [2019-12-27 00:37:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:32,552 INFO L93 Difference]: Finished difference Result 18895 states and 76839 transitions. [2019-12-27 00:37:32,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:32,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:37:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:32,592 INFO L225 Difference]: With dead ends: 18895 [2019-12-27 00:37:32,592 INFO L226 Difference]: Without dead ends: 18886 [2019-12-27 00:37:32,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:37:32,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18886 states. [2019-12-27 00:37:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18886 to 8150. [2019-12-27 00:37:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8150 states. [2019-12-27 00:37:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8150 states to 8150 states and 37871 transitions. [2019-12-27 00:37:32,837 INFO L78 Accepts]: Start accepts. Automaton has 8150 states and 37871 transitions. Word has length 19 [2019-12-27 00:37:32,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:32,837 INFO L462 AbstractCegarLoop]: Abstraction has 8150 states and 37871 transitions. [2019-12-27 00:37:32,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 8150 states and 37871 transitions. [2019-12-27 00:37:32,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:37:32,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:32,839 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:32,839 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:32,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:32,839 INFO L82 PathProgramCache]: Analyzing trace with hash -718028672, now seen corresponding path program 2 times [2019-12-27 00:37:32,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:32,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858971422] [2019-12-27 00:37:32,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:32,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:32,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858971422] [2019-12-27 00:37:32,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:32,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:32,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891310152] [2019-12-27 00:37:32,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:32,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:32,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:32,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:32,902 INFO L87 Difference]: Start difference. First operand 8150 states and 37871 transitions. Second operand 7 states. [2019-12-27 00:37:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:33,363 INFO L93 Difference]: Finished difference Result 19087 states and 77644 transitions. [2019-12-27 00:37:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:33,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:37:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:33,430 INFO L225 Difference]: With dead ends: 19087 [2019-12-27 00:37:33,430 INFO L226 Difference]: Without dead ends: 19078 [2019-12-27 00:37:33,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:37:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2019-12-27 00:37:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 8107. [2019-12-27 00:37:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-27 00:37:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-27 00:37:33,722 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-27 00:37:33,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:33,722 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-27 00:37:33,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-27 00:37:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:33,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:33,723 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:33,724 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:33,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1830634066, now seen corresponding path program 1 times [2019-12-27 00:37:33,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:33,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409712035] [2019-12-27 00:37:33,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:34,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409712035] [2019-12-27 00:37:34,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232718028] [2019-12-27 00:37:34,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:34,073 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:34,074 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:34,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:34,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:34,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105618284] [2019-12-27 00:37:34,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:34,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:34,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:34,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:34,188 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 16 states. [2019-12-27 00:37:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:35,213 INFO L93 Difference]: Finished difference Result 26399 states and 100480 transitions. [2019-12-27 00:37:35,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:35,214 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:37:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:35,280 INFO L225 Difference]: With dead ends: 26399 [2019-12-27 00:37:35,280 INFO L226 Difference]: Without dead ends: 26395 [2019-12-27 00:37:35,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26395 states. [2019-12-27 00:37:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26395 to 8003. [2019-12-27 00:37:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8003 states. [2019-12-27 00:37:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 37166 transitions. [2019-12-27 00:37:35,601 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 37166 transitions. Word has length 21 [2019-12-27 00:37:35,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:35,601 INFO L462 AbstractCegarLoop]: Abstraction has 8003 states and 37166 transitions. [2019-12-27 00:37:35,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 37166 transitions. [2019-12-27 00:37:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:35,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:35,602 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:35,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:35,803 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:35,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:35,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1820039506, now seen corresponding path program 2 times [2019-12-27 00:37:35,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:35,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396203566] [2019-12-27 00:37:35,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:35,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396203566] [2019-12-27 00:37:35,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876300769] [2019-12-27 00:37:35,873 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:35,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:37:35,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:35,961 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:35,962 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:37:36,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:36,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:36,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773582308] [2019-12-27 00:37:36,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:36,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:36,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:36,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:36,063 INFO L87 Difference]: Start difference. First operand 8003 states and 37166 transitions. Second operand 16 states. [2019-12-27 00:37:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:37,180 INFO L93 Difference]: Finished difference Result 26117 states and 99264 transitions. [2019-12-27 00:37:37,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:37,181 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:37:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:37,239 INFO L225 Difference]: With dead ends: 26117 [2019-12-27 00:37:37,239 INFO L226 Difference]: Without dead ends: 26111 [2019-12-27 00:37:37,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26111 states. [2019-12-27 00:37:37,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26111 to 7893. [2019-12-27 00:37:37,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-27 00:37:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-27 00:37:37,548 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-27 00:37:37,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:37,548 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-27 00:37:37,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-27 00:37:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:37,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:37,550 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:37,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:37,751 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:37,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:37,751 INFO L82 PathProgramCache]: Analyzing trace with hash -135145800, now seen corresponding path program 3 times [2019-12-27 00:37:37,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:37,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605340797] [2019-12-27 00:37:37,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:37,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605340797] [2019-12-27 00:37:37,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:37,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:37:37,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611761997] [2019-12-27 00:37:37,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:37:37,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:37,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:37:37,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:37:37,834 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 9 states. [2019-12-27 00:37:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:38,686 INFO L93 Difference]: Finished difference Result 26136 states and 99362 transitions. [2019-12-27 00:37:38,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:38,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:37:38,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:38,751 INFO L225 Difference]: With dead ends: 26136 [2019-12-27 00:37:38,751 INFO L226 Difference]: Without dead ends: 26132 [2019-12-27 00:37:38,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:37:38,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26132 states. [2019-12-27 00:37:39,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26132 to 7683. [2019-12-27 00:37:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7683 states. [2019-12-27 00:37:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 35650 transitions. [2019-12-27 00:37:39,034 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 35650 transitions. Word has length 21 [2019-12-27 00:37:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:39,034 INFO L462 AbstractCegarLoop]: Abstraction has 7683 states and 35650 transitions. [2019-12-27 00:37:39,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:37:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 35650 transitions. [2019-12-27 00:37:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:39,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:39,035 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:39,035 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:39,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:39,035 INFO L82 PathProgramCache]: Analyzing trace with hash -127259400, now seen corresponding path program 4 times [2019-12-27 00:37:39,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:39,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344862217] [2019-12-27 00:37:39,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:39,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344862217] [2019-12-27 00:37:39,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:39,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:37:39,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198403445] [2019-12-27 00:37:39,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:37:39,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:39,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:37:39,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:37:39,114 INFO L87 Difference]: Start difference. First operand 7683 states and 35650 transitions. Second operand 9 states. [2019-12-27 00:37:40,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:40,273 INFO L93 Difference]: Finished difference Result 25967 states and 98669 transitions. [2019-12-27 00:37:40,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:40,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:37:40,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:40,336 INFO L225 Difference]: With dead ends: 25967 [2019-12-27 00:37:40,336 INFO L226 Difference]: Without dead ends: 25961 [2019-12-27 00:37:40,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:37:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25961 states. [2019-12-27 00:37:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25961 to 7577. [2019-12-27 00:37:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7577 states. [2019-12-27 00:37:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 35112 transitions. [2019-12-27 00:37:40,617 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 35112 transitions. Word has length 21 [2019-12-27 00:37:40,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:40,617 INFO L462 AbstractCegarLoop]: Abstraction has 7577 states and 35112 transitions. [2019-12-27 00:37:40,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:37:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 35112 transitions. [2019-12-27 00:37:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:40,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:40,619 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:40,619 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:40,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:40,619 INFO L82 PathProgramCache]: Analyzing trace with hash 980776630, now seen corresponding path program 1 times [2019-12-27 00:37:40,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:40,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892975419] [2019-12-27 00:37:40,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:37:40,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892975419] [2019-12-27 00:37:40,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:40,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:37:40,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73368151] [2019-12-27 00:37:40,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:37:40,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:40,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:37:40,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:37:40,673 INFO L87 Difference]: Start difference. First operand 7577 states and 35112 transitions. Second operand 5 states. [2019-12-27 00:37:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:40,828 INFO L93 Difference]: Finished difference Result 12960 states and 56912 transitions. [2019-12-27 00:37:40,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:37:40,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 00:37:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:40,857 INFO L225 Difference]: With dead ends: 12960 [2019-12-27 00:37:40,857 INFO L226 Difference]: Without dead ends: 12944 [2019-12-27 00:37:40,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12944 states. [2019-12-27 00:37:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12944 to 9056. [2019-12-27 00:37:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9056 states. [2019-12-27 00:37:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9056 states to 9056 states and 41951 transitions. [2019-12-27 00:37:41,044 INFO L78 Accepts]: Start accepts. Automaton has 9056 states and 41951 transitions. Word has length 21 [2019-12-27 00:37:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:41,044 INFO L462 AbstractCegarLoop]: Abstraction has 9056 states and 41951 transitions. [2019-12-27 00:37:41,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:37:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 9056 states and 41951 transitions. [2019-12-27 00:37:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:41,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:41,045 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:41,046 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:41,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:41,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1464178168, now seen corresponding path program 5 times [2019-12-27 00:37:41,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:41,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478768533] [2019-12-27 00:37:41,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:41,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478768533] [2019-12-27 00:37:41,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:41,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:37:41,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516561188] [2019-12-27 00:37:41,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:37:41,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:41,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:37:41,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:37:41,114 INFO L87 Difference]: Start difference. First operand 9056 states and 41951 transitions. Second operand 9 states. [2019-12-27 00:37:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:41,998 INFO L93 Difference]: Finished difference Result 29260 states and 112921 transitions. [2019-12-27 00:37:41,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:41,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:37:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:42,064 INFO L225 Difference]: With dead ends: 29260 [2019-12-27 00:37:42,064 INFO L226 Difference]: Without dead ends: 29253 [2019-12-27 00:37:42,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:37:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29253 states. [2019-12-27 00:37:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29253 to 8780. [2019-12-27 00:37:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8780 states. [2019-12-27 00:37:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8780 states to 8780 states and 40645 transitions. [2019-12-27 00:37:42,651 INFO L78 Accepts]: Start accepts. Automaton has 8780 states and 40645 transitions. Word has length 21 [2019-12-27 00:37:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:42,652 INFO L462 AbstractCegarLoop]: Abstraction has 8780 states and 40645 transitions. [2019-12-27 00:37:42,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:37:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 8780 states and 40645 transitions. [2019-12-27 00:37:42,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:37:42,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:42,653 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:42,653 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:42,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:42,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1466886328, now seen corresponding path program 6 times [2019-12-27 00:37:42,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:42,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389569622] [2019-12-27 00:37:42,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:42,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389569622] [2019-12-27 00:37:42,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:42,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:37:42,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657401002] [2019-12-27 00:37:42,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:37:42,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:42,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:37:42,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:37:42,740 INFO L87 Difference]: Start difference. First operand 8780 states and 40645 transitions. Second operand 9 states. [2019-12-27 00:37:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:43,607 INFO L93 Difference]: Finished difference Result 28874 states and 111219 transitions. [2019-12-27 00:37:43,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:43,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:37:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:43,667 INFO L225 Difference]: With dead ends: 28874 [2019-12-27 00:37:43,667 INFO L226 Difference]: Without dead ends: 28864 [2019-12-27 00:37:43,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:37:43,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28864 states. [2019-12-27 00:37:43,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28864 to 8405. [2019-12-27 00:37:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-27 00:37:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-27 00:37:43,976 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-27 00:37:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:43,977 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-27 00:37:43,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:37:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-27 00:37:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:37:43,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:43,979 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:43,979 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:43,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:43,979 INFO L82 PathProgramCache]: Analyzing trace with hash 792940754, now seen corresponding path program 1 times [2019-12-27 00:37:43,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:43,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323126946] [2019-12-27 00:37:43,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:44,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323126946] [2019-12-27 00:37:44,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186016453] [2019-12-27 00:37:44,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:44,113 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:44,115 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:44,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:44,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:44,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518069663] [2019-12-27 00:37:44,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:44,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:44,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:44,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:44,177 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 12 states. [2019-12-27 00:37:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:44,592 INFO L93 Difference]: Finished difference Result 19371 states and 79602 transitions. [2019-12-27 00:37:44,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:44,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 00:37:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:44,631 INFO L225 Difference]: With dead ends: 19371 [2019-12-27 00:37:44,631 INFO L226 Difference]: Without dead ends: 19359 [2019-12-27 00:37:44,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2019-12-27 00:37:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 8674. [2019-12-27 00:37:44,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-27 00:37:45,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-27 00:37:45,835 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-27 00:37:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:45,835 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-27 00:37:45,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-27 00:37:45,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:37:45,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:45,839 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:46,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:46,042 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:46,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:46,042 INFO L82 PathProgramCache]: Analyzing trace with hash 568712663, now seen corresponding path program 1 times [2019-12-27 00:37:46,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:46,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825073605] [2019-12-27 00:37:46,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:46,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825073605] [2019-12-27 00:37:46,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779604184] [2019-12-27 00:37:46,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:46,167 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:37:46,168 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:46,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:46,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:37:46,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894269722] [2019-12-27 00:37:46,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:37:46,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:46,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:37:46,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:37:46,242 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 12 states. [2019-12-27 00:37:46,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:46,700 INFO L93 Difference]: Finished difference Result 20307 states and 83553 transitions. [2019-12-27 00:37:46,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:46,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 00:37:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:46,747 INFO L225 Difference]: With dead ends: 20307 [2019-12-27 00:37:46,747 INFO L226 Difference]: Without dead ends: 20293 [2019-12-27 00:37:46,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:37:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20293 states. [2019-12-27 00:37:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20293 to 8934. [2019-12-27 00:37:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8934 states. [2019-12-27 00:37:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8934 states to 8934 states and 41293 transitions. [2019-12-27 00:37:46,999 INFO L78 Accepts]: Start accepts. Automaton has 8934 states and 41293 transitions. Word has length 23 [2019-12-27 00:37:46,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:46,999 INFO L462 AbstractCegarLoop]: Abstraction has 8934 states and 41293 transitions. [2019-12-27 00:37:46,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:37:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 8934 states and 41293 transitions. [2019-12-27 00:37:47,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:37:47,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:47,002 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:47,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:47,205 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:47,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:47,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1942317765, now seen corresponding path program 1 times [2019-12-27 00:37:47,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:47,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927430275] [2019-12-27 00:37:47,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:37:47,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927430275] [2019-12-27 00:37:47,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:47,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:47,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129533234] [2019-12-27 00:37:47,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:47,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:47,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:47,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:47,250 INFO L87 Difference]: Start difference. First operand 8934 states and 41293 transitions. Second operand 7 states. [2019-12-27 00:37:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:47,634 INFO L93 Difference]: Finished difference Result 21050 states and 86745 transitions. [2019-12-27 00:37:47,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:47,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:37:47,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:47,711 INFO L225 Difference]: With dead ends: 21050 [2019-12-27 00:37:47,712 INFO L226 Difference]: Without dead ends: 21031 [2019-12-27 00:37:47,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:37:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21031 states. [2019-12-27 00:37:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21031 to 9143. [2019-12-27 00:37:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9143 states. [2019-12-27 00:37:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9143 states to 9143 states and 42279 transitions. [2019-12-27 00:37:48,057 INFO L78 Accepts]: Start accepts. Automaton has 9143 states and 42279 transitions. Word has length 23 [2019-12-27 00:37:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:48,058 INFO L462 AbstractCegarLoop]: Abstraction has 9143 states and 42279 transitions. [2019-12-27 00:37:48,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 9143 states and 42279 transitions. [2019-12-27 00:37:48,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:37:48,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:48,061 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:48,061 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:48,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:48,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1928498089, now seen corresponding path program 2 times [2019-12-27 00:37:48,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:48,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774701970] [2019-12-27 00:37:48,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:37:48,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774701970] [2019-12-27 00:37:48,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:48,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:48,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938843577] [2019-12-27 00:37:48,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:48,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:48,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:48,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:48,131 INFO L87 Difference]: Start difference. First operand 9143 states and 42279 transitions. Second operand 7 states. [2019-12-27 00:37:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:48,478 INFO L93 Difference]: Finished difference Result 21118 states and 87107 transitions. [2019-12-27 00:37:48,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:48,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:37:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:48,523 INFO L225 Difference]: With dead ends: 21118 [2019-12-27 00:37:48,523 INFO L226 Difference]: Without dead ends: 21099 [2019-12-27 00:37:48,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:37:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21099 states. [2019-12-27 00:37:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21099 to 9234. [2019-12-27 00:37:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-27 00:37:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 42669 transitions. [2019-12-27 00:37:48,944 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 42669 transitions. Word has length 23 [2019-12-27 00:37:48,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:48,944 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 42669 transitions. [2019-12-27 00:37:48,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 42669 transitions. [2019-12-27 00:37:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:37:48,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:48,946 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:48,947 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:48,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:48,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1928500910, now seen corresponding path program 2 times [2019-12-27 00:37:48,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:48,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729076172] [2019-12-27 00:37:48,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:37:49,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729076172] [2019-12-27 00:37:49,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:49,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:49,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581279662] [2019-12-27 00:37:49,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:49,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:49,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:49,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:49,013 INFO L87 Difference]: Start difference. First operand 9234 states and 42669 transitions. Second operand 7 states. [2019-12-27 00:37:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:49,391 INFO L93 Difference]: Finished difference Result 20904 states and 85935 transitions. [2019-12-27 00:37:49,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:49,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:37:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:49,442 INFO L225 Difference]: With dead ends: 20904 [2019-12-27 00:37:49,442 INFO L226 Difference]: Without dead ends: 20885 [2019-12-27 00:37:49,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:37:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20885 states. [2019-12-27 00:37:49,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20885 to 9243. [2019-12-27 00:37:49,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9243 states. [2019-12-27 00:37:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9243 states to 9243 states and 42683 transitions. [2019-12-27 00:37:49,688 INFO L78 Accepts]: Start accepts. Automaton has 9243 states and 42683 transitions. Word has length 23 [2019-12-27 00:37:49,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:49,688 INFO L462 AbstractCegarLoop]: Abstraction has 9243 states and 42683 transitions. [2019-12-27 00:37:49,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 9243 states and 42683 transitions. [2019-12-27 00:37:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:37:49,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:49,690 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:49,690 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:49,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1928509125, now seen corresponding path program 2 times [2019-12-27 00:37:49,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:49,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851113974] [2019-12-27 00:37:49,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:37:49,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851113974] [2019-12-27 00:37:49,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:37:49,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:37:49,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124203412] [2019-12-27 00:37:49,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:37:49,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:49,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:37:49,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:37:49,742 INFO L87 Difference]: Start difference. First operand 9243 states and 42683 transitions. Second operand 7 states. [2019-12-27 00:37:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:50,095 INFO L93 Difference]: Finished difference Result 20784 states and 85269 transitions. [2019-12-27 00:37:50,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:37:50,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:37:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:50,144 INFO L225 Difference]: With dead ends: 20784 [2019-12-27 00:37:50,144 INFO L226 Difference]: Without dead ends: 20765 [2019-12-27 00:37:50,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:37:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20765 states. [2019-12-27 00:37:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20765 to 9286. [2019-12-27 00:37:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-27 00:37:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-27 00:37:50,410 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-27 00:37:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:50,410 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-27 00:37:50,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:37:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-27 00:37:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:50,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:50,413 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:50,414 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:50,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:50,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1810061765, now seen corresponding path program 1 times [2019-12-27 00:37:50,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:50,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044207263] [2019-12-27 00:37:50,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:50,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044207263] [2019-12-27 00:37:50,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808684595] [2019-12-27 00:37:50,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:50,572 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:50,573 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:50,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:50,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:50,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032009704] [2019-12-27 00:37:50,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:50,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:50,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:50,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:50,690 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 16 states. [2019-12-27 00:37:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:51,660 INFO L93 Difference]: Finished difference Result 29793 states and 115235 transitions. [2019-12-27 00:37:51,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:51,661 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:37:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:51,721 INFO L225 Difference]: With dead ends: 29793 [2019-12-27 00:37:51,722 INFO L226 Difference]: Without dead ends: 29783 [2019-12-27 00:37:51,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29783 states. [2019-12-27 00:37:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29783 to 9208. [2019-12-27 00:37:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9208 states. [2019-12-27 00:37:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9208 states to 9208 states and 42351 transitions. [2019-12-27 00:37:52,282 INFO L78 Accepts]: Start accepts. Automaton has 9208 states and 42351 transitions. Word has length 25 [2019-12-27 00:37:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:52,282 INFO L462 AbstractCegarLoop]: Abstraction has 9208 states and 42351 transitions. [2019-12-27 00:37:52,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 9208 states and 42351 transitions. [2019-12-27 00:37:52,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:52,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:52,286 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:52,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:52,489 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:52,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:52,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1820667361, now seen corresponding path program 1 times [2019-12-27 00:37:52,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:52,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538680588] [2019-12-27 00:37:52,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:52,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538680588] [2019-12-27 00:37:52,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156079072] [2019-12-27 00:37:52,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:52,638 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:52,645 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:52,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:52,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:52,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102985931] [2019-12-27 00:37:52,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:52,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:52,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:52,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:52,738 INFO L87 Difference]: Start difference. First operand 9208 states and 42351 transitions. Second operand 16 states. [2019-12-27 00:37:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:53,771 INFO L93 Difference]: Finished difference Result 29371 states and 113449 transitions. [2019-12-27 00:37:53,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:53,771 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:37:53,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:53,841 INFO L225 Difference]: With dead ends: 29371 [2019-12-27 00:37:53,842 INFO L226 Difference]: Without dead ends: 29361 [2019-12-27 00:37:53,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29361 states. [2019-12-27 00:37:54,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29361 to 9154. [2019-12-27 00:37:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9154 states. [2019-12-27 00:37:54,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 42049 transitions. [2019-12-27 00:37:54,199 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 42049 transitions. Word has length 25 [2019-12-27 00:37:54,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:54,199 INFO L462 AbstractCegarLoop]: Abstraction has 9154 states and 42049 transitions. [2019-12-27 00:37:54,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 42049 transitions. [2019-12-27 00:37:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:54,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:54,203 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:54,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:54,404 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:54,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:54,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1806847685, now seen corresponding path program 2 times [2019-12-27 00:37:54,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:54,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291024142] [2019-12-27 00:37:54,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:54,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291024142] [2019-12-27 00:37:54,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678370376] [2019-12-27 00:37:54,493 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:54,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:37:54,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:54,598 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:54,599 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:54,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:54,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:54,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502071032] [2019-12-27 00:37:54,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:54,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:54,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:54,718 INFO L87 Difference]: Start difference. First operand 9154 states and 42049 transitions. Second operand 16 states. [2019-12-27 00:37:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:55,673 INFO L93 Difference]: Finished difference Result 28955 states and 111688 transitions. [2019-12-27 00:37:55,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:55,674 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:37:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:55,733 INFO L225 Difference]: With dead ends: 28955 [2019-12-27 00:37:55,733 INFO L226 Difference]: Without dead ends: 28944 [2019-12-27 00:37:55,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28944 states. [2019-12-27 00:37:56,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28944 to 9151. [2019-12-27 00:37:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9151 states. [2019-12-27 00:37:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9151 states to 9151 states and 41998 transitions. [2019-12-27 00:37:56,057 INFO L78 Accepts]: Start accepts. Automaton has 9151 states and 41998 transitions. Word has length 25 [2019-12-27 00:37:56,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:56,057 INFO L462 AbstractCegarLoop]: Abstraction has 9151 states and 41998 transitions. [2019-12-27 00:37:56,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 9151 states and 41998 transitions. [2019-12-27 00:37:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:56,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:56,060 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:56,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:56,261 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:56,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:56,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1806858721, now seen corresponding path program 2 times [2019-12-27 00:37:56,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:56,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736670428] [2019-12-27 00:37:56,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:56,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736670428] [2019-12-27 00:37:56,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947834210] [2019-12-27 00:37:56,331 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:56,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:37:56,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:56,407 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:56,408 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 00:37:56,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:56,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:56,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998562501] [2019-12-27 00:37:56,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:56,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:56,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:56,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:56,626 INFO L87 Difference]: Start difference. First operand 9151 states and 41998 transitions. Second operand 16 states. [2019-12-27 00:37:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:57,611 INFO L93 Difference]: Finished difference Result 28625 states and 110367 transitions. [2019-12-27 00:37:57,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:57,611 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:37:57,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:57,679 INFO L225 Difference]: With dead ends: 28625 [2019-12-27 00:37:57,679 INFO L226 Difference]: Without dead ends: 28614 [2019-12-27 00:37:57,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:57,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28614 states. [2019-12-27 00:37:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28614 to 9044. [2019-12-27 00:37:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-27 00:37:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-27 00:37:58,020 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-27 00:37:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:58,020 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-27 00:37:58,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-27 00:37:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:58,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:58,024 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:58,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:58,224 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:37:58,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:58,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1077942095, now seen corresponding path program 3 times [2019-12-27 00:37:58,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:58,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336522415] [2019-12-27 00:37:58,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:58,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336522415] [2019-12-27 00:37:58,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953595140] [2019-12-27 00:37:58,310 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:58,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:37:58,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:58,385 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:37:58,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:37:58,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:58,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:37:58,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248260021] [2019-12-27 00:37:58,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:37:58,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:58,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:37:58,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:37:58,472 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 16 states. [2019-12-27 00:37:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:59,449 INFO L93 Difference]: Finished difference Result 28739 states and 110779 transitions. [2019-12-27 00:37:59,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:37:59,449 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:37:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:59,508 INFO L225 Difference]: With dead ends: 28739 [2019-12-27 00:37:59,509 INFO L226 Difference]: Without dead ends: 28729 [2019-12-27 00:37:59,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:37:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28729 states. [2019-12-27 00:37:59,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28729 to 8878. [2019-12-27 00:37:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2019-12-27 00:37:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 40685 transitions. [2019-12-27 00:37:59,812 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 40685 transitions. Word has length 25 [2019-12-27 00:37:59,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:59,812 INFO L462 AbstractCegarLoop]: Abstraction has 8878 states and 40685 transitions. [2019-12-27 00:37:59,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:37:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 40685 transitions. [2019-12-27 00:37:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:59,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:59,815 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:00,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:00,016 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:00,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:00,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1085836710, now seen corresponding path program 1 times [2019-12-27 00:38:00,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:00,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605422664] [2019-12-27 00:38:00,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:38:00,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605422664] [2019-12-27 00:38:00,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430974627] [2019-12-27 00:38:00,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:00,163 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:38:00,164 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:38:00,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:00,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:38:00,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127891452] [2019-12-27 00:38:00,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:38:00,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:00,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:38:00,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:38:00,252 INFO L87 Difference]: Start difference. First operand 8878 states and 40685 transitions. Second operand 16 states. [2019-12-27 00:38:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:01,344 INFO L93 Difference]: Finished difference Result 29134 states and 112632 transitions. [2019-12-27 00:38:01,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:01,344 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:38:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:01,406 INFO L225 Difference]: With dead ends: 29134 [2019-12-27 00:38:01,406 INFO L226 Difference]: Without dead ends: 29124 [2019-12-27 00:38:01,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:38:01,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29124 states. [2019-12-27 00:38:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29124 to 8860. [2019-12-27 00:38:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8860 states. [2019-12-27 00:38:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8860 states to 8860 states and 40559 transitions. [2019-12-27 00:38:01,877 INFO L78 Accepts]: Start accepts. Automaton has 8860 states and 40559 transitions. Word has length 25 [2019-12-27 00:38:01,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:01,877 INFO L462 AbstractCegarLoop]: Abstraction has 8860 states and 40559 transitions. [2019-12-27 00:38:01,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:38:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 8860 states and 40559 transitions. [2019-12-27 00:38:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:01,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:01,880 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:02,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:02,081 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:02,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:02,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1072019855, now seen corresponding path program 4 times [2019-12-27 00:38:02,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:02,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679603781] [2019-12-27 00:38:02,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:38:02,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679603781] [2019-12-27 00:38:02,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055051920] [2019-12-27 00:38:02,140 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:02,225 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:38:02,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:38:02,226 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:38:02,227 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:38:02,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:02,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:38:02,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621632062] [2019-12-27 00:38:02,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:38:02,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:02,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:38:02,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:38:02,313 INFO L87 Difference]: Start difference. First operand 8860 states and 40559 transitions. Second operand 16 states. [2019-12-27 00:38:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:03,319 INFO L93 Difference]: Finished difference Result 28595 states and 110187 transitions. [2019-12-27 00:38:03,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:03,320 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:38:03,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:03,382 INFO L225 Difference]: With dead ends: 28595 [2019-12-27 00:38:03,382 INFO L226 Difference]: Without dead ends: 28584 [2019-12-27 00:38:03,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:38:03,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28584 states. [2019-12-27 00:38:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28584 to 8857. [2019-12-27 00:38:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8857 states. [2019-12-27 00:38:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8857 states to 8857 states and 40508 transitions. [2019-12-27 00:38:03,705 INFO L78 Accepts]: Start accepts. Automaton has 8857 states and 40508 transitions. Word has length 25 [2019-12-27 00:38:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:03,706 INFO L462 AbstractCegarLoop]: Abstraction has 8857 states and 40508 transitions. [2019-12-27 00:38:03,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:38:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand 8857 states and 40508 transitions. [2019-12-27 00:38:03,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:03,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:03,709 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:03,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:03,910 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:03,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:03,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1072028070, now seen corresponding path program 2 times [2019-12-27 00:38:03,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:03,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394429715] [2019-12-27 00:38:03,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:38:03,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394429715] [2019-12-27 00:38:03,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000872843] [2019-12-27 00:38:03,984 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:04,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:38:04,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:38:04,069 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:38:04,070 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:38:04,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:04,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:38:04,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190978135] [2019-12-27 00:38:04,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:38:04,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:04,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:38:04,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:38:04,147 INFO L87 Difference]: Start difference. First operand 8857 states and 40508 transitions. Second operand 16 states. [2019-12-27 00:38:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:05,199 INFO L93 Difference]: Finished difference Result 28468 states and 109859 transitions. [2019-12-27 00:38:05,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:05,200 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:38:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:05,263 INFO L225 Difference]: With dead ends: 28468 [2019-12-27 00:38:05,263 INFO L226 Difference]: Without dead ends: 28454 [2019-12-27 00:38:05,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:38:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28454 states. [2019-12-27 00:38:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28454 to 8722. [2019-12-27 00:38:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-27 00:38:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39857 transitions. [2019-12-27 00:38:05,584 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39857 transitions. Word has length 25 [2019-12-27 00:38:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:05,584 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39857 transitions. [2019-12-27 00:38:05,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:38:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39857 transitions. [2019-12-27 00:38:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:05,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:05,588 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:05,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:05,789 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:05,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:05,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2071430200, now seen corresponding path program 1 times [2019-12-27 00:38:05,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:05,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934111156] [2019-12-27 00:38:05,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-27 00:38:05,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934111156] [2019-12-27 00:38:05,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:05,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:38:05,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066281308] [2019-12-27 00:38:05,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:38:05,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:05,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:38:05,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:38:05,826 INFO L87 Difference]: Start difference. First operand 8722 states and 39857 transitions. Second operand 5 states. [2019-12-27 00:38:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:05,995 INFO L93 Difference]: Finished difference Result 14188 states and 62117 transitions. [2019-12-27 00:38:05,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:38:05,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 00:38:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:06,032 INFO L225 Difference]: With dead ends: 14188 [2019-12-27 00:38:06,032 INFO L226 Difference]: Without dead ends: 14156 [2019-12-27 00:38:06,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:38:06,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2019-12-27 00:38:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 10325. [2019-12-27 00:38:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10325 states. [2019-12-27 00:38:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10325 states to 10325 states and 46869 transitions. [2019-12-27 00:38:06,268 INFO L78 Accepts]: Start accepts. Automaton has 10325 states and 46869 transitions. Word has length 25 [2019-12-27 00:38:06,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:06,268 INFO L462 AbstractCegarLoop]: Abstraction has 10325 states and 46869 transitions. [2019-12-27 00:38:06,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:38:06,268 INFO L276 IsEmpty]: Start isEmpty. Operand 10325 states and 46869 transitions. [2019-12-27 00:38:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:06,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:06,271 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:06,272 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:06,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1740193032, now seen corresponding path program 3 times [2019-12-27 00:38:06,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:06,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215751488] [2019-12-27 00:38:06,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:38:06,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215751488] [2019-12-27 00:38:06,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:06,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:06,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605854521] [2019-12-27 00:38:06,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:06,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:06,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:06,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:06,374 INFO L87 Difference]: Start difference. First operand 10325 states and 46869 transitions. Second operand 9 states. [2019-12-27 00:38:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:07,313 INFO L93 Difference]: Finished difference Result 31989 states and 124702 transitions. [2019-12-27 00:38:07,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:07,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:07,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:07,380 INFO L225 Difference]: With dead ends: 31989 [2019-12-27 00:38:07,380 INFO L226 Difference]: Without dead ends: 31973 [2019-12-27 00:38:07,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31973 states. [2019-12-27 00:38:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31973 to 10175. [2019-12-27 00:38:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10175 states. [2019-12-27 00:38:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10175 states to 10175 states and 46142 transitions. [2019-12-27 00:38:07,727 INFO L78 Accepts]: Start accepts. Automaton has 10175 states and 46142 transitions. Word has length 25 [2019-12-27 00:38:07,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:07,727 INFO L462 AbstractCegarLoop]: Abstraction has 10175 states and 46142 transitions. [2019-12-27 00:38:07,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 10175 states and 46142 transitions. [2019-12-27 00:38:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:07,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:07,730 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:07,730 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:07,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:07,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1737482051, now seen corresponding path program 3 times [2019-12-27 00:38:07,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:07,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527793269] [2019-12-27 00:38:07,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:38:07,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527793269] [2019-12-27 00:38:07,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:07,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:07,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615155218] [2019-12-27 00:38:07,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:07,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:07,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:07,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:07,786 INFO L87 Difference]: Start difference. First operand 10175 states and 46142 transitions. Second operand 9 states. [2019-12-27 00:38:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:08,647 INFO L93 Difference]: Finished difference Result 31605 states and 123025 transitions. [2019-12-27 00:38:08,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:08,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:08,716 INFO L225 Difference]: With dead ends: 31605 [2019-12-27 00:38:08,716 INFO L226 Difference]: Without dead ends: 31589 [2019-12-27 00:38:08,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:08,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31589 states. [2019-12-27 00:38:09,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31589 to 10057. [2019-12-27 00:38:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10057 states. [2019-12-27 00:38:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10057 states to 10057 states and 45612 transitions. [2019-12-27 00:38:09,044 INFO L78 Accepts]: Start accepts. Automaton has 10057 states and 45612 transitions. Word has length 25 [2019-12-27 00:38:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:09,044 INFO L462 AbstractCegarLoop]: Abstraction has 10057 states and 45612 transitions. [2019-12-27 00:38:09,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:09,045 INFO L276 IsEmpty]: Start isEmpty. Operand 10057 states and 45612 transitions. [2019-12-27 00:38:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:09,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:09,047 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:09,048 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:09,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:09,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1743407112, now seen corresponding path program 4 times [2019-12-27 00:38:09,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:09,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076868259] [2019-12-27 00:38:09,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:38:09,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076868259] [2019-12-27 00:38:09,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:09,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:09,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970781221] [2019-12-27 00:38:09,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:09,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:09,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:09,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:09,107 INFO L87 Difference]: Start difference. First operand 10057 states and 45612 transitions. Second operand 9 states. [2019-12-27 00:38:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:10,041 INFO L93 Difference]: Finished difference Result 31999 states and 124705 transitions. [2019-12-27 00:38:10,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:10,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:10,122 INFO L225 Difference]: With dead ends: 31999 [2019-12-27 00:38:10,122 INFO L226 Difference]: Without dead ends: 31979 [2019-12-27 00:38:10,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:10,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31979 states. [2019-12-27 00:38:10,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31979 to 10010. [2019-12-27 00:38:10,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10010 states. [2019-12-27 00:38:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10010 states to 10010 states and 45376 transitions. [2019-12-27 00:38:10,512 INFO L78 Accepts]: Start accepts. Automaton has 10010 states and 45376 transitions. Word has length 25 [2019-12-27 00:38:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:10,512 INFO L462 AbstractCegarLoop]: Abstraction has 10010 states and 45376 transitions. [2019-12-27 00:38:10,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 10010 states and 45376 transitions. [2019-12-27 00:38:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:10,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:10,516 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:10,516 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:10,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1743404291, now seen corresponding path program 4 times [2019-12-27 00:38:10,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:10,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624575287] [2019-12-27 00:38:10,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:38:10,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624575287] [2019-12-27 00:38:10,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:10,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:10,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460445034] [2019-12-27 00:38:10,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:10,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:10,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:10,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:10,609 INFO L87 Difference]: Start difference. First operand 10010 states and 45376 transitions. Second operand 9 states. [2019-12-27 00:38:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:11,640 INFO L93 Difference]: Finished difference Result 31576 states and 122968 transitions. [2019-12-27 00:38:11,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:11,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:11,706 INFO L225 Difference]: With dead ends: 31576 [2019-12-27 00:38:11,706 INFO L226 Difference]: Without dead ends: 31556 [2019-12-27 00:38:11,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:11,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31556 states. [2019-12-27 00:38:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31556 to 9827. [2019-12-27 00:38:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9827 states. [2019-12-27 00:38:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9827 states to 9827 states and 44489 transitions. [2019-12-27 00:38:12,026 INFO L78 Accepts]: Start accepts. Automaton has 9827 states and 44489 transitions. Word has length 25 [2019-12-27 00:38:12,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:12,026 INFO L462 AbstractCegarLoop]: Abstraction has 9827 states and 44489 transitions. [2019-12-27 00:38:12,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 9827 states and 44489 transitions. [2019-12-27 00:38:12,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:12,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:12,030 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:12,030 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:12,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:12,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2139211039, now seen corresponding path program 5 times [2019-12-27 00:38:12,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:12,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570450996] [2019-12-27 00:38:12,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:38:12,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570450996] [2019-12-27 00:38:12,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:12,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:12,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291629285] [2019-12-27 00:38:12,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:12,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:12,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:12,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:12,097 INFO L87 Difference]: Start difference. First operand 9827 states and 44489 transitions. Second operand 9 states. [2019-12-27 00:38:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:12,932 INFO L93 Difference]: Finished difference Result 31623 states and 123094 transitions. [2019-12-27 00:38:12,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:12,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:12,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:12,997 INFO L225 Difference]: With dead ends: 31623 [2019-12-27 00:38:12,997 INFO L226 Difference]: Without dead ends: 31607 [2019-12-27 00:38:12,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31607 states. [2019-12-27 00:38:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31607 to 9671. [2019-12-27 00:38:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9671 states. [2019-12-27 00:38:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9671 states to 9671 states and 43725 transitions. [2019-12-27 00:38:13,334 INFO L78 Accepts]: Start accepts. Automaton has 9671 states and 43725 transitions. Word has length 25 [2019-12-27 00:38:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:13,334 INFO L462 AbstractCegarLoop]: Abstraction has 9671 states and 43725 transitions. [2019-12-27 00:38:13,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 9671 states and 43725 transitions. [2019-12-27 00:38:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:13,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:13,337 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:13,337 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:13,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:13,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2139202824, now seen corresponding path program 5 times [2019-12-27 00:38:13,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:13,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709445425] [2019-12-27 00:38:13,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:38:13,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709445425] [2019-12-27 00:38:13,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:13,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:13,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057894239] [2019-12-27 00:38:13,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:13,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:13,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:13,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:13,409 INFO L87 Difference]: Start difference. First operand 9671 states and 43725 transitions. Second operand 9 states. [2019-12-27 00:38:14,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:14,246 INFO L93 Difference]: Finished difference Result 31103 states and 120876 transitions. [2019-12-27 00:38:14,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:14,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:14,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:14,310 INFO L225 Difference]: With dead ends: 31103 [2019-12-27 00:38:14,310 INFO L226 Difference]: Without dead ends: 31087 [2019-12-27 00:38:14,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31087 states. [2019-12-27 00:38:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31087 to 9503. [2019-12-27 00:38:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9503 states. [2019-12-27 00:38:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9503 states to 9503 states and 42917 transitions. [2019-12-27 00:38:14,644 INFO L78 Accepts]: Start accepts. Automaton has 9503 states and 42917 transitions. Word has length 25 [2019-12-27 00:38:14,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:14,644 INFO L462 AbstractCegarLoop]: Abstraction has 9503 states and 42917 transitions. [2019-12-27 00:38:14,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:14,644 INFO L276 IsEmpty]: Start isEmpty. Operand 9503 states and 42917 transitions. [2019-12-27 00:38:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:14,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:14,647 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:14,648 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:14,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:14,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2136502879, now seen corresponding path program 6 times [2019-12-27 00:38:14,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:14,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546297140] [2019-12-27 00:38:14,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:38:14,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546297140] [2019-12-27 00:38:14,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:14,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:14,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552152333] [2019-12-27 00:38:14,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:14,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:14,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:14,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:14,712 INFO L87 Difference]: Start difference. First operand 9503 states and 42917 transitions. Second operand 9 states. [2019-12-27 00:38:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:15,555 INFO L93 Difference]: Finished difference Result 30789 states and 119448 transitions. [2019-12-27 00:38:15,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:15,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:15,623 INFO L225 Difference]: With dead ends: 30789 [2019-12-27 00:38:15,623 INFO L226 Difference]: Without dead ends: 30769 [2019-12-27 00:38:15,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:15,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30769 states. [2019-12-27 00:38:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30769 to 9172. [2019-12-27 00:38:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9172 states. [2019-12-27 00:38:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9172 states to 9172 states and 41398 transitions. [2019-12-27 00:38:16,149 INFO L78 Accepts]: Start accepts. Automaton has 9172 states and 41398 transitions. Word has length 25 [2019-12-27 00:38:16,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:16,149 INFO L462 AbstractCegarLoop]: Abstraction has 9172 states and 41398 transitions. [2019-12-27 00:38:16,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 9172 states and 41398 transitions. [2019-12-27 00:38:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:16,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:16,152 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:16,152 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:16,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:16,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2136491843, now seen corresponding path program 5 times [2019-12-27 00:38:16,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:16,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110948949] [2019-12-27 00:38:16,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:38:16,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110948949] [2019-12-27 00:38:16,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:16,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:16,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572778648] [2019-12-27 00:38:16,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:16,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:16,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:16,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:16,221 INFO L87 Difference]: Start difference. First operand 9172 states and 41398 transitions. Second operand 9 states. [2019-12-27 00:38:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:17,098 INFO L93 Difference]: Finished difference Result 30398 states and 117772 transitions. [2019-12-27 00:38:17,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:17,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:17,168 INFO L225 Difference]: With dead ends: 30398 [2019-12-27 00:38:17,169 INFO L226 Difference]: Without dead ends: 30382 [2019-12-27 00:38:17,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30382 states. [2019-12-27 00:38:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30382 to 9066. [2019-12-27 00:38:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9066 states. [2019-12-27 00:38:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9066 states to 9066 states and 40900 transitions. [2019-12-27 00:38:17,486 INFO L78 Accepts]: Start accepts. Automaton has 9066 states and 40900 transitions. Word has length 25 [2019-12-27 00:38:17,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:17,486 INFO L462 AbstractCegarLoop]: Abstraction has 9066 states and 40900 transitions. [2019-12-27 00:38:17,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:17,486 INFO L276 IsEmpty]: Start isEmpty. Operand 9066 states and 40900 transitions. [2019-12-27 00:38:17,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:17,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:17,489 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:17,489 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:17,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2128608264, now seen corresponding path program 6 times [2019-12-27 00:38:17,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:17,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711216274] [2019-12-27 00:38:17,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:38:17,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711216274] [2019-12-27 00:38:17,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:17,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:17,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170493079] [2019-12-27 00:38:17,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:17,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:17,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:17,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:17,556 INFO L87 Difference]: Start difference. First operand 9066 states and 40900 transitions. Second operand 9 states. [2019-12-27 00:38:18,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:18,519 INFO L93 Difference]: Finished difference Result 30130 states and 116617 transitions. [2019-12-27 00:38:18,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:18,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:18,593 INFO L225 Difference]: With dead ends: 30130 [2019-12-27 00:38:18,593 INFO L226 Difference]: Without dead ends: 30110 [2019-12-27 00:38:18,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30110 states. [2019-12-27 00:38:18,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30110 to 8819. [2019-12-27 00:38:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8819 states. [2019-12-27 00:38:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8819 states to 8819 states and 39792 transitions. [2019-12-27 00:38:18,948 INFO L78 Accepts]: Start accepts. Automaton has 8819 states and 39792 transitions. Word has length 25 [2019-12-27 00:38:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:18,948 INFO L462 AbstractCegarLoop]: Abstraction has 8819 states and 39792 transitions. [2019-12-27 00:38:18,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 8819 states and 39792 transitions. [2019-12-27 00:38:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:38:18,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:18,951 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:18,951 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:18,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:18,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2128605443, now seen corresponding path program 6 times [2019-12-27 00:38:18,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:18,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15191305] [2019-12-27 00:38:18,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:38:19,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15191305] [2019-12-27 00:38:19,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:19,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:38:19,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527024297] [2019-12-27 00:38:19,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:38:19,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:38:19,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:38:19,027 INFO L87 Difference]: Start difference. First operand 8819 states and 39792 transitions. Second operand 9 states. [2019-12-27 00:38:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:19,966 INFO L93 Difference]: Finished difference Result 29741 states and 115009 transitions. [2019-12-27 00:38:19,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:19,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:38:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:20,028 INFO L225 Difference]: With dead ends: 29741 [2019-12-27 00:38:20,028 INFO L226 Difference]: Without dead ends: 29721 [2019-12-27 00:38:20,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:38:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29721 states. [2019-12-27 00:38:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29721 to 8516. [2019-12-27 00:38:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-27 00:38:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-27 00:38:20,325 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-27 00:38:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:20,325 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-27 00:38:20,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:38:20,325 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-27 00:38:20,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 00:38:20,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:20,329 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:20,329 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:20,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:20,329 INFO L82 PathProgramCache]: Analyzing trace with hash -214879977, now seen corresponding path program 1 times [2019-12-27 00:38:20,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:20,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745147076] [2019-12-27 00:38:20,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:38:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:38:20,348 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:38:20,348 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:38:20,348 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:38:20,348 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 00:38:20,362 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,362 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,363 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,363 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,363 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,363 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,363 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,363 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,363 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,364 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,364 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,364 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,364 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,364 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,364 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,364 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,364 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,365 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,365 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,365 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,365 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,365 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,365 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,365 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,366 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,366 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,366 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,366 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,366 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,366 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,366 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,366 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,367 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,367 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,367 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,367 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,367 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,367 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,367 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,368 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,368 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,368 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,368 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,368 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,368 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,368 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,376 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,377 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,377 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,377 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,377 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,378 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,378 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,379 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,379 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,379 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,386 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,386 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,387 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,388 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,388 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,388 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,388 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,388 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,389 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,390 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,390 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,390 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,390 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,391 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,391 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,391 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,392 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,392 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,394 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,395 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,395 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,396 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,396 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,397 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,397 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,398 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,398 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,398 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,399 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,399 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:38:20,403 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 00:38:20,404 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:38:20,404 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:38:20,404 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:38:20,404 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:38:20,404 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:38:20,404 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:38:20,404 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:38:20,404 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:38:20,406 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 133 transitions [2019-12-27 00:38:20,406 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 152 places, 133 transitions [2019-12-27 00:38:20,429 INFO L132 PetriNetUnfolder]: 8/168 cut-off events. [2019-12-27 00:38:20,429 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 00:38:20,432 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 168 events. 8/168 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 260 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 203. Up to 14 conditions per place. [2019-12-27 00:38:20,439 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 152 places, 133 transitions [2019-12-27 00:38:20,461 INFO L132 PetriNetUnfolder]: 8/168 cut-off events. [2019-12-27 00:38:20,461 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 00:38:20,464 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 168 events. 8/168 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 260 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 203. Up to 14 conditions per place. [2019-12-27 00:38:20,470 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2019-12-27 00:38:20,471 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:38:22,383 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-12-27 00:38:22,576 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-27 00:38:22,828 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-12-27 00:38:22,912 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3471 [2019-12-27 00:38:22,913 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 00:38:22,913 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-27 00:38:24,113 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-27 00:38:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-27 00:38:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:38:24,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:24,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:38:24,113 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:24,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:24,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1229452, now seen corresponding path program 1 times [2019-12-27 00:38:24,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:24,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879257657] [2019-12-27 00:38:24,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:24,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879257657] [2019-12-27 00:38:24,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:24,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:38:24,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881733375] [2019-12-27 00:38:24,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:38:24,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:24,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:38:24,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:38:24,125 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-27 00:38:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:24,269 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-27 00:38:24,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:38:24,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:38:24,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:24,314 INFO L225 Difference]: With dead ends: 17885 [2019-12-27 00:38:24,314 INFO L226 Difference]: Without dead ends: 16791 [2019-12-27 00:38:24,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:38:24,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-27 00:38:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-27 00:38:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-27 00:38:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-27 00:38:24,678 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-27 00:38:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:24,678 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-27 00:38:24,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:38:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-27 00:38:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:38:24,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:24,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:24,679 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:24,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:24,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2087713608, now seen corresponding path program 1 times [2019-12-27 00:38:24,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:24,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650871547] [2019-12-27 00:38:24,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:24,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650871547] [2019-12-27 00:38:24,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:24,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:38:24,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760891663] [2019-12-27 00:38:24,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:38:24,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:24,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:38:24,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:38:24,716 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-27 00:38:24,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:24,959 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-27 00:38:24,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:38:24,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:38:24,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:25,039 INFO L225 Difference]: With dead ends: 29874 [2019-12-27 00:38:25,039 INFO L226 Difference]: Without dead ends: 29871 [2019-12-27 00:38:25,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:38:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-27 00:38:25,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-27 00:38:25,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 00:38:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-27 00:38:25,563 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-27 00:38:25,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:25,564 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-27 00:38:25,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:38:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-27 00:38:25,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:38:25,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:25,564 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:25,564 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:25,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:25,564 INFO L82 PathProgramCache]: Analyzing trace with hash -973722539, now seen corresponding path program 1 times [2019-12-27 00:38:25,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:25,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653102337] [2019-12-27 00:38:25,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:38:25,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653102337] [2019-12-27 00:38:25,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:25,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:38:25,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564392502] [2019-12-27 00:38:25,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:38:25,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:25,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:38:25,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:38:25,589 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-27 00:38:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:25,859 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-27 00:38:25,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:38:25,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:38:25,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:25,954 INFO L225 Difference]: With dead ends: 34948 [2019-12-27 00:38:25,955 INFO L226 Difference]: Without dead ends: 34944 [2019-12-27 00:38:25,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:38:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-27 00:38:28,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-27 00:38:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-27 00:38:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-27 00:38:28,386 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-27 00:38:28,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:28,387 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-27 00:38:28,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:38:28,387 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-27 00:38:28,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:38:28,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:28,387 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:28,387 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:28,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:28,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1543295844, now seen corresponding path program 1 times [2019-12-27 00:38:28,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:28,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417015485] [2019-12-27 00:38:28,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:28,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417015485] [2019-12-27 00:38:28,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575410599] [2019-12-27 00:38:28,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:28,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:38:28,515 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:28,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:28,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:38:28,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402816344] [2019-12-27 00:38:28,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:38:28,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:28,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:38:28,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:38:28,577 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 12 states. [2019-12-27 00:38:29,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:29,184 INFO L93 Difference]: Finished difference Result 54752 states and 257250 transitions. [2019-12-27 00:38:29,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:38:29,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 00:38:29,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:29,346 INFO L225 Difference]: With dead ends: 54752 [2019-12-27 00:38:29,346 INFO L226 Difference]: Without dead ends: 54748 [2019-12-27 00:38:29,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:38:29,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54748 states. [2019-12-27 00:38:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54748 to 22725. [2019-12-27 00:38:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-27 00:38:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-27 00:38:30,211 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-27 00:38:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:30,212 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-27 00:38:30,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:38:30,212 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-27 00:38:30,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:38:30,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:30,212 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:30,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:30,413 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:30,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:30,413 INFO L82 PathProgramCache]: Analyzing trace with hash 555508526, now seen corresponding path program 2 times [2019-12-27 00:38:30,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:30,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909142264] [2019-12-27 00:38:30,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:38:30,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909142264] [2019-12-27 00:38:30,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:30,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:38:30,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88151710] [2019-12-27 00:38:30,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:38:30,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:30,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:38:30,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:38:30,461 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-27 00:38:31,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:31,047 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-27 00:38:31,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:38:31,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 00:38:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:31,229 INFO L225 Difference]: With dead ends: 56062 [2019-12-27 00:38:31,229 INFO L226 Difference]: Without dead ends: 56057 [2019-12-27 00:38:31,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:38:31,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-27 00:38:34,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-27 00:38:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-27 00:38:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-27 00:38:34,524 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-27 00:38:34,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:34,524 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-27 00:38:34,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:38:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-27 00:38:34,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:38:34,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:34,524 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:34,525 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:34,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:34,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1552042877, now seen corresponding path program 1 times [2019-12-27 00:38:34,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:34,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424057741] [2019-12-27 00:38:34,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:38:34,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424057741] [2019-12-27 00:38:34,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:34,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:38:34,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47089070] [2019-12-27 00:38:34,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:38:34,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:34,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:38:34,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:38:34,552 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-27 00:38:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:34,873 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-27 00:38:34,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:38:34,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:38:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:34,990 INFO L225 Difference]: With dead ends: 40360 [2019-12-27 00:38:34,990 INFO L226 Difference]: Without dead ends: 40352 [2019-12-27 00:38:34,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:38:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-27 00:38:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-27 00:38:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-27 00:38:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-27 00:38:35,797 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-27 00:38:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:35,797 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-27 00:38:35,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:38:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-27 00:38:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:38:35,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:35,798 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:35,798 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1878511684, now seen corresponding path program 1 times [2019-12-27 00:38:35,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:35,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955172215] [2019-12-27 00:38:35,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 00:38:35,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955172215] [2019-12-27 00:38:35,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590819205] [2019-12-27 00:38:35,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:35,927 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:38:35,928 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 00:38:35,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:35,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:38:35,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679310798] [2019-12-27 00:38:35,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:38:35,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:35,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:38:35,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:38:35,984 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 12 states. [2019-12-27 00:38:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:36,672 INFO L93 Difference]: Finished difference Result 64531 states and 308602 transitions. [2019-12-27 00:38:36,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:38:36,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 00:38:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:36,856 INFO L225 Difference]: With dead ends: 64531 [2019-12-27 00:38:36,856 INFO L226 Difference]: Without dead ends: 64525 [2019-12-27 00:38:36,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:38:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64525 states. [2019-12-27 00:38:37,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64525 to 27590. [2019-12-27 00:38:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 00:38:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-27 00:38:40,766 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-27 00:38:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:40,767 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-27 00:38:40,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:38:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-27 00:38:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:38:40,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:40,767 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:40,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:40,968 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:40,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:40,969 INFO L82 PathProgramCache]: Analyzing trace with hash -90006000, now seen corresponding path program 1 times [2019-12-27 00:38:40,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:40,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678450267] [2019-12-27 00:38:40,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 00:38:41,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678450267] [2019-12-27 00:38:41,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651219014] [2019-12-27 00:38:41,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:41,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:38:41,100 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 00:38:41,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:41,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:38:41,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272384997] [2019-12-27 00:38:41,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:38:41,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:41,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:38:41,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:38:41,156 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 12 states. [2019-12-27 00:38:41,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:41,879 INFO L93 Difference]: Finished difference Result 67092 states and 321768 transitions. [2019-12-27 00:38:41,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:38:41,879 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 00:38:41,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:42,077 INFO L225 Difference]: With dead ends: 67092 [2019-12-27 00:38:42,077 INFO L226 Difference]: Without dead ends: 67083 [2019-12-27 00:38:42,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:38:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67083 states. [2019-12-27 00:38:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67083 to 27791. [2019-12-27 00:38:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27791 states. [2019-12-27 00:38:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27791 states to 27791 states and 150081 transitions. [2019-12-27 00:38:43,134 INFO L78 Accepts]: Start accepts. Automaton has 27791 states and 150081 transitions. Word has length 19 [2019-12-27 00:38:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:43,134 INFO L462 AbstractCegarLoop]: Abstraction has 27791 states and 150081 transitions. [2019-12-27 00:38:43,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:38:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 27791 states and 150081 transitions. [2019-12-27 00:38:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:38:43,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:43,135 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:43,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:43,336 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:43,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:43,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1159551062, now seen corresponding path program 2 times [2019-12-27 00:38:43,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:43,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224553234] [2019-12-27 00:38:43,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:38:43,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224553234] [2019-12-27 00:38:43,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:43,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:38:43,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688574654] [2019-12-27 00:38:43,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:38:43,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:43,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:38:43,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:38:43,374 INFO L87 Difference]: Start difference. First operand 27791 states and 150081 transitions. Second operand 7 states. [2019-12-27 00:38:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:44,031 INFO L93 Difference]: Finished difference Result 68100 states and 326949 transitions. [2019-12-27 00:38:44,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:38:44,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:38:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:44,228 INFO L225 Difference]: With dead ends: 68100 [2019-12-27 00:38:44,228 INFO L226 Difference]: Without dead ends: 68091 [2019-12-27 00:38:44,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:38:44,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68091 states. [2019-12-27 00:38:45,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68091 to 27884. [2019-12-27 00:38:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27884 states. [2019-12-27 00:38:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27884 states to 27884 states and 150616 transitions. [2019-12-27 00:38:45,807 INFO L78 Accepts]: Start accepts. Automaton has 27884 states and 150616 transitions. Word has length 19 [2019-12-27 00:38:45,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:45,807 INFO L462 AbstractCegarLoop]: Abstraction has 27884 states and 150616 transitions. [2019-12-27 00:38:45,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:38:45,807 INFO L276 IsEmpty]: Start isEmpty. Operand 27884 states and 150616 transitions. [2019-12-27 00:38:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:38:45,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:45,808 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:45,808 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:45,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:45,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1159551992, now seen corresponding path program 2 times [2019-12-27 00:38:45,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:45,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614359307] [2019-12-27 00:38:45,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:38:45,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614359307] [2019-12-27 00:38:45,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:38:45,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:38:45,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325336475] [2019-12-27 00:38:45,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:38:45,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:45,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:38:45,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:38:45,849 INFO L87 Difference]: Start difference. First operand 27884 states and 150616 transitions. Second operand 7 states. [2019-12-27 00:38:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:46,478 INFO L93 Difference]: Finished difference Result 67749 states and 324931 transitions. [2019-12-27 00:38:46,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:38:46,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:38:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:46,679 INFO L225 Difference]: With dead ends: 67749 [2019-12-27 00:38:46,679 INFO L226 Difference]: Without dead ends: 67740 [2019-12-27 00:38:46,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:38:46,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67740 states. [2019-12-27 00:38:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67740 to 28053. [2019-12-27 00:38:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-27 00:38:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-27 00:38:47,745 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-27 00:38:47,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:47,745 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-27 00:38:47,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:38:47,745 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-27 00:38:47,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:38:47,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:47,746 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:47,747 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:47,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:47,747 INFO L82 PathProgramCache]: Analyzing trace with hash 113904919, now seen corresponding path program 1 times [2019-12-27 00:38:47,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:47,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931874742] [2019-12-27 00:38:47,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:47,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931874742] [2019-12-27 00:38:47,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487982549] [2019-12-27 00:38:47,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:47,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:38:47,896 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:47,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:47,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:38:47,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335807315] [2019-12-27 00:38:47,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:38:47,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:48,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:38:48,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:38:48,000 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 16 states. [2019-12-27 00:38:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:49,645 INFO L93 Difference]: Finished difference Result 97639 states and 440644 transitions. [2019-12-27 00:38:49,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:49,646 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:38:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:49,917 INFO L225 Difference]: With dead ends: 97639 [2019-12-27 00:38:49,917 INFO L226 Difference]: Without dead ends: 97635 [2019-12-27 00:38:49,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:38:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97635 states. [2019-12-27 00:38:51,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97635 to 27697. [2019-12-27 00:38:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27697 states. [2019-12-27 00:38:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27697 states to 27697 states and 149567 transitions. [2019-12-27 00:38:51,358 INFO L78 Accepts]: Start accepts. Automaton has 27697 states and 149567 transitions. Word has length 21 [2019-12-27 00:38:51,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:51,358 INFO L462 AbstractCegarLoop]: Abstraction has 27697 states and 149567 transitions. [2019-12-27 00:38:51,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:38:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 27697 states and 149567 transitions. [2019-12-27 00:38:51,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:38:51,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:51,359 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:51,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:51,560 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:51,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1363462911, now seen corresponding path program 2 times [2019-12-27 00:38:51,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:51,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613347531] [2019-12-27 00:38:51,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 00:38:51,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613347531] [2019-12-27 00:38:51,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379312011] [2019-12-27 00:38:51,617 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:51,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:38:51,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:38:51,713 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:38:51,714 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 00:38:51,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:51,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:38:51,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589467730] [2019-12-27 00:38:51,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:38:51,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:51,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:38:51,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:38:51,798 INFO L87 Difference]: Start difference. First operand 27697 states and 149567 transitions. Second operand 16 states. [2019-12-27 00:38:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:53,519 INFO L93 Difference]: Finished difference Result 96837 states and 436529 transitions. [2019-12-27 00:38:53,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:53,520 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:38:53,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:53,791 INFO L225 Difference]: With dead ends: 96837 [2019-12-27 00:38:53,791 INFO L226 Difference]: Without dead ends: 96831 [2019-12-27 00:38:53,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:38:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96831 states. [2019-12-27 00:38:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96831 to 27343. [2019-12-27 00:38:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-27 00:38:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-27 00:38:55,165 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-27 00:38:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:55,165 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-27 00:38:55,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:38:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-27 00:38:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:38:55,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:55,166 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:55,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:55,367 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:55,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:55,367 INFO L82 PathProgramCache]: Analyzing trace with hash -596422103, now seen corresponding path program 3 times [2019-12-27 00:38:55,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:55,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064143758] [2019-12-27 00:38:55,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 00:38:55,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064143758] [2019-12-27 00:38:55,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132194522] [2019-12-27 00:38:55,420 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:55,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:38:55,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:38:55,506 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:38:55,507 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 00:38:55,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:55,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:38:55,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212732822] [2019-12-27 00:38:55,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:38:55,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:55,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:38:55,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:38:55,587 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 16 states. [2019-12-27 00:38:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:57,513 INFO L93 Difference]: Finished difference Result 97329 states and 439144 transitions. [2019-12-27 00:38:57,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:38:57,513 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:38:57,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:57,790 INFO L225 Difference]: With dead ends: 97329 [2019-12-27 00:38:57,791 INFO L226 Difference]: Without dead ends: 97325 [2019-12-27 00:38:57,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:38:58,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97325 states. [2019-12-27 00:38:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97325 to 26991. [2019-12-27 00:38:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26991 states. [2019-12-27 00:38:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26991 states to 26991 states and 145461 transitions. [2019-12-27 00:38:59,124 INFO L78 Accepts]: Start accepts. Automaton has 26991 states and 145461 transitions. Word has length 21 [2019-12-27 00:38:59,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:59,124 INFO L462 AbstractCegarLoop]: Abstraction has 26991 states and 145461 transitions. [2019-12-27 00:38:59,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:38:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 26991 states and 145461 transitions. [2019-12-27 00:38:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:38:59,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:59,125 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:59,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:59,326 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:38:59,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:59,327 INFO L82 PathProgramCache]: Analyzing trace with hash -607849943, now seen corresponding path program 4 times [2019-12-27 00:38:59,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:59,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888514212] [2019-12-27 00:38:59,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 00:38:59,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888514212] [2019-12-27 00:38:59,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521735569] [2019-12-27 00:38:59,395 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:59,481 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:38:59,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:38:59,481 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:38:59,482 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 00:38:59,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:59,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:38:59,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059138238] [2019-12-27 00:38:59,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:38:59,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:59,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:38:59,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:38:59,562 INFO L87 Difference]: Start difference. First operand 26991 states and 145461 transitions. Second operand 16 states. [2019-12-27 00:39:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:01,002 INFO L93 Difference]: Finished difference Result 96246 states and 433386 transitions. [2019-12-27 00:39:01,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:01,002 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 00:39:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:01,857 INFO L225 Difference]: With dead ends: 96246 [2019-12-27 00:39:01,858 INFO L226 Difference]: Without dead ends: 96240 [2019-12-27 00:39:01,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96240 states. [2019-12-27 00:39:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96240 to 26339. [2019-12-27 00:39:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26339 states. [2019-12-27 00:39:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26339 states to 26339 states and 142000 transitions. [2019-12-27 00:39:03,155 INFO L78 Accepts]: Start accepts. Automaton has 26339 states and 142000 transitions. Word has length 21 [2019-12-27 00:39:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:03,155 INFO L462 AbstractCegarLoop]: Abstraction has 26339 states and 142000 transitions. [2019-12-27 00:39:03,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 26339 states and 142000 transitions. [2019-12-27 00:39:03,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:39:03,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:03,157 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:03,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:03,357 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:03,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:03,358 INFO L82 PathProgramCache]: Analyzing trace with hash 671564070, now seen corresponding path program 1 times [2019-12-27 00:39:03,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:03,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756049151] [2019-12-27 00:39:03,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:03,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:39:03,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756049151] [2019-12-27 00:39:03,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:39:03,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:39:03,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313771898] [2019-12-27 00:39:03,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:39:03,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:03,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:39:03,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:39:03,388 INFO L87 Difference]: Start difference. First operand 26339 states and 142000 transitions. Second operand 5 states. [2019-12-27 00:39:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:03,742 INFO L93 Difference]: Finished difference Result 47340 states and 243927 transitions. [2019-12-27 00:39:03,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:39:03,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 00:39:03,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:03,884 INFO L225 Difference]: With dead ends: 47340 [2019-12-27 00:39:03,884 INFO L226 Difference]: Without dead ends: 47324 [2019-12-27 00:39:03,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:39:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47324 states. [2019-12-27 00:39:05,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47324 to 32794. [2019-12-27 00:39:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32794 states. [2019-12-27 00:39:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32794 states to 32794 states and 178171 transitions. [2019-12-27 00:39:05,394 INFO L78 Accepts]: Start accepts. Automaton has 32794 states and 178171 transitions. Word has length 21 [2019-12-27 00:39:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:05,394 INFO L462 AbstractCegarLoop]: Abstraction has 32794 states and 178171 transitions. [2019-12-27 00:39:05,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:39:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 32794 states and 178171 transitions. [2019-12-27 00:39:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:39:05,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:05,395 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:05,395 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:05,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:05,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1932039825, now seen corresponding path program 5 times [2019-12-27 00:39:05,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:05,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132898334] [2019-12-27 00:39:05,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:39:05,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132898334] [2019-12-27 00:39:05,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:39:05,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:39:05,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795460849] [2019-12-27 00:39:05,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:39:05,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:05,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:39:05,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:39:05,454 INFO L87 Difference]: Start difference. First operand 32794 states and 178171 transitions. Second operand 9 states. [2019-12-27 00:39:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:06,788 INFO L93 Difference]: Finished difference Result 112140 states and 515003 transitions. [2019-12-27 00:39:06,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:06,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:39:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:07,110 INFO L225 Difference]: With dead ends: 112140 [2019-12-27 00:39:07,110 INFO L226 Difference]: Without dead ends: 112133 [2019-12-27 00:39:07,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:39:07,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112133 states. [2019-12-27 00:39:09,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112133 to 31942. [2019-12-27 00:39:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31942 states. [2019-12-27 00:39:09,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31942 states to 31942 states and 173493 transitions. [2019-12-27 00:39:09,569 INFO L78 Accepts]: Start accepts. Automaton has 31942 states and 173493 transitions. Word has length 21 [2019-12-27 00:39:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:09,570 INFO L462 AbstractCegarLoop]: Abstraction has 31942 states and 173493 transitions. [2019-12-27 00:39:09,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:39:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 31942 states and 173493 transitions. [2019-12-27 00:39:09,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:39:09,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:09,571 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:09,571 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:09,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:09,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1932932625, now seen corresponding path program 6 times [2019-12-27 00:39:09,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:09,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790466530] [2019-12-27 00:39:09,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:39:09,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790466530] [2019-12-27 00:39:09,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:39:09,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:39:09,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112775000] [2019-12-27 00:39:09,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:39:09,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:09,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:39:09,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:39:09,633 INFO L87 Difference]: Start difference. First operand 31942 states and 173493 transitions. Second operand 9 states. [2019-12-27 00:39:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:10,956 INFO L93 Difference]: Finished difference Result 111030 states and 509192 transitions. [2019-12-27 00:39:10,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:10,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:39:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:11,277 INFO L225 Difference]: With dead ends: 111030 [2019-12-27 00:39:11,277 INFO L226 Difference]: Without dead ends: 111020 [2019-12-27 00:39:11,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:39:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111020 states. [2019-12-27 00:39:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111020 to 30899. [2019-12-27 00:39:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-27 00:39:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-27 00:39:13,649 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-27 00:39:13,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:13,649 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-27 00:39:13,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:39:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-27 00:39:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:39:13,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:13,651 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:13,651 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:13,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:13,651 INFO L82 PathProgramCache]: Analyzing trace with hash -938538387, now seen corresponding path program 1 times [2019-12-27 00:39:13,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:13,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580693582] [2019-12-27 00:39:13,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:39:13,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580693582] [2019-12-27 00:39:13,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335649387] [2019-12-27 00:39:13,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:13,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:39:13,780 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:39:13,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:13,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:39:13,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134273460] [2019-12-27 00:39:13,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:39:13,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:13,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:39:13,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:39:13,839 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 12 states. [2019-12-27 00:39:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:14,547 INFO L93 Difference]: Finished difference Result 73073 states and 355163 transitions. [2019-12-27 00:39:14,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:39:14,548 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 00:39:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:14,777 INFO L225 Difference]: With dead ends: 73073 [2019-12-27 00:39:14,778 INFO L226 Difference]: Without dead ends: 73061 [2019-12-27 00:39:14,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:39:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73061 states. [2019-12-27 00:39:15,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73061 to 31876. [2019-12-27 00:39:15,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-27 00:39:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-27 00:39:16,742 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-27 00:39:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:16,742 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-27 00:39:16,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:39:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-27 00:39:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:39:16,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:16,744 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:16,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:16,945 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:16,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:16,946 INFO L82 PathProgramCache]: Analyzing trace with hash -912298617, now seen corresponding path program 1 times [2019-12-27 00:39:16,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:16,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88905636] [2019-12-27 00:39:16,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 00:39:16,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88905636] [2019-12-27 00:39:16,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104150952] [2019-12-27 00:39:16,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:17,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:39:17,104 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 00:39:17,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:17,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:39:17,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724586532] [2019-12-27 00:39:17,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:39:17,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:17,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:39:17,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:39:17,173 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 12 states. [2019-12-27 00:39:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:17,880 INFO L93 Difference]: Finished difference Result 77049 states and 375250 transitions. [2019-12-27 00:39:17,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:39:17,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 00:39:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:18,114 INFO L225 Difference]: With dead ends: 77049 [2019-12-27 00:39:18,115 INFO L226 Difference]: Without dead ends: 77035 [2019-12-27 00:39:18,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:39:18,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77035 states. [2019-12-27 00:39:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77035 to 32848. [2019-12-27 00:39:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32848 states. [2019-12-27 00:39:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32848 states to 32848 states and 178265 transitions. [2019-12-27 00:39:19,355 INFO L78 Accepts]: Start accepts. Automaton has 32848 states and 178265 transitions. Word has length 23 [2019-12-27 00:39:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:19,356 INFO L462 AbstractCegarLoop]: Abstraction has 32848 states and 178265 transitions. [2019-12-27 00:39:19,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:39:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 32848 states and 178265 transitions. [2019-12-27 00:39:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:39:19,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:19,358 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:19,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:19,558 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:19,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:19,560 INFO L82 PathProgramCache]: Analyzing trace with hash 475670957, now seen corresponding path program 1 times [2019-12-27 00:39:19,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:19,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112283394] [2019-12-27 00:39:19,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:39:19,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112283394] [2019-12-27 00:39:19,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966513218] [2019-12-27 00:39:19,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:20,164 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 00:39:20,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:39:20,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:20,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 00:39:20,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667321186] [2019-12-27 00:39:20,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:39:20,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:20,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:39:20,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:39:20,228 INFO L87 Difference]: Start difference. First operand 32848 states and 178265 transitions. Second operand 12 states. [2019-12-27 00:39:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:20,985 INFO L93 Difference]: Finished difference Result 80192 states and 391837 transitions. [2019-12-27 00:39:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:39:20,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 00:39:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:21,238 INFO L225 Difference]: With dead ends: 80192 [2019-12-27 00:39:21,238 INFO L226 Difference]: Without dead ends: 80173 [2019-12-27 00:39:21,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 00:39:21,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80173 states. [2019-12-27 00:39:22,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80173 to 33665. [2019-12-27 00:39:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33665 states. [2019-12-27 00:39:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33665 states to 33665 states and 182914 transitions. [2019-12-27 00:39:22,559 INFO L78 Accepts]: Start accepts. Automaton has 33665 states and 182914 transitions. Word has length 23 [2019-12-27 00:39:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:22,559 INFO L462 AbstractCegarLoop]: Abstraction has 33665 states and 182914 transitions. [2019-12-27 00:39:22,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:39:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 33665 states and 182914 transitions. [2019-12-27 00:39:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:39:22,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:22,561 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:22,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:22,762 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:22,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:22,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1127986751, now seen corresponding path program 2 times [2019-12-27 00:39:22,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:22,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512495736] [2019-12-27 00:39:22,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:39:22,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512495736] [2019-12-27 00:39:22,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:39:22,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:39:22,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272722090] [2019-12-27 00:39:22,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:39:22,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:22,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:39:22,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:39:22,802 INFO L87 Difference]: Start difference. First operand 33665 states and 182914 transitions. Second operand 7 states. [2019-12-27 00:39:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:23,734 INFO L93 Difference]: Finished difference Result 80956 states and 395965 transitions. [2019-12-27 00:39:23,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:39:23,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:39:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:23,986 INFO L225 Difference]: With dead ends: 80956 [2019-12-27 00:39:23,986 INFO L226 Difference]: Without dead ends: 80937 [2019-12-27 00:39:23,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:39:24,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80937 states. [2019-12-27 00:39:25,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80937 to 34532. [2019-12-27 00:39:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34532 states. [2019-12-27 00:39:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34532 states to 34532 states and 187636 transitions. [2019-12-27 00:39:25,291 INFO L78 Accepts]: Start accepts. Automaton has 34532 states and 187636 transitions. Word has length 23 [2019-12-27 00:39:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:25,291 INFO L462 AbstractCegarLoop]: Abstraction has 34532 states and 187636 transitions. [2019-12-27 00:39:25,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:39:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 34532 states and 187636 transitions. [2019-12-27 00:39:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:39:25,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:25,294 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:25,294 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:25,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:25,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1127974847, now seen corresponding path program 2 times [2019-12-27 00:39:25,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:25,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542715885] [2019-12-27 00:39:25,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:39:25,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542715885] [2019-12-27 00:39:25,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:39:25,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:39:25,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948660990] [2019-12-27 00:39:25,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:39:25,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:25,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:39:25,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:39:25,371 INFO L87 Difference]: Start difference. First operand 34532 states and 187636 transitions. Second operand 7 states. [2019-12-27 00:39:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:26,391 INFO L93 Difference]: Finished difference Result 81082 states and 396008 transitions. [2019-12-27 00:39:26,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:39:26,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:39:26,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:26,637 INFO L225 Difference]: With dead ends: 81082 [2019-12-27 00:39:26,637 INFO L226 Difference]: Without dead ends: 81063 [2019-12-27 00:39:26,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:39:26,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81063 states. [2019-12-27 00:39:27,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81063 to 35153. [2019-12-27 00:39:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35153 states. [2019-12-27 00:39:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35153 states to 35153 states and 191087 transitions. [2019-12-27 00:39:27,963 INFO L78 Accepts]: Start accepts. Automaton has 35153 states and 191087 transitions. Word has length 23 [2019-12-27 00:39:27,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:27,963 INFO L462 AbstractCegarLoop]: Abstraction has 35153 states and 191087 transitions. [2019-12-27 00:39:27,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:39:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 35153 states and 191087 transitions. [2019-12-27 00:39:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:39:27,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:27,965 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:27,965 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:27,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:27,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1127975777, now seen corresponding path program 2 times [2019-12-27 00:39:27,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:27,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175328529] [2019-12-27 00:39:27,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:39:28,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175328529] [2019-12-27 00:39:28,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:39:28,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:39:28,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937218424] [2019-12-27 00:39:28,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:39:28,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:28,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:39:28,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:39:28,011 INFO L87 Difference]: Start difference. First operand 35153 states and 191087 transitions. Second operand 7 states. [2019-12-27 00:39:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:29,110 INFO L93 Difference]: Finished difference Result 81506 states and 397808 transitions. [2019-12-27 00:39:29,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:39:29,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:39:29,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:29,365 INFO L225 Difference]: With dead ends: 81506 [2019-12-27 00:39:29,365 INFO L226 Difference]: Without dead ends: 81487 [2019-12-27 00:39:29,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:39:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81487 states. [2019-12-27 00:39:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81487 to 35912. [2019-12-27 00:39:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-27 00:39:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-27 00:39:30,702 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-27 00:39:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:30,702 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-27 00:39:30,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:39:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-27 00:39:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:30,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:30,705 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:30,705 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:30,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2032533234, now seen corresponding path program 1 times [2019-12-27 00:39:30,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:30,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783366383] [2019-12-27 00:39:30,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 00:39:30,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783366383] [2019-12-27 00:39:30,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108465040] [2019-12-27 00:39:30,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:30,855 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:30,855 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 00:39:30,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:30,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:30,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890393905] [2019-12-27 00:39:30,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:30,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:30,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:30,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:30,937 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 16 states. [2019-12-27 00:39:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:32,815 INFO L93 Difference]: Finished difference Result 119601 states and 553012 transitions. [2019-12-27 00:39:32,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:32,815 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:39:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:33,164 INFO L225 Difference]: With dead ends: 119601 [2019-12-27 00:39:33,164 INFO L226 Difference]: Without dead ends: 119591 [2019-12-27 00:39:33,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119591 states. [2019-12-27 00:39:35,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119591 to 35590. [2019-12-27 00:39:35,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35590 states. [2019-12-27 00:39:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35590 states to 35590 states and 193098 transitions. [2019-12-27 00:39:35,624 INFO L78 Accepts]: Start accepts. Automaton has 35590 states and 193098 transitions. Word has length 25 [2019-12-27 00:39:35,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:35,624 INFO L462 AbstractCegarLoop]: Abstraction has 35590 states and 193098 transitions. [2019-12-27 00:39:35,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:35,624 INFO L276 IsEmpty]: Start isEmpty. Operand 35590 states and 193098 transitions. [2019-12-27 00:39:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:35,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:35,627 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:35,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:35,828 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:35,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:35,829 INFO L82 PathProgramCache]: Analyzing trace with hash -644563660, now seen corresponding path program 1 times [2019-12-27 00:39:35,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:35,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22897733] [2019-12-27 00:39:35,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:39:35,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22897733] [2019-12-27 00:39:35,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662115317] [2019-12-27 00:39:35,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:35,996 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:35,996 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 00:39:36,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:36,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:36,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845140324] [2019-12-27 00:39:36,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:36,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:36,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:36,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:36,085 INFO L87 Difference]: Start difference. First operand 35590 states and 193098 transitions. Second operand 16 states. [2019-12-27 00:39:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:37,515 INFO L93 Difference]: Finished difference Result 118371 states and 546721 transitions. [2019-12-27 00:39:37,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:37,515 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:39:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:37,862 INFO L225 Difference]: With dead ends: 118371 [2019-12-27 00:39:37,862 INFO L226 Difference]: Without dead ends: 118361 [2019-12-27 00:39:37,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:38,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118361 states. [2019-12-27 00:39:40,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118361 to 35384. [2019-12-27 00:39:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35384 states. [2019-12-27 00:39:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35384 states to 35384 states and 191757 transitions. [2019-12-27 00:39:40,227 INFO L78 Accepts]: Start accepts. Automaton has 35384 states and 191757 transitions. Word has length 25 [2019-12-27 00:39:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:40,227 INFO L462 AbstractCegarLoop]: Abstraction has 35384 states and 191757 transitions. [2019-12-27 00:39:40,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 35384 states and 191757 transitions. [2019-12-27 00:39:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:40,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:40,231 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:40,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:40,432 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:40,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:40,433 INFO L82 PathProgramCache]: Analyzing trace with hash 7752134, now seen corresponding path program 2 times [2019-12-27 00:39:40,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:40,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067307394] [2019-12-27 00:39:40,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:39:40,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067307394] [2019-12-27 00:39:40,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463222278] [2019-12-27 00:39:40,485 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:40,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:39:40,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:39:40,575 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:40,576 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:39:40,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:40,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:40,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896866305] [2019-12-27 00:39:40,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:40,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:40,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:40,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:40,713 INFO L87 Difference]: Start difference. First operand 35384 states and 191757 transitions. Second operand 16 states. [2019-12-27 00:39:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:42,337 INFO L93 Difference]: Finished difference Result 117247 states and 540902 transitions. [2019-12-27 00:39:42,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:42,338 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:39:42,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:43,342 INFO L225 Difference]: With dead ends: 117247 [2019-12-27 00:39:43,342 INFO L226 Difference]: Without dead ends: 117236 [2019-12-27 00:39:43,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117236 states. [2019-12-27 00:39:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117236 to 35317. [2019-12-27 00:39:44,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35317 states. [2019-12-27 00:39:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35317 states to 35317 states and 191252 transitions. [2019-12-27 00:39:45,029 INFO L78 Accepts]: Start accepts. Automaton has 35317 states and 191252 transitions. Word has length 25 [2019-12-27 00:39:45,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:45,030 INFO L462 AbstractCegarLoop]: Abstraction has 35317 states and 191252 transitions. [2019-12-27 00:39:45,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 35317 states and 191252 transitions. [2019-12-27 00:39:45,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:45,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:45,032 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:45,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:45,233 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:45,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:45,234 INFO L82 PathProgramCache]: Analyzing trace with hash 7741160, now seen corresponding path program 2 times [2019-12-27 00:39:45,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:45,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756927879] [2019-12-27 00:39:45,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:39:45,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756927879] [2019-12-27 00:39:45,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689015383] [2019-12-27 00:39:45,324 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:45,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:39:45,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:39:45,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:45,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:39:45,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:45,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:45,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075276479] [2019-12-27 00:39:45,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:45,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:45,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:45,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:45,533 INFO L87 Difference]: Start difference. First operand 35317 states and 191252 transitions. Second operand 16 states. [2019-12-27 00:39:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:47,273 INFO L93 Difference]: Finished difference Result 116261 states and 536103 transitions. [2019-12-27 00:39:47,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:47,274 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:39:47,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:47,614 INFO L225 Difference]: With dead ends: 116261 [2019-12-27 00:39:47,614 INFO L226 Difference]: Without dead ends: 116250 [2019-12-27 00:39:47,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:47,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116250 states. [2019-12-27 00:39:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116250 to 34934. [2019-12-27 00:39:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-27 00:39:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-27 00:39:50,022 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-27 00:39:50,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:50,023 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-27 00:39:50,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-27 00:39:50,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:50,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:50,025 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:50,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:50,226 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:50,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:50,227 INFO L82 PathProgramCache]: Analyzing trace with hash -545632672, now seen corresponding path program 1 times [2019-12-27 00:39:50,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:50,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793846739] [2019-12-27 00:39:50,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 00:39:50,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793846739] [2019-12-27 00:39:50,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679495928] [2019-12-27 00:39:50,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:50,375 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:50,376 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 00:39:50,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:50,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:50,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416510222] [2019-12-27 00:39:50,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:50,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:50,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:50,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:50,483 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 16 states. [2019-12-27 00:39:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:52,088 INFO L93 Difference]: Finished difference Result 118938 states and 550128 transitions. [2019-12-27 00:39:52,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:52,089 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:39:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:52,445 INFO L225 Difference]: With dead ends: 118938 [2019-12-27 00:39:52,446 INFO L226 Difference]: Without dead ends: 118928 [2019-12-27 00:39:52,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:52,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118928 states. [2019-12-27 00:39:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118928 to 35058. [2019-12-27 00:39:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35058 states. [2019-12-27 00:39:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35058 states to 35058 states and 189558 transitions. [2019-12-27 00:39:54,676 INFO L78 Accepts]: Start accepts. Automaton has 35058 states and 189558 transitions. Word has length 25 [2019-12-27 00:39:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:54,677 INFO L462 AbstractCegarLoop]: Abstraction has 35058 states and 189558 transitions. [2019-12-27 00:39:54,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 35058 states and 189558 transitions. [2019-12-27 00:39:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:54,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:54,679 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:54,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:54,880 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:54,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:54,880 INFO L82 PathProgramCache]: Analyzing trace with hash -545644576, now seen corresponding path program 3 times [2019-12-27 00:39:54,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:54,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494699050] [2019-12-27 00:39:54,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 00:39:54,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494699050] [2019-12-27 00:39:54,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496572570] [2019-12-27 00:39:54,938 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:55,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 00:39:55,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:39:55,025 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:55,026 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 00:39:55,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:55,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:55,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170084761] [2019-12-27 00:39:55,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:55,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:55,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:55,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:55,112 INFO L87 Difference]: Start difference. First operand 35058 states and 189558 transitions. Second operand 16 states. [2019-12-27 00:39:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:39:57,035 INFO L93 Difference]: Finished difference Result 117535 states and 542555 transitions. [2019-12-27 00:39:57,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:39:57,036 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:39:57,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:39:57,355 INFO L225 Difference]: With dead ends: 117535 [2019-12-27 00:39:57,355 INFO L226 Difference]: Without dead ends: 117525 [2019-12-27 00:39:57,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:39:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117525 states. [2019-12-27 00:39:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117525 to 34750. [2019-12-27 00:39:58,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34750 states. [2019-12-27 00:39:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34750 states to 34750 states and 187700 transitions. [2019-12-27 00:39:58,852 INFO L78 Accepts]: Start accepts. Automaton has 34750 states and 187700 transitions. Word has length 25 [2019-12-27 00:39:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:39:58,852 INFO L462 AbstractCegarLoop]: Abstraction has 34750 states and 187700 transitions. [2019-12-27 00:39:58,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:39:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 34750 states and 187700 transitions. [2019-12-27 00:39:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:39:58,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:39:58,854 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:39:59,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:59,055 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:39:59,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:39:59,056 INFO L82 PathProgramCache]: Analyzing trace with hash -530395552, now seen corresponding path program 2 times [2019-12-27 00:39:59,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:39:59,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949040711] [2019-12-27 00:39:59,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:39:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:39:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 00:39:59,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949040711] [2019-12-27 00:39:59,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239825920] [2019-12-27 00:39:59,110 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:39:59,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:39:59,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:39:59,196 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:39:59,197 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:39:59,629 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-27 00:39:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 00:39:59,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:39:59,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:39:59,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103901174] [2019-12-27 00:39:59,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:39:59,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:39:59,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:39:59,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:39:59,695 INFO L87 Difference]: Start difference. First operand 34750 states and 187700 transitions. Second operand 16 states. [2019-12-27 00:40:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:01,051 INFO L93 Difference]: Finished difference Result 117014 states and 540604 transitions. [2019-12-27 00:40:01,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:01,051 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:40:01,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:01,374 INFO L225 Difference]: With dead ends: 117014 [2019-12-27 00:40:01,374 INFO L226 Difference]: Without dead ends: 117000 [2019-12-27 00:40:01,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:40:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117000 states. [2019-12-27 00:40:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117000 to 34277. [2019-12-27 00:40:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34277 states. [2019-12-27 00:40:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34277 states to 34277 states and 184965 transitions. [2019-12-27 00:40:03,482 INFO L78 Accepts]: Start accepts. Automaton has 34277 states and 184965 transitions. Word has length 25 [2019-12-27 00:40:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:03,482 INFO L462 AbstractCegarLoop]: Abstraction has 34277 states and 184965 transitions. [2019-12-27 00:40:03,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:40:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 34277 states and 184965 transitions. [2019-12-27 00:40:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:03,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:03,485 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:40:03,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:03,685 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:40:03,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:03,686 INFO L82 PathProgramCache]: Analyzing trace with hash -541835296, now seen corresponding path program 4 times [2019-12-27 00:40:03,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:03,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696236618] [2019-12-27 00:40:03,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 00:40:03,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696236618] [2019-12-27 00:40:03,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010714468] [2019-12-27 00:40:03,757 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:03,844 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:40:03,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:40:03,847 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:40:03,847 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:40:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 00:40:03,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:40:03,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:40:03,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985000934] [2019-12-27 00:40:03,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:40:03,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:03,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:40:03,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:40:03,919 INFO L87 Difference]: Start difference. First operand 34277 states and 184965 transitions. Second operand 16 states. [2019-12-27 00:40:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:05,449 INFO L93 Difference]: Finished difference Result 113272 states and 520858 transitions. [2019-12-27 00:40:05,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:05,449 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:40:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:05,751 INFO L225 Difference]: With dead ends: 113272 [2019-12-27 00:40:05,751 INFO L226 Difference]: Without dead ends: 113261 [2019-12-27 00:40:05,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:40:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113261 states. [2019-12-27 00:40:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113261 to 33768. [2019-12-27 00:40:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-27 00:40:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182281 transitions. [2019-12-27 00:40:07,764 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182281 transitions. Word has length 25 [2019-12-27 00:40:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:07,765 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182281 transitions. [2019-12-27 00:40:07,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:40:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182281 transitions. [2019-12-27 00:40:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:07,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:07,767 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:40:07,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:07,971 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:40:07,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:07,971 INFO L82 PathProgramCache]: Analyzing trace with hash -298046732, now seen corresponding path program 3 times [2019-12-27 00:40:07,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:07,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675734403] [2019-12-27 00:40:07,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:40:08,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675734403] [2019-12-27 00:40:08,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717034811] [2019-12-27 00:40:08,031 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:08,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:40:08,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:40:08,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:40:08,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:40:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:40:08,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:40:08,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:40:08,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381134190] [2019-12-27 00:40:08,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:40:08,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:08,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:40:08,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:40:08,197 INFO L87 Difference]: Start difference. First operand 33768 states and 182281 transitions. Second operand 16 states. [2019-12-27 00:40:10,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:10,039 INFO L93 Difference]: Finished difference Result 115987 states and 535173 transitions. [2019-12-27 00:40:10,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:10,040 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:40:10,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:10,354 INFO L225 Difference]: With dead ends: 115987 [2019-12-27 00:40:10,354 INFO L226 Difference]: Without dead ends: 115977 [2019-12-27 00:40:10,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:40:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115977 states. [2019-12-27 00:40:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115977 to 33338. [2019-12-27 00:40:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33338 states. [2019-12-27 00:40:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33338 states to 33338 states and 179968 transitions. [2019-12-27 00:40:11,825 INFO L78 Accepts]: Start accepts. Automaton has 33338 states and 179968 transitions. Word has length 25 [2019-12-27 00:40:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:11,825 INFO L462 AbstractCegarLoop]: Abstraction has 33338 states and 179968 transitions. [2019-12-27 00:40:11,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:40:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 33338 states and 179968 transitions. [2019-12-27 00:40:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:11,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:11,828 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:40:12,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:12,028 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:40:12,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:12,029 INFO L82 PathProgramCache]: Analyzing trace with hash 591228706, now seen corresponding path program 3 times [2019-12-27 00:40:12,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:12,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663102318] [2019-12-27 00:40:12,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:40:12,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663102318] [2019-12-27 00:40:12,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546517296] [2019-12-27 00:40:12,086 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:12,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:40:12,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:40:12,167 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:40:12,167 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:40:12,655 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-27 00:40:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:40:12,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:40:12,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:40:12,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108029445] [2019-12-27 00:40:12,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:40:12,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:12,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:40:12,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:40:12,670 INFO L87 Difference]: Start difference. First operand 33338 states and 179968 transitions. Second operand 16 states. [2019-12-27 00:40:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:14,084 INFO L93 Difference]: Finished difference Result 115083 states and 530519 transitions. [2019-12-27 00:40:14,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:14,084 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:40:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:14,399 INFO L225 Difference]: With dead ends: 115083 [2019-12-27 00:40:14,399 INFO L226 Difference]: Without dead ends: 115073 [2019-12-27 00:40:14,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:40:14,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115073 states. [2019-12-27 00:40:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115073 to 33016. [2019-12-27 00:40:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33016 states. [2019-12-27 00:40:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33016 states to 33016 states and 178303 transitions. [2019-12-27 00:40:16,452 INFO L78 Accepts]: Start accepts. Automaton has 33016 states and 178303 transitions. Word has length 25 [2019-12-27 00:40:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:16,452 INFO L462 AbstractCegarLoop]: Abstraction has 33016 states and 178303 transitions. [2019-12-27 00:40:16,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:40:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 33016 states and 178303 transitions. [2019-12-27 00:40:16,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:16,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:16,455 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:40:16,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:16,656 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:40:16,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:16,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1853254278, now seen corresponding path program 4 times [2019-12-27 00:40:16,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:16,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564574067] [2019-12-27 00:40:16,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:40:16,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564574067] [2019-12-27 00:40:16,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414439319] [2019-12-27 00:40:16,706 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:16,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:40:16,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:40:16,792 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:40:16,792 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:40:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:40:16,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:40:16,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:40:16,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720171540] [2019-12-27 00:40:16,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:40:16,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:16,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:40:16,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:40:16,871 INFO L87 Difference]: Start difference. First operand 33016 states and 178303 transitions. Second operand 16 states. [2019-12-27 00:40:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:18,289 INFO L93 Difference]: Finished difference Result 116129 states and 535807 transitions. [2019-12-27 00:40:18,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:18,289 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:40:18,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:18,602 INFO L225 Difference]: With dead ends: 116129 [2019-12-27 00:40:18,603 INFO L226 Difference]: Without dead ends: 116115 [2019-12-27 00:40:18,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:40:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116115 states. [2019-12-27 00:40:20,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116115 to 32873. [2019-12-27 00:40:20,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32873 states. [2019-12-27 00:40:20,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32873 states to 32873 states and 177431 transitions. [2019-12-27 00:40:20,654 INFO L78 Accepts]: Start accepts. Automaton has 32873 states and 177431 transitions. Word has length 25 [2019-12-27 00:40:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:20,654 INFO L462 AbstractCegarLoop]: Abstraction has 32873 states and 177431 transitions. [2019-12-27 00:40:20,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:40:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 32873 states and 177431 transitions. [2019-12-27 00:40:20,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:20,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:20,656 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:40:20,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:20,857 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:40:20,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:20,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1853255208, now seen corresponding path program 4 times [2019-12-27 00:40:20,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:20,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233120799] [2019-12-27 00:40:20,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:40:20,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233120799] [2019-12-27 00:40:20,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429578970] [2019-12-27 00:40:20,920 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:21,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:40:21,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:40:21,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 00:40:21,008 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:40:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:40:21,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:40:21,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 00:40:21,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766953295] [2019-12-27 00:40:21,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:40:21,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:21,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:40:21,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:40:21,103 INFO L87 Difference]: Start difference. First operand 32873 states and 177431 transitions. Second operand 16 states. [2019-12-27 00:40:22,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:22,617 INFO L93 Difference]: Finished difference Result 115140 states and 530994 transitions. [2019-12-27 00:40:22,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:22,617 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 00:40:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:23,549 INFO L225 Difference]: With dead ends: 115140 [2019-12-27 00:40:23,549 INFO L226 Difference]: Without dead ends: 115126 [2019-12-27 00:40:23,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 00:40:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115126 states. [2019-12-27 00:40:24,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115126 to 32414. [2019-12-27 00:40:24,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32414 states. [2019-12-27 00:40:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32414 states to 32414 states and 174844 transitions. [2019-12-27 00:40:24,921 INFO L78 Accepts]: Start accepts. Automaton has 32414 states and 174844 transitions. Word has length 25 [2019-12-27 00:40:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:24,921 INFO L462 AbstractCegarLoop]: Abstraction has 32414 states and 174844 transitions. [2019-12-27 00:40:24,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:40:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 32414 states and 174844 transitions. [2019-12-27 00:40:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:24,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:24,924 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:40:25,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:40:25,125 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:40:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:25,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2130118454, now seen corresponding path program 1 times [2019-12-27 00:40:25,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:25,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355323770] [2019-12-27 00:40:25,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-27 00:40:25,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355323770] [2019-12-27 00:40:25,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:40:25,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:40:25,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645758617] [2019-12-27 00:40:25,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:40:25,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:25,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:40:25,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:40:25,167 INFO L87 Difference]: Start difference. First operand 32414 states and 174844 transitions. Second operand 5 states. [2019-12-27 00:40:25,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:25,537 INFO L93 Difference]: Finished difference Result 57346 states and 297742 transitions. [2019-12-27 00:40:25,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:40:25,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 00:40:25,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:25,697 INFO L225 Difference]: With dead ends: 57346 [2019-12-27 00:40:25,697 INFO L226 Difference]: Without dead ends: 57314 [2019-12-27 00:40:25,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:40:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57314 states. [2019-12-27 00:40:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57314 to 40877. [2019-12-27 00:40:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40877 states. [2019-12-27 00:40:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40877 states to 40877 states and 221122 transitions. [2019-12-27 00:40:27,116 INFO L78 Accepts]: Start accepts. Automaton has 40877 states and 221122 transitions. Word has length 25 [2019-12-27 00:40:27,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:27,116 INFO L462 AbstractCegarLoop]: Abstraction has 40877 states and 221122 transitions. [2019-12-27 00:40:27,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:40:27,116 INFO L276 IsEmpty]: Start isEmpty. Operand 40877 states and 221122 transitions. [2019-12-27 00:40:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:27,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:27,119 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:40:27,119 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:40:27,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:27,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1663507096, now seen corresponding path program 5 times [2019-12-27 00:40:27,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:27,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294402775] [2019-12-27 00:40:27,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:40:27,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294402775] [2019-12-27 00:40:27,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:40:27,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:40:27,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240351036] [2019-12-27 00:40:27,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:40:27,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:27,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:40:27,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:40:27,175 INFO L87 Difference]: Start difference. First operand 40877 states and 221122 transitions. Second operand 9 states. [2019-12-27 00:40:28,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:28,613 INFO L93 Difference]: Finished difference Result 137111 states and 643211 transitions. [2019-12-27 00:40:28,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:28,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:40:28,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:29,759 INFO L225 Difference]: With dead ends: 137111 [2019-12-27 00:40:29,760 INFO L226 Difference]: Without dead ends: 137095 [2019-12-27 00:40:29,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:40:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137095 states. [2019-12-27 00:40:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137095 to 40351. [2019-12-27 00:40:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40351 states. [2019-12-27 00:40:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40351 states to 40351 states and 218114 transitions. [2019-12-27 00:40:31,462 INFO L78 Accepts]: Start accepts. Automaton has 40351 states and 218114 transitions. Word has length 25 [2019-12-27 00:40:31,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:31,463 INFO L462 AbstractCegarLoop]: Abstraction has 40351 states and 218114 transitions. [2019-12-27 00:40:31,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:40:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 40351 states and 218114 transitions. [2019-12-27 00:40:31,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:31,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:31,465 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:40:31,465 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:40:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:31,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1663508026, now seen corresponding path program 5 times [2019-12-27 00:40:31,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:31,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767031397] [2019-12-27 00:40:31,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:40:31,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767031397] [2019-12-27 00:40:31,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:40:31,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:40:31,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109974594] [2019-12-27 00:40:31,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:40:31,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:31,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:40:31,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:40:31,539 INFO L87 Difference]: Start difference. First operand 40351 states and 218114 transitions. Second operand 9 states. [2019-12-27 00:40:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:33,361 INFO L93 Difference]: Finished difference Result 135413 states and 634564 transitions. [2019-12-27 00:40:33,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:33,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:40:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:33,741 INFO L225 Difference]: With dead ends: 135413 [2019-12-27 00:40:33,742 INFO L226 Difference]: Without dead ends: 135397 [2019-12-27 00:40:33,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:40:34,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135397 states. [2019-12-27 00:40:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135397 to 39763. [2019-12-27 00:40:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39763 states. [2019-12-27 00:40:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39763 states to 39763 states and 214832 transitions. [2019-12-27 00:40:39,101 INFO L78 Accepts]: Start accepts. Automaton has 39763 states and 214832 transitions. Word has length 25 [2019-12-27 00:40:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:39,101 INFO L462 AbstractCegarLoop]: Abstraction has 39763 states and 214832 transitions. [2019-12-27 00:40:39,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:40:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 39763 states and 214832 transitions. [2019-12-27 00:40:39,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:39,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:39,104 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:40:39,104 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:40:39,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:39,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1652079256, now seen corresponding path program 6 times [2019-12-27 00:40:39,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:39,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580944891] [2019-12-27 00:40:39,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:40:39,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580944891] [2019-12-27 00:40:39,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:40:39,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:40:39,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003481448] [2019-12-27 00:40:39,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:40:39,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:39,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:40:39,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:40:39,166 INFO L87 Difference]: Start difference. First operand 39763 states and 214832 transitions. Second operand 9 states. [2019-12-27 00:40:40,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:40,532 INFO L93 Difference]: Finished difference Result 134367 states and 628945 transitions. [2019-12-27 00:40:40,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:40,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:40:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:40,904 INFO L225 Difference]: With dead ends: 134367 [2019-12-27 00:40:40,904 INFO L226 Difference]: Without dead ends: 134347 [2019-12-27 00:40:40,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:40:41,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134347 states. [2019-12-27 00:40:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134347 to 38738. [2019-12-27 00:40:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38738 states. [2019-12-27 00:40:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38738 states to 38738 states and 209215 transitions. [2019-12-27 00:40:43,327 INFO L78 Accepts]: Start accepts. Automaton has 38738 states and 209215 transitions. Word has length 25 [2019-12-27 00:40:43,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:43,328 INFO L462 AbstractCegarLoop]: Abstraction has 38738 states and 209215 transitions. [2019-12-27 00:40:43,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:40:43,328 INFO L276 IsEmpty]: Start isEmpty. Operand 38738 states and 209215 transitions. [2019-12-27 00:40:43,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:43,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:43,330 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:40:43,330 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:40:43,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:43,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1652068282, now seen corresponding path program 5 times [2019-12-27 00:40:43,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:43,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707765100] [2019-12-27 00:40:43,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:40:43,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707765100] [2019-12-27 00:40:43,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:40:43,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:40:43,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464820464] [2019-12-27 00:40:43,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:40:43,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:43,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:40:43,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:40:43,389 INFO L87 Difference]: Start difference. First operand 38738 states and 209215 transitions. Second operand 9 states. [2019-12-27 00:40:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:40:44,754 INFO L93 Difference]: Finished difference Result 133134 states and 622505 transitions. [2019-12-27 00:40:44,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:44,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:40:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:40:48,203 INFO L225 Difference]: With dead ends: 133134 [2019-12-27 00:40:48,203 INFO L226 Difference]: Without dead ends: 133118 [2019-12-27 00:40:48,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:40:48,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133118 states. [2019-12-27 00:40:49,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133118 to 38374. [2019-12-27 00:40:49,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38374 states. [2019-12-27 00:40:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38374 states to 38374 states and 207228 transitions. [2019-12-27 00:40:49,842 INFO L78 Accepts]: Start accepts. Automaton has 38374 states and 207228 transitions. Word has length 25 [2019-12-27 00:40:49,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:40:49,842 INFO L462 AbstractCegarLoop]: Abstraction has 38374 states and 207228 transitions. [2019-12-27 00:40:49,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:40:49,842 INFO L276 IsEmpty]: Start isEmpty. Operand 38374 states and 207228 transitions. [2019-12-27 00:40:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:40:49,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:40:49,845 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:40:49,845 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:40:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:40:49,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1652972986, now seen corresponding path program 6 times [2019-12-27 00:40:49,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:40:49,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507150789] [2019-12-27 00:40:49,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:40:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:40:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:40:49,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507150789] [2019-12-27 00:40:49,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:40:49,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:40:49,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812997131] [2019-12-27 00:40:49,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:40:49,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:40:49,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:40:49,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:40:49,907 INFO L87 Difference]: Start difference. First operand 38374 states and 207228 transitions. Second operand 9 states. Received shutdown request... [2019-12-27 00:40:51,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:40:51,333 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 00:40:51,338 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 00:40:51,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:40:51 BasicIcfg [2019-12-27 00:40:51,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:40:51,339 INFO L168 Benchmark]: Toolchain (without parser) took 232845.47 ms. Allocated memory was 136.3 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 99.5 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 00:40:51,339 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 136.3 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 00:40:51,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 673.63 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 99.0 MB in the beginning and 160.8 MB in the end (delta: -61.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:40:51,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.91 ms. Allocated memory is still 201.3 MB. Free memory was 160.8 MB in the beginning and 158.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:40:51,340 INFO L168 Benchmark]: Boogie Preprocessor took 26.66 ms. Allocated memory is still 201.3 MB. Free memory was 158.8 MB in the beginning and 156.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:40:51,340 INFO L168 Benchmark]: RCFGBuilder took 432.29 ms. Allocated memory is still 201.3 MB. Free memory was 156.8 MB in the beginning and 137.6 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2019-12-27 00:40:51,341 INFO L168 Benchmark]: TraceAbstraction took 231652.57 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 137.6 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 00:40:51,342 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 136.3 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 673.63 ms. Allocated memory was 136.3 MB in the beginning and 201.3 MB in the end (delta: 65.0 MB). Free memory was 99.0 MB in the beginning and 160.8 MB in the end (delta: -61.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.91 ms. Allocated memory is still 201.3 MB. Free memory was 160.8 MB in the beginning and 158.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.66 ms. Allocated memory is still 201.3 MB. Free memory was 158.8 MB in the beginning and 156.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 432.29 ms. Allocated memory is still 201.3 MB. Free memory was 156.8 MB in the beginning and 137.6 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 231652.57 ms. Allocated memory was 201.3 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 137.6 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 57 ProgramPointsBefore, 15 ProgramPointsAfterwards, 53 TransitionsBefore, 12 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 6 FixpointIterations, 17 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 326 VarBasedMoverChecksPositive, 3 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 3 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 489 CheckedPairsTotal, 46 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 516 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 15 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1034 CheckedPairsTotal, 57 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 95 ProgramPointsBefore, 34 ProgramPointsAfterwards, 85 TransitionsBefore, 27 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 4 ChoiceCompositions, 625 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1615 CheckedPairsTotal, 69 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 114 ProgramPointsBefore, 42 ProgramPointsAfterwards, 101 TransitionsBefore, 33 TransitionsAfterwards, 1756 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 4 ConcurrentYvCompositions, 5 ChoiceCompositions, 851 VarBasedMoverChecksPositive, 17 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2111 CheckedPairsTotal, 84 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 133 ProgramPointsBefore, 50 ProgramPointsAfterwards, 117 TransitionsBefore, 39 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 3 ConcurrentYvCompositions, 6 ChoiceCompositions, 1089 VarBasedMoverChecksPositive, 20 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2604 CheckedPairsTotal, 97 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.5s, 152 ProgramPointsBefore, 58 ProgramPointsAfterwards, 133 TransitionsBefore, 45 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 62 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1357 VarBasedMoverChecksPositive, 25 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 27 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3471 CheckedPairsTotal, 112 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 675). Cancelled while BasicCegarLoop was constructing difference of abstraction (38374states) and FLOYD_HOARE automaton (currently 29 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (65197 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. Result: TIMEOUT, OverallTime: 150.9s, OverallIterations: 41, TraceHistogramMax: 5, AutomataDifference: 63.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2562 SDtfs, 12424 SDslu, 10191 SDs, 0 SdLazy, 18462 SolverSat, 1002 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1356 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 1014 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7339 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40877occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 72.4s AutomataMinimizationTime, 40 MinimizatonAttempts, 2371707 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1389 NumberOfCodeBlocks, 1365 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 1326 ConstructedInterpolants, 0 QuantifiedInterpolants, 192220 SizeOfPredicates, 120 NumberOfNonLiveVariables, 2460 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 63 InterpolantComputations, 19 PerfectInterpolantSequences, 502/878 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown