/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-c7e336b [2020-10-05 23:01:39,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:01:39,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:01:39,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:01:39,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:01:39,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:01:39,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:01:39,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:01:39,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:01:39,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:01:39,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:01:39,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:01:39,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:01:39,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:01:39,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:01:39,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:01:39,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:01:39,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:01:39,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:01:39,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:01:39,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:01:39,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:01:39,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:01:39,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:01:39,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:01:39,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:01:39,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:01:39,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:01:39,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:01:39,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:01:39,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:01:39,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:01:39,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:01:39,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:01:39,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:01:39,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:01:39,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:01:39,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:01:39,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:01:39,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:01:39,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:01:39,363 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 [2020-10-05 23:01:39,402 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:01:39,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:01:39,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:01:39,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:01:39,404 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:01:39,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:01:39,405 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:01:39,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:01:39,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:01:39,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:01:39,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:01:39,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:01:39,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:01:39,407 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:01:39,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:01:39,408 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:01:39,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:01:39,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:01:39,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:01:39,408 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:01:39,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:01:39,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:01:39,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:01:39,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-05 23:01:39,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:01:39,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:01:39,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:01:39,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:01:39,410 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-05 23:01:39,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-05 23:01:39,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:01:39,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:01:39,693 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:01:39,694 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:01:39,695 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:01:39,695 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2020-10-05 23:01:39,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276ef2b28/43001c7170954192b2bd0be74ebaa153/FLAG43d00f605 [2020-10-05 23:01:40,278 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:01:40,279 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2020-10-05 23:01:40,291 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276ef2b28/43001c7170954192b2bd0be74ebaa153/FLAG43d00f605 [2020-10-05 23:01:40,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/276ef2b28/43001c7170954192b2bd0be74ebaa153 [2020-10-05 23:01:40,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:01:40,593 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:01:40,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:01:40,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:01:40,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:01:40,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:01:40" (1/1) ... [2020-10-05 23:01:40,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a17452d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:01:40, skipping insertion in model container [2020-10-05 23:01:40,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:01:40" (1/1) ... [2020-10-05 23:01:40,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:01:40,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:01:41,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:01:41,110 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:01:41,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:01:41,259 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:01:41,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:01:41 WrapperNode [2020-10-05 23:01:41,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:01:41,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:01:41,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:01:41,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:01:41,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:01:41" (1/1) ... [2020-10-05 23:01:41,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:01:41" (1/1) ... [2020-10-05 23:01:41,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:01:41,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:01:41,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:01:41,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:01:41,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:01:41" (1/1) ... [2020-10-05 23:01:41,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:01:41" (1/1) ... [2020-10-05 23:01:41,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:01:41" (1/1) ... [2020-10-05 23:01:41,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:01:41" (1/1) ... [2020-10-05 23:01:41,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:01:41" (1/1) ... [2020-10-05 23:01:41,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:01:41" (1/1) ... [2020-10-05 23:01:41,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:01:41" (1/1) ... [2020-10-05 23:01:41,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:01:41,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:01:41,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:01:41,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:01:41,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:01:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:01:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-10-05 23:01:41,397 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-10-05 23:01:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-10-05 23:01:41,398 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-10-05 23:01:41,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:01:41,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:01:41,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:01:41,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:01:41,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:01:41,400 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:01:41,675 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:01:41,676 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-05 23:01:41,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:01:41 BoogieIcfgContainer [2020-10-05 23:01:41,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:01:41,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:01:41,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:01:41,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:01:41,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:01:40" (1/3) ... [2020-10-05 23:01:41,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb152f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:01:41, skipping insertion in model container [2020-10-05 23:01:41,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:01:41" (2/3) ... [2020-10-05 23:01:41,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb152f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:01:41, skipping insertion in model container [2020-10-05 23:01:41,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:01:41" (3/3) ... [2020-10-05 23:01:41,686 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-2.i [2020-10-05 23:01:41,697 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:01:41,698 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:01:41,706 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-05 23:01:41,707 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:01:41,737 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,738 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,738 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,738 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,739 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,739 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,739 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,747 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,747 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,748 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,748 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,748 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,756 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:41,794 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-05 23:01:41,810 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:01:41,811 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:01:41,811 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 23:01:41,811 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:01:41,811 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:01:41,811 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:01:41,811 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:01:41,812 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:01:41,825 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 58 transitions, 126 flow [2020-10-05 23:01:41,827 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 126 flow [2020-10-05 23:01:41,873 INFO L129 PetriNetUnfolder]: 4/68 cut-off events. [2020-10-05 23:01:41,874 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:01:41,880 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 68 events. 4/68 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 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2020-10-05 23:01:41,882 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 126 flow [2020-10-05 23:01:41,909 INFO L129 PetriNetUnfolder]: 4/68 cut-off events. [2020-10-05 23:01:41,909 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:01:41,910 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 68 events. 4/68 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 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2020-10-05 23:01:41,913 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 592 [2020-10-05 23:01:41,914 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 23:01:43,259 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-10-05 23:01:43,480 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2020-10-05 23:01:43,552 INFO L206 etLargeBlockEncoding]: Checked pairs total: 486 [2020-10-05 23:01:43,553 INFO L214 etLargeBlockEncoding]: Total number of compositions: 51 [2020-10-05 23:01:43,557 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-10-05 23:01:43,568 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-10-05 23:01:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-10-05 23:01:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:01:43,576 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:43,577 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:01:43,577 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash 229686, now seen corresponding path program 1 times [2020-10-05 23:01:43,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:43,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867379537] [2020-10-05 23:01:43,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:43,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867379537] [2020-10-05 23:01:43,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:43,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:01:43,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275445881] [2020-10-05 23:01:43,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:01:43,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:43,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:01:43,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:01:43,795 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-10-05 23:01:43,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:43,829 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-10-05 23:01:43,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:01:43,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:01:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:43,839 INFO L225 Difference]: With dead ends: 35 [2020-10-05 23:01:43,840 INFO L226 Difference]: Without dead ends: 31 [2020-10-05 23:01:43,841 INFO L675 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 [2020-10-05 23:01:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-05 23:01:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-05 23:01:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-05 23:01:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-10-05 23:01:43,873 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-10-05 23:01:43,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:43,873 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-10-05 23:01:43,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:01:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-10-05 23:01:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:01:43,874 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:43,874 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:43,875 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:01:43,875 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:43,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:43,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1647647331, now seen corresponding path program 1 times [2020-10-05 23:01:43,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:43,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77815341] [2020-10-05 23:01:43,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:43,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77815341] [2020-10-05 23:01:43,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:43,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:01:43,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833502698] [2020-10-05 23:01:43,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:01:43,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:43,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:01:43,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:01:43,949 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2020-10-05 23:01:43,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:43,967 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-10-05 23:01:43,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:01:43,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-10-05 23:01:43,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:43,969 INFO L225 Difference]: With dead ends: 26 [2020-10-05 23:01:43,969 INFO L226 Difference]: Without dead ends: 24 [2020-10-05 23:01:43,970 INFO L675 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 [2020-10-05 23:01:43,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-05 23:01:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-05 23:01:43,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-05 23:01:43,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-10-05 23:01:43,975 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-10-05 23:01:43,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:43,975 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-10-05 23:01:43,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:01:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-10-05 23:01:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-05 23:01:43,976 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:43,976 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:43,977 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:01:43,977 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:43,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:43,977 INFO L82 PathProgramCache]: Analyzing trace with hash -462538936, now seen corresponding path program 1 times [2020-10-05 23:01:43,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:43,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099380342] [2020-10-05 23:01:43,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:01:44,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:01:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:01:44,035 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:01:44,071 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:01:44,071 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:01:44,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:01:44,071 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:01:44,072 WARN L363 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:01:44,073 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-10-05 23:01:44,091 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,091 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,092 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,092 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,093 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,093 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,094 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,095 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,096 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,096 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,096 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,096 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,096 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,097 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,097 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,097 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,098 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,098 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,099 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,099 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,100 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,103 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,104 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,104 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,104 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,104 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,104 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,109 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,109 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,109 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,110 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,110 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,115 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,116 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,116 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,120 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,121 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,121 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:44,123 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-05 23:01:44,124 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:01:44,124 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:01:44,124 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 23:01:44,124 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:01:44,124 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:01:44,124 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:01:44,124 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:01:44,124 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:01:44,129 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 74 transitions, 172 flow [2020-10-05 23:01:44,130 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 74 transitions, 172 flow [2020-10-05 23:01:44,166 INFO L129 PetriNetUnfolder]: 5/89 cut-off events. [2020-10-05 23:01:44,166 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-05 23:01:44,169 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 89 events. 5/89 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 98. Up to 6 conditions per place. [2020-10-05 23:01:44,173 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 74 transitions, 172 flow [2020-10-05 23:01:44,199 INFO L129 PetriNetUnfolder]: 5/89 cut-off events. [2020-10-05 23:01:44,200 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-05 23:01:44,201 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 89 events. 5/89 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 98. Up to 6 conditions per place. [2020-10-05 23:01:44,202 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 920 [2020-10-05 23:01:44,203 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 23:01:45,585 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-05 23:01:45,708 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-05 23:01:45,715 INFO L206 etLargeBlockEncoding]: Checked pairs total: 942 [2020-10-05 23:01:45,715 INFO L214 etLargeBlockEncoding]: Total number of compositions: 62 [2020-10-05 23:01:45,715 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 21 transitions, 66 flow [2020-10-05 23:01:45,727 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2020-10-05 23:01:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2020-10-05 23:01:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:01:45,728 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:45,728 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:01:45,728 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:01:45,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:45,729 INFO L82 PathProgramCache]: Analyzing trace with hash 384194, now seen corresponding path program 1 times [2020-10-05 23:01:45,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:45,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961180128] [2020-10-05 23:01:45,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:45,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961180128] [2020-10-05 23:01:45,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:45,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:01:45,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953003395] [2020-10-05 23:01:45,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:01:45,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:45,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:01:45,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:01:45,803 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2020-10-05 23:01:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:45,837 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2020-10-05 23:01:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:01:45,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:01:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:45,842 INFO L225 Difference]: With dead ends: 185 [2020-10-05 23:01:45,842 INFO L226 Difference]: Without dead ends: 171 [2020-10-05 23:01:45,843 INFO L675 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 [2020-10-05 23:01:45,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-10-05 23:01:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-10-05 23:01:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-05 23:01:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 418 transitions. [2020-10-05 23:01:45,871 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 418 transitions. Word has length 3 [2020-10-05 23:01:45,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:45,871 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 418 transitions. [2020-10-05 23:01:45,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:01:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 418 transitions. [2020-10-05 23:01:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:01:45,873 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:45,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:45,873 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:01:45,873 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:01:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1694917346, now seen corresponding path program 1 times [2020-10-05 23:01:45,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:45,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449505074] [2020-10-05 23:01:45,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:45,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449505074] [2020-10-05 23:01:45,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:45,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:01:45,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025825229] [2020-10-05 23:01:45,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:01:45,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:45,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:01:45,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:01:45,931 INFO L87 Difference]: Start difference. First operand 171 states and 418 transitions. Second operand 5 states. [2020-10-05 23:01:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:46,010 INFO L93 Difference]: Finished difference Result 205 states and 460 transitions. [2020-10-05 23:01:46,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:01:46,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:01:46,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:46,013 INFO L225 Difference]: With dead ends: 205 [2020-10-05 23:01:46,013 INFO L226 Difference]: Without dead ends: 201 [2020-10-05 23:01:46,014 INFO L675 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 [2020-10-05 23:01:46,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-05 23:01:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2020-10-05 23:01:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-05 23:01:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2020-10-05 23:01:46,032 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2020-10-05 23:01:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:46,033 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2020-10-05 23:01:46,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:01:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2020-10-05 23:01:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:01:46,034 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:46,034 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:46,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:01:46,035 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:01:46,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:46,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1027741454, now seen corresponding path program 1 times [2020-10-05 23:01:46,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:46,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116248921] [2020-10-05 23:01:46,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:46,085 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116248921] [2020-10-05 23:01:46,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:46,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:01:46,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524130319] [2020-10-05 23:01:46,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:01:46,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:46,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:01:46,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:01:46,087 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2020-10-05 23:01:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:46,152 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2020-10-05 23:01:46,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:01:46,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:01:46,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:46,154 INFO L225 Difference]: With dead ends: 189 [2020-10-05 23:01:46,154 INFO L226 Difference]: Without dead ends: 185 [2020-10-05 23:01:46,154 INFO L675 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 [2020-10-05 23:01:46,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-05 23:01:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2020-10-05 23:01:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-05 23:01:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2020-10-05 23:01:46,167 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2020-10-05 23:01:46,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:46,168 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2020-10-05 23:01:46,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:01:46,168 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2020-10-05 23:01:46,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:01:46,170 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:46,170 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:46,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:01:46,170 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:01:46,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:46,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1792799235, now seen corresponding path program 1 times [2020-10-05 23:01:46,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:46,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078116718] [2020-10-05 23:01:46,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:01:46,185 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:01:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:01:46,196 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:01:46,203 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:01:46,203 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:01:46,203 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:01:46,204 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:01:46,204 WARN L363 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:01:46,205 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-10-05 23:01:46,222 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,223 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,223 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,223 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,223 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,223 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,224 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,224 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,224 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,225 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,225 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,225 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,225 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,225 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,225 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,225 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,226 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,226 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,226 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,226 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,226 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,226 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,227 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,227 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,231 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,231 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,233 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,235 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,235 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,237 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,240 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,240 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,240 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,240 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,240 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,242 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,242 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,242 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,242 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,242 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,243 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,244 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,244 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,244 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,244 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,248 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,248 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,249 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,250 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,250 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,251 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,252 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,252 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:46,256 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:01:46,256 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:01:46,256 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:01:46,256 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 23:01:46,256 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:01:46,257 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:01:46,257 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:01:46,257 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:01:46,257 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:01:46,260 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 90 transitions, 222 flow [2020-10-05 23:01:46,260 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 90 transitions, 222 flow [2020-10-05 23:01:46,293 INFO L129 PetriNetUnfolder]: 6/110 cut-off events. [2020-10-05 23:01:46,293 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-05 23:01:46,295 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 6/110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 163 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2020-10-05 23:01:46,300 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 90 transitions, 222 flow [2020-10-05 23:01:46,315 INFO L129 PetriNetUnfolder]: 6/110 cut-off events. [2020-10-05 23:01:46,316 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-05 23:01:46,317 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 6/110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 163 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2020-10-05 23:01:46,319 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1308 [2020-10-05 23:01:46,319 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 23:01:47,814 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-10-05 23:01:47,946 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-05 23:01:47,953 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1426 [2020-10-05 23:01:47,954 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2020-10-05 23:01:47,954 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 27 transitions, 96 flow [2020-10-05 23:01:47,981 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2020-10-05 23:01:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2020-10-05 23:01:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:01:47,982 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:47,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:01:47,983 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:01:47,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:47,983 INFO L82 PathProgramCache]: Analyzing trace with hash 567457, now seen corresponding path program 1 times [2020-10-05 23:01:47,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:47,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65538837] [2020-10-05 23:01:47,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:48,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65538837] [2020-10-05 23:01:48,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:48,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:01:48,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565862458] [2020-10-05 23:01:48,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:01:48,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:48,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:01:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:01:48,013 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2020-10-05 23:01:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:48,045 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2020-10-05 23:01:48,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:01:48,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:01:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:48,051 INFO L225 Difference]: With dead ends: 600 [2020-10-05 23:01:48,051 INFO L226 Difference]: Without dead ends: 559 [2020-10-05 23:01:48,052 INFO L675 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 [2020-10-05 23:01:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-10-05 23:01:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2020-10-05 23:01:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-10-05 23:01:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1737 transitions. [2020-10-05 23:01:48,087 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1737 transitions. Word has length 3 [2020-10-05 23:01:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:48,087 INFO L479 AbstractCegarLoop]: Abstraction has 559 states and 1737 transitions. [2020-10-05 23:01:48,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:01:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1737 transitions. [2020-10-05 23:01:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:01:48,088 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:48,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:48,088 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:01:48,088 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:01:48,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:48,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1052273544, now seen corresponding path program 1 times [2020-10-05 23:01:48,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:48,089 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608135621] [2020-10-05 23:01:48,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:48,133 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608135621] [2020-10-05 23:01:48,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:48,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:01:48,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979944302] [2020-10-05 23:01:48,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:01:48,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:48,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:01:48,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:01:48,135 INFO L87 Difference]: Start difference. First operand 559 states and 1737 transitions. Second operand 5 states. [2020-10-05 23:01:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:48,227 INFO L93 Difference]: Finished difference Result 817 states and 2317 transitions. [2020-10-05 23:01:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:01:48,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:01:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:48,234 INFO L225 Difference]: With dead ends: 817 [2020-10-05 23:01:48,234 INFO L226 Difference]: Without dead ends: 812 [2020-10-05 23:01:48,235 INFO L675 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 [2020-10-05 23:01:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-10-05 23:01:48,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 585. [2020-10-05 23:01:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2020-10-05 23:01:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1832 transitions. [2020-10-05 23:01:48,262 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1832 transitions. Word has length 9 [2020-10-05 23:01:48,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:48,262 INFO L479 AbstractCegarLoop]: Abstraction has 585 states and 1832 transitions. [2020-10-05 23:01:48,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:01:48,263 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1832 transitions. [2020-10-05 23:01:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:01:48,264 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:48,264 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:48,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:01:48,264 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:01:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:48,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1096280394, now seen corresponding path program 1 times [2020-10-05 23:01:48,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:48,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775600053] [2020-10-05 23:01:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:48,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775600053] [2020-10-05 23:01:48,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:48,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:01:48,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828962297] [2020-10-05 23:01:48,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:01:48,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:01:48,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:01:48,312 INFO L87 Difference]: Start difference. First operand 585 states and 1832 transitions. Second operand 5 states. [2020-10-05 23:01:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:48,404 INFO L93 Difference]: Finished difference Result 843 states and 2406 transitions. [2020-10-05 23:01:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:01:48,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:01:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:48,411 INFO L225 Difference]: With dead ends: 843 [2020-10-05 23:01:48,411 INFO L226 Difference]: Without dead ends: 836 [2020-10-05 23:01:48,412 INFO L675 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 [2020-10-05 23:01:48,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-10-05 23:01:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 611. [2020-10-05 23:01:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2020-10-05 23:01:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1906 transitions. [2020-10-05 23:01:48,456 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1906 transitions. Word has length 13 [2020-10-05 23:01:48,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:48,457 INFO L479 AbstractCegarLoop]: Abstraction has 611 states and 1906 transitions. [2020-10-05 23:01:48,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:01:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1906 transitions. [2020-10-05 23:01:48,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:01:48,458 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:48,458 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:48,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:01:48,459 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:01:48,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:48,459 INFO L82 PathProgramCache]: Analyzing trace with hash 2044985054, now seen corresponding path program 1 times [2020-10-05 23:01:48,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:48,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006951841] [2020-10-05 23:01:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:48,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006951841] [2020-10-05 23:01:48,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659327761] [2020-10-05 23:01:48,519 INFO L95 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 [2020-10-05 23:01:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:48,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:01:48,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:48,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:48,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:01:48,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227081978] [2020-10-05 23:01:48,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:01:48,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:48,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:01:48,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:01:48,702 INFO L87 Difference]: Start difference. First operand 611 states and 1906 transitions. Second operand 12 states. [2020-10-05 23:01:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:48,975 INFO L93 Difference]: Finished difference Result 1059 states and 2818 transitions. [2020-10-05 23:01:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:48,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:01:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:48,983 INFO L225 Difference]: With dead ends: 1059 [2020-10-05 23:01:48,984 INFO L226 Difference]: Without dead ends: 1052 [2020-10-05 23:01:48,985 INFO L675 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 [2020-10-05 23:01:48,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-10-05 23:01:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 591. [2020-10-05 23:01:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-10-05 23:01:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1840 transitions. [2020-10-05 23:01:49,012 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1840 transitions. Word has length 15 [2020-10-05 23:01:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:49,012 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 1840 transitions. [2020-10-05 23:01:49,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:01:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1840 transitions. [2020-10-05 23:01:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:01:49,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:49,014 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:49,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-10-05 23:01:49,229 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:01:49,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:49,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1258473782, now seen corresponding path program 2 times [2020-10-05 23:01:49,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:49,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831205134] [2020-10-05 23:01:49,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:49,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831205134] [2020-10-05 23:01:49,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:49,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:01:49,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592652854] [2020-10-05 23:01:49,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:01:49,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:49,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:01:49,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:01:49,278 INFO L87 Difference]: Start difference. First operand 591 states and 1840 transitions. Second operand 7 states. [2020-10-05 23:01:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:49,497 INFO L93 Difference]: Finished difference Result 1053 states and 2807 transitions. [2020-10-05 23:01:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:49,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:01:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:49,505 INFO L225 Difference]: With dead ends: 1053 [2020-10-05 23:01:49,505 INFO L226 Difference]: Without dead ends: 1045 [2020-10-05 23:01:49,505 INFO L675 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 [2020-10-05 23:01:49,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-10-05 23:01:49,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2020-10-05 23:01:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-10-05 23:01:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2020-10-05 23:01:49,530 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2020-10-05 23:01:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:49,531 INFO L479 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2020-10-05 23:01:49,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:01:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2020-10-05 23:01:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:01:49,532 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:49,532 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:49,532 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:01:49,532 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:01:49,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:49,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1734594488, now seen corresponding path program 1 times [2020-10-05 23:01:49,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:49,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263300568] [2020-10-05 23:01:49,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:01:49,572 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263300568] [2020-10-05 23:01:49,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:49,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:01:49,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378360206] [2020-10-05 23:01:49,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:01:49,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:49,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:01:49,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:01:49,573 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2020-10-05 23:01:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:49,652 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2020-10-05 23:01:49,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:01:49,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:01:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:49,658 INFO L225 Difference]: With dead ends: 736 [2020-10-05 23:01:49,658 INFO L226 Difference]: Without dead ends: 728 [2020-10-05 23:01:49,658 INFO L675 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 [2020-10-05 23:01:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-10-05 23:01:49,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2020-10-05 23:01:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-10-05 23:01:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2020-10-05 23:01:49,677 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2020-10-05 23:01:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:49,677 INFO L479 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2020-10-05 23:01:49,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:01:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2020-10-05 23:01:49,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:01:49,678 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:49,679 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:49,679 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:01:49,679 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:01:49,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:49,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2065233823, now seen corresponding path program 1 times [2020-10-05 23:01:49,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:49,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300141171] [2020-10-05 23:01:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:01:49,690 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:01:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:01:49,699 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:01:49,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:01:49,705 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:01:49,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:01:49,706 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:01:49,706 WARN L363 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:01:49,707 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-10-05 23:01:49,719 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,719 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,720 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,720 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,720 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,720 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,720 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,721 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,721 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,721 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,721 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,721 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,721 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,722 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,722 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,722 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,722 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,722 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,722 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,723 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,723 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,723 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,723 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,723 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,723 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,724 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,724 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,724 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,724 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,724 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,725 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,725 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,726 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,726 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,727 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,727 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,743 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,743 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,743 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,744 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,744 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,745 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,745 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,746 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,746 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,746 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,747 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,747 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,747 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,747 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,748 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,749 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,749 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,749 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,749 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,749 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,750 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,751 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,751 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,752 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,753 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,753 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,754 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,754 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,755 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,756 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,757 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,757 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:01:49,758 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:01:49,758 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:01:49,758 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:01:49,758 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 23:01:49,758 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:01:49,759 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:01:49,759 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:01:49,759 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:01:49,759 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:01:49,760 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 106 transitions, 276 flow [2020-10-05 23:01:49,760 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 106 transitions, 276 flow [2020-10-05 23:01:49,775 INFO L129 PetriNetUnfolder]: 7/131 cut-off events. [2020-10-05 23:01:49,775 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-05 23:01:49,776 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 131 events. 7/131 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 151. Up to 10 conditions per place. [2020-10-05 23:01:49,780 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 106 transitions, 276 flow [2020-10-05 23:01:49,793 INFO L129 PetriNetUnfolder]: 7/131 cut-off events. [2020-10-05 23:01:49,793 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-05 23:01:49,794 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 131 events. 7/131 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 151. Up to 10 conditions per place. [2020-10-05 23:01:49,797 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1756 [2020-10-05 23:01:49,797 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 23:01:51,567 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-05 23:01:51,727 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-10-05 23:01:51,812 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2033 [2020-10-05 23:01:51,812 INFO L214 etLargeBlockEncoding]: Total number of compositions: 86 [2020-10-05 23:01:51,812 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 33 transitions, 130 flow [2020-10-05 23:01:51,920 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2020-10-05 23:01:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2020-10-05 23:01:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:01:51,921 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:51,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:01:51,921 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:51,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:51,922 INFO L82 PathProgramCache]: Analyzing trace with hash 779528, now seen corresponding path program 1 times [2020-10-05 23:01:51,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:51,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753896504] [2020-10-05 23:01:51,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:51,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753896504] [2020-10-05 23:01:51,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:51,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:01:51,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339829908] [2020-10-05 23:01:51,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:01:51,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:51,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:01:51,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:01:51,946 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2020-10-05 23:01:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:51,987 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2020-10-05 23:01:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:01:51,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:01:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:52,004 INFO L225 Difference]: With dead ends: 1889 [2020-10-05 23:01:52,004 INFO L226 Difference]: Without dead ends: 1767 [2020-10-05 23:01:52,004 INFO L675 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 [2020-10-05 23:01:52,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2020-10-05 23:01:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2020-10-05 23:01:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2020-10-05 23:01:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 6690 transitions. [2020-10-05 23:01:52,145 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 6690 transitions. Word has length 3 [2020-10-05 23:01:52,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:52,146 INFO L479 AbstractCegarLoop]: Abstraction has 1767 states and 6690 transitions. [2020-10-05 23:01:52,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:01:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 6690 transitions. [2020-10-05 23:01:52,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:01:52,147 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:52,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:52,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:01:52,147 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:52,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:52,149 INFO L82 PathProgramCache]: Analyzing trace with hash -666106918, now seen corresponding path program 1 times [2020-10-05 23:01:52,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:52,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923122971] [2020-10-05 23:01:52,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:52,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923122971] [2020-10-05 23:01:52,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:52,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:01:52,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538550189] [2020-10-05 23:01:52,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:01:52,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:52,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:01:52,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:01:52,205 INFO L87 Difference]: Start difference. First operand 1767 states and 6690 transitions. Second operand 5 states. [2020-10-05 23:01:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:52,337 INFO L93 Difference]: Finished difference Result 2905 states and 10138 transitions. [2020-10-05 23:01:52,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:01:52,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:01:52,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:52,369 INFO L225 Difference]: With dead ends: 2905 [2020-10-05 23:01:52,370 INFO L226 Difference]: Without dead ends: 2899 [2020-10-05 23:01:52,370 INFO L675 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 [2020-10-05 23:01:52,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-10-05 23:01:52,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1966. [2020-10-05 23:01:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2020-10-05 23:01:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 7503 transitions. [2020-10-05 23:01:52,487 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 7503 transitions. Word has length 9 [2020-10-05 23:01:52,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:52,487 INFO L479 AbstractCegarLoop]: Abstraction has 1966 states and 7503 transitions. [2020-10-05 23:01:52,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:01:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 7503 transitions. [2020-10-05 23:01:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:01:52,488 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:52,488 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:52,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:01:52,488 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:52,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:52,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1766896000, now seen corresponding path program 1 times [2020-10-05 23:01:52,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:52,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593937322] [2020-10-05 23:01:52,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:52,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593937322] [2020-10-05 23:01:52,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:52,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:01:52,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718268128] [2020-10-05 23:01:52,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:01:52,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:52,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:01:52,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:01:52,526 INFO L87 Difference]: Start difference. First operand 1966 states and 7503 transitions. Second operand 5 states. [2020-10-05 23:01:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:52,631 INFO L93 Difference]: Finished difference Result 3204 states and 11312 transitions. [2020-10-05 23:01:52,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:01:52,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:01:52,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:52,656 INFO L225 Difference]: With dead ends: 3204 [2020-10-05 23:01:52,657 INFO L226 Difference]: Without dead ends: 3194 [2020-10-05 23:01:52,657 INFO L675 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 [2020-10-05 23:01:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2020-10-05 23:01:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2200. [2020-10-05 23:01:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2020-10-05 23:01:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 8453 transitions. [2020-10-05 23:01:52,775 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 8453 transitions. Word has length 13 [2020-10-05 23:01:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:52,778 INFO L479 AbstractCegarLoop]: Abstraction has 2200 states and 8453 transitions. [2020-10-05 23:01:52,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:01:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 8453 transitions. [2020-10-05 23:01:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:01:52,780 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:52,780 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:52,780 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:01:52,781 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:52,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:52,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1022394712, now seen corresponding path program 1 times [2020-10-05 23:01:52,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:52,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136296769] [2020-10-05 23:01:52,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:52,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136296769] [2020-10-05 23:01:52,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681809296] [2020-10-05 23:01:52,849 INFO L95 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 [2020-10-05 23:01:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:52,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:01:52,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:52,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:52,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:01:52,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120402672] [2020-10-05 23:01:52,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:01:52,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:52,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:01:52,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:01:52,995 INFO L87 Difference]: Start difference. First operand 2200 states and 8453 transitions. Second operand 12 states. [2020-10-05 23:01:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:53,358 INFO L93 Difference]: Finished difference Result 4556 states and 14911 transitions. [2020-10-05 23:01:53,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:53,359 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:01:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:53,382 INFO L225 Difference]: With dead ends: 4556 [2020-10-05 23:01:53,383 INFO L226 Difference]: Without dead ends: 4546 [2020-10-05 23:01:53,383 INFO L675 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 [2020-10-05 23:01:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2020-10-05 23:01:53,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2157. [2020-10-05 23:01:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2020-10-05 23:01:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 8278 transitions. [2020-10-05 23:01:53,513 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 8278 transitions. Word has length 15 [2020-10-05 23:01:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:53,513 INFO L479 AbstractCegarLoop]: Abstraction has 2157 states and 8278 transitions. [2020-10-05 23:01:53,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:01:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 8278 transitions. [2020-10-05 23:01:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:01:53,514 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:53,515 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:53,728 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-10-05 23:01:53,728 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:53,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:53,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1474969304, now seen corresponding path program 2 times [2020-10-05 23:01:53,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:53,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946719657] [2020-10-05 23:01:53,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:53,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946719657] [2020-10-05 23:01:53,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:53,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:01:53,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100937705] [2020-10-05 23:01:53,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:01:53,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:53,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:01:53,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:01:53,781 INFO L87 Difference]: Start difference. First operand 2157 states and 8278 transitions. Second operand 7 states. [2020-10-05 23:01:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:54,058 INFO L93 Difference]: Finished difference Result 4612 states and 15111 transitions. [2020-10-05 23:01:54,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:54,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:01:54,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:54,082 INFO L225 Difference]: With dead ends: 4612 [2020-10-05 23:01:54,083 INFO L226 Difference]: Without dead ends: 4601 [2020-10-05 23:01:54,085 INFO L675 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 [2020-10-05 23:01:54,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2020-10-05 23:01:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 2035. [2020-10-05 23:01:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2020-10-05 23:01:54,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 7845 transitions. [2020-10-05 23:01:54,200 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 7845 transitions. Word has length 15 [2020-10-05 23:01:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:54,200 INFO L479 AbstractCegarLoop]: Abstraction has 2035 states and 7845 transitions. [2020-10-05 23:01:54,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:01:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 7845 transitions. [2020-10-05 23:01:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:01:54,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:54,201 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:54,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:01:54,202 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:54,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1278978660, now seen corresponding path program 1 times [2020-10-05 23:01:54,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:54,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020908987] [2020-10-05 23:01:54,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:01:54,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020908987] [2020-10-05 23:01:54,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:54,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:01:54,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449537343] [2020-10-05 23:01:54,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:01:54,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:54,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:01:54,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:01:54,272 INFO L87 Difference]: Start difference. First operand 2035 states and 7845 transitions. Second operand 5 states. [2020-10-05 23:01:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:54,379 INFO L93 Difference]: Finished difference Result 3265 states and 11681 transitions. [2020-10-05 23:01:54,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:01:54,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:01:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:54,392 INFO L225 Difference]: With dead ends: 3265 [2020-10-05 23:01:54,392 INFO L226 Difference]: Without dead ends: 3250 [2020-10-05 23:01:54,393 INFO L675 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 [2020-10-05 23:01:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-10-05 23:01:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2281. [2020-10-05 23:01:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2020-10-05 23:01:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 8755 transitions. [2020-10-05 23:01:54,570 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 8755 transitions. Word has length 17 [2020-10-05 23:01:54,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:54,571 INFO L479 AbstractCegarLoop]: Abstraction has 2281 states and 8755 transitions. [2020-10-05 23:01:54,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:01:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 8755 transitions. [2020-10-05 23:01:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:01:54,572 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:54,572 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:54,572 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:01:54,573 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:54,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:54,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1455436228, now seen corresponding path program 1 times [2020-10-05 23:01:54,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:54,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918010515] [2020-10-05 23:01:54,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:01:54,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918010515] [2020-10-05 23:01:54,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436451010] [2020-10-05 23:01:54,628 INFO L95 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 [2020-10-05 23:01:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:54,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:01:54,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:01:54,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:54,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:01:54,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689997468] [2020-10-05 23:01:54,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:01:54,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:54,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:01:54,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:01:54,775 INFO L87 Difference]: Start difference. First operand 2281 states and 8755 transitions. Second operand 12 states. [2020-10-05 23:01:55,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:55,128 INFO L93 Difference]: Finished difference Result 4825 states and 15986 transitions. [2020-10-05 23:01:55,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:55,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:01:55,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:55,145 INFO L225 Difference]: With dead ends: 4825 [2020-10-05 23:01:55,145 INFO L226 Difference]: Without dead ends: 4813 [2020-10-05 23:01:55,145 INFO L675 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 [2020-10-05 23:01:55,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2020-10-05 23:01:55,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 2305. [2020-10-05 23:01:55,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2020-10-05 23:01:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 8815 transitions. [2020-10-05 23:01:55,269 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 8815 transitions. Word has length 19 [2020-10-05 23:01:55,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:55,270 INFO L479 AbstractCegarLoop]: Abstraction has 2305 states and 8815 transitions. [2020-10-05 23:01:55,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:01:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 8815 transitions. [2020-10-05 23:01:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:01:55,271 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:55,271 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:55,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:55,486 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:55,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:55,486 INFO L82 PathProgramCache]: Analyzing trace with hash -979473248, now seen corresponding path program 1 times [2020-10-05 23:01:55,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:55,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338522671] [2020-10-05 23:01:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:55,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338522671] [2020-10-05 23:01:55,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074623013] [2020-10-05 23:01:55,536 INFO L95 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 [2020-10-05 23:01:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:55,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:01:55,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:01:55,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:55,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:01:55,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647072200] [2020-10-05 23:01:55,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:01:55,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:55,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:01:55,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:01:55,673 INFO L87 Difference]: Start difference. First operand 2305 states and 8815 transitions. Second operand 12 states. [2020-10-05 23:01:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:56,025 INFO L93 Difference]: Finished difference Result 4942 states and 16410 transitions. [2020-10-05 23:01:56,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:56,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:01:56,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:56,117 INFO L225 Difference]: With dead ends: 4942 [2020-10-05 23:01:56,117 INFO L226 Difference]: Without dead ends: 4925 [2020-10-05 23:01:56,118 INFO L675 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 [2020-10-05 23:01:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2020-10-05 23:01:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 2299. [2020-10-05 23:01:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2020-10-05 23:01:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 8782 transitions. [2020-10-05 23:01:56,218 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 8782 transitions. Word has length 19 [2020-10-05 23:01:56,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:56,218 INFO L479 AbstractCegarLoop]: Abstraction has 2299 states and 8782 transitions. [2020-10-05 23:01:56,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:01:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 8782 transitions. [2020-10-05 23:01:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:01:56,220 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:56,220 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:56,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:01:56,434 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:56,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash -737855584, now seen corresponding path program 2 times [2020-10-05 23:01:56,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:56,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426989455] [2020-10-05 23:01:56,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:01:56,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426989455] [2020-10-05 23:01:56,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:56,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:01:56,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309916199] [2020-10-05 23:01:56,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:01:56,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:56,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:01:56,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:01:56,489 INFO L87 Difference]: Start difference. First operand 2299 states and 8782 transitions. Second operand 7 states. [2020-10-05 23:01:56,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:56,719 INFO L93 Difference]: Finished difference Result 4934 states and 16393 transitions. [2020-10-05 23:01:56,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:56,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:01:56,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:56,736 INFO L225 Difference]: With dead ends: 4934 [2020-10-05 23:01:56,736 INFO L226 Difference]: Without dead ends: 4917 [2020-10-05 23:01:56,736 INFO L675 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 [2020-10-05 23:01:56,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2020-10-05 23:01:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 2216. [2020-10-05 23:01:56,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2020-10-05 23:01:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 8477 transitions. [2020-10-05 23:01:56,832 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 8477 transitions. Word has length 19 [2020-10-05 23:01:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:56,832 INFO L479 AbstractCegarLoop]: Abstraction has 2216 states and 8477 transitions. [2020-10-05 23:01:56,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:01:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 8477 transitions. [2020-10-05 23:01:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:01:56,834 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:56,834 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:56,834 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-05 23:01:56,834 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:56,835 INFO L82 PathProgramCache]: Analyzing trace with hash -737840828, now seen corresponding path program 2 times [2020-10-05 23:01:56,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:56,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031819849] [2020-10-05 23:01:56,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:01:56,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031819849] [2020-10-05 23:01:56,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:01:56,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:01:56,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639293221] [2020-10-05 23:01:56,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:01:56,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:56,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:01:56,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:01:56,907 INFO L87 Difference]: Start difference. First operand 2216 states and 8477 transitions. Second operand 7 states. [2020-10-05 23:01:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:57,157 INFO L93 Difference]: Finished difference Result 4774 states and 15828 transitions. [2020-10-05 23:01:57,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:01:57,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:01:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:57,169 INFO L225 Difference]: With dead ends: 4774 [2020-10-05 23:01:57,170 INFO L226 Difference]: Without dead ends: 4757 [2020-10-05 23:01:57,170 INFO L675 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 [2020-10-05 23:01:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2020-10-05 23:01:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 2150. [2020-10-05 23:01:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2020-10-05 23:01:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 8243 transitions. [2020-10-05 23:01:57,257 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 8243 transitions. Word has length 19 [2020-10-05 23:01:57,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:57,257 INFO L479 AbstractCegarLoop]: Abstraction has 2150 states and 8243 transitions. [2020-10-05 23:01:57,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:01:57,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 8243 transitions. [2020-10-05 23:01:57,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:57,259 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:57,259 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:57,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-05 23:01:57,259 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:57,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1726751032, now seen corresponding path program 1 times [2020-10-05 23:01:57,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:57,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714235449] [2020-10-05 23:01:57,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:57,424 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714235449] [2020-10-05 23:01:57,425 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654102396] [2020-10-05 23:01:57,425 INFO L95 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 [2020-10-05 23:01:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:57,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:57,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:01:57,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:57,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:57,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616539025] [2020-10-05 23:01:57,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:57,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:57,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:57,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:57,604 INFO L87 Difference]: Start difference. First operand 2150 states and 8243 transitions. Second operand 16 states. [2020-10-05 23:01:58,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:58,354 INFO L93 Difference]: Finished difference Result 6025 states and 18746 transitions. [2020-10-05 23:01:58,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:58,355 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:01:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:58,363 INFO L225 Difference]: With dead ends: 6025 [2020-10-05 23:01:58,364 INFO L226 Difference]: Without dead ends: 6017 [2020-10-05 23:01:58,365 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:01:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-10-05 23:01:58,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 2117. [2020-10-05 23:01:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2020-10-05 23:01:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 8106 transitions. [2020-10-05 23:01:58,458 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 8106 transitions. Word has length 21 [2020-10-05 23:01:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:58,458 INFO L479 AbstractCegarLoop]: Abstraction has 2117 states and 8106 transitions. [2020-10-05 23:01:58,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 8106 transitions. [2020-10-05 23:01:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:58,460 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:58,460 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:01:58,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-10-05 23:01:58,675 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:01:58,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:01:58,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1485133368, now seen corresponding path program 2 times [2020-10-05 23:01:58,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:01:58,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413760065] [2020-10-05 23:01:58,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:01:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:01:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:01:58,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413760065] [2020-10-05 23:01:58,761 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003524462] [2020-10-05 23:01:58,761 INFO L93 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 [2020-10-05 23:01:58,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:01:58,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:01:58,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:01:58,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:01:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:01:58,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:01:58,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:01:58,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540288020] [2020-10-05 23:01:58,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:01:58,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:01:58,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:01:58,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:01:58,932 INFO L87 Difference]: Start difference. First operand 2117 states and 8106 transitions. Second operand 16 states. [2020-10-05 23:01:59,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:01:59,771 INFO L93 Difference]: Finished difference Result 5914 states and 18384 transitions. [2020-10-05 23:01:59,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:01:59,771 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:01:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:01:59,780 INFO L225 Difference]: With dead ends: 5914 [2020-10-05 23:01:59,780 INFO L226 Difference]: Without dead ends: 5903 [2020-10-05 23:01:59,781 INFO L675 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 [2020-10-05 23:01:59,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2020-10-05 23:01:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 2085. [2020-10-05 23:01:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2020-10-05 23:01:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 7975 transitions. [2020-10-05 23:01:59,872 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 7975 transitions. Word has length 21 [2020-10-05 23:01:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:01:59,873 INFO L479 AbstractCegarLoop]: Abstraction has 2085 states and 7975 transitions. [2020-10-05 23:01:59,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:01:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 7975 transitions. [2020-10-05 23:01:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:01:59,874 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:01:59,874 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:00,088 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:00,089 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:02:00,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:00,090 INFO L82 PathProgramCache]: Analyzing trace with hash -268549816, now seen corresponding path program 3 times [2020-10-05 23:02:00,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:00,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695849090] [2020-10-05 23:02:00,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:00,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695849090] [2020-10-05 23:02:00,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016557971] [2020-10-05 23:02:00,170 INFO L93 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 [2020-10-05 23:02:00,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:02:00,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:00,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:00,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:00,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:00,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:00,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775745488] [2020-10-05 23:02:00,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:00,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:00,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:00,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:00,339 INFO L87 Difference]: Start difference. First operand 2085 states and 7975 transitions. Second operand 16 states. [2020-10-05 23:02:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:01,141 INFO L93 Difference]: Finished difference Result 5907 states and 18375 transitions. [2020-10-05 23:02:01,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:01,146 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:02:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:01,155 INFO L225 Difference]: With dead ends: 5907 [2020-10-05 23:02:01,155 INFO L226 Difference]: Without dead ends: 5899 [2020-10-05 23:02:01,156 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:02:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2020-10-05 23:02:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 2008. [2020-10-05 23:02:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2020-10-05 23:02:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 7698 transitions. [2020-10-05 23:02:01,232 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 7698 transitions. Word has length 21 [2020-10-05 23:02:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:01,232 INFO L479 AbstractCegarLoop]: Abstraction has 2008 states and 7698 transitions. [2020-10-05 23:02:01,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 7698 transitions. [2020-10-05 23:02:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:02:01,234 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:01,235 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:01,447 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-10-05 23:02:01,447 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:02:01,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:01,449 INFO L82 PathProgramCache]: Analyzing trace with hash -675948728, now seen corresponding path program 4 times [2020-10-05 23:02:01,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:01,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835348824] [2020-10-05 23:02:01,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:01,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835348824] [2020-10-05 23:02:01,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024680656] [2020-10-05 23:02:01,557 INFO L93 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 [2020-10-05 23:02:01,631 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:02:01,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:01,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:01,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:01,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:01,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:01,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575586792] [2020-10-05 23:02:01,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:01,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:01,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:01,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:01,738 INFO L87 Difference]: Start difference. First operand 2008 states and 7698 transitions. Second operand 16 states. [2020-10-05 23:02:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:02,503 INFO L93 Difference]: Finished difference Result 5835 states and 18155 transitions. [2020-10-05 23:02:02,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:02,503 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:02:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:02,512 INFO L225 Difference]: With dead ends: 5835 [2020-10-05 23:02:02,512 INFO L226 Difference]: Without dead ends: 5824 [2020-10-05 23:02:02,513 INFO L675 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 [2020-10-05 23:02:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2020-10-05 23:02:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 1976. [2020-10-05 23:02:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2020-10-05 23:02:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 7567 transitions. [2020-10-05 23:02:02,603 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 7567 transitions. Word has length 21 [2020-10-05 23:02:02,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:02,604 INFO L479 AbstractCegarLoop]: Abstraction has 1976 states and 7567 transitions. [2020-10-05 23:02:02,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:02,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 7567 transitions. [2020-10-05 23:02:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:02:02,606 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:02,606 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:02,821 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-10-05 23:02:02,822 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:02:02,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:02,822 INFO L82 PathProgramCache]: Analyzing trace with hash -409607608, now seen corresponding path program 5 times [2020-10-05 23:02:02,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:02,822 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088654145] [2020-10-05 23:02:02,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:02:02,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088654145] [2020-10-05 23:02:02,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:02,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:02:02,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236195851] [2020-10-05 23:02:02,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:02:02,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:02,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:02:02,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:02:02,887 INFO L87 Difference]: Start difference. First operand 1976 states and 7567 transitions. Second operand 9 states. [2020-10-05 23:02:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:03,616 INFO L93 Difference]: Finished difference Result 5820 states and 18126 transitions. [2020-10-05 23:02:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:03,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:02:03,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:03,625 INFO L225 Difference]: With dead ends: 5820 [2020-10-05 23:02:03,625 INFO L226 Difference]: Without dead ends: 5812 [2020-10-05 23:02:03,626 INFO L675 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 [2020-10-05 23:02:03,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5812 states. [2020-10-05 23:02:03,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5812 to 1907. [2020-10-05 23:02:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2020-10-05 23:02:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 7310 transitions. [2020-10-05 23:02:03,706 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 7310 transitions. Word has length 21 [2020-10-05 23:02:03,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:03,707 INFO L479 AbstractCegarLoop]: Abstraction has 1907 states and 7310 transitions. [2020-10-05 23:02:03,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:02:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 7310 transitions. [2020-10-05 23:02:03,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:02:03,709 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:03,709 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:03,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-05 23:02:03,709 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:02:03,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:03,710 INFO L82 PathProgramCache]: Analyzing trace with hash -395441848, now seen corresponding path program 6 times [2020-10-05 23:02:03,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:03,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802347394] [2020-10-05 23:02:03,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:02:03,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802347394] [2020-10-05 23:02:03,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:03,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:02:03,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442704564] [2020-10-05 23:02:03,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:02:03,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:03,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:02:03,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:02:03,798 INFO L87 Difference]: Start difference. First operand 1907 states and 7310 transitions. Second operand 9 states. [2020-10-05 23:02:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:04,453 INFO L93 Difference]: Finished difference Result 5717 states and 17784 transitions. [2020-10-05 23:02:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:04,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:02:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:04,462 INFO L225 Difference]: With dead ends: 5717 [2020-10-05 23:02:04,462 INFO L226 Difference]: Without dead ends: 5705 [2020-10-05 23:02:04,463 INFO L675 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 [2020-10-05 23:02:04,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2020-10-05 23:02:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 1800. [2020-10-05 23:02:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2020-10-05 23:02:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 6961 transitions. [2020-10-05 23:02:04,539 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 6961 transitions. Word has length 21 [2020-10-05 23:02:04,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:04,539 INFO L479 AbstractCegarLoop]: Abstraction has 1800 states and 6961 transitions. [2020-10-05 23:02:04,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:02:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 6961 transitions. [2020-10-05 23:02:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:02:04,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:04,542 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:04,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-05 23:02:04,542 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:02:04,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:04,542 INFO L82 PathProgramCache]: Analyzing trace with hash -334654421, now seen corresponding path program 1 times [2020-10-05 23:02:04,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:04,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671374595] [2020-10-05 23:02:04,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:02:04,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671374595] [2020-10-05 23:02:04,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:04,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:02:04,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363450051] [2020-10-05 23:02:04,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:02:04,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:04,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:02:04,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:02:04,584 INFO L87 Difference]: Start difference. First operand 1800 states and 6961 transitions. Second operand 5 states. [2020-10-05 23:02:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:04,665 INFO L93 Difference]: Finished difference Result 2762 states and 9976 transitions. [2020-10-05 23:02:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:02:04,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:02:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:04,672 INFO L225 Difference]: With dead ends: 2762 [2020-10-05 23:02:04,672 INFO L226 Difference]: Without dead ends: 2746 [2020-10-05 23:02:04,673 INFO L675 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 [2020-10-05 23:02:04,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2020-10-05 23:02:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 1965. [2020-10-05 23:02:04,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2020-10-05 23:02:04,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2020-10-05 23:02:04,727 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2020-10-05 23:02:04,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:04,727 INFO L479 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2020-10-05 23:02:04,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:02:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2020-10-05 23:02:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:02:04,729 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:04,729 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:04,730 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-05 23:02:04,730 INFO L427 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-10-05 23:02:04,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:04,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1788555247, now seen corresponding path program 1 times [2020-10-05 23:02:04,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:04,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267847680] [2020-10-05 23:02:04,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:02:04,748 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:02:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:02:04,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:02:04,771 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:02:04,772 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:02:04,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-05 23:02:04,772 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:02:04,773 WARN L363 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:02:04,773 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-10-05 23:02:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,789 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,789 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,790 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,790 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,790 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,790 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,790 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,790 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,790 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,791 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,791 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,791 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,791 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,791 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,792 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,792 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,793 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,793 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,793 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,793 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,793 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,793 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,793 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,793 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,794 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,794 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,794 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,794 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,794 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,794 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,794 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,795 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,795 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,795 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,795 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,796 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,796 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,797 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,797 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,798 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,798 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,799 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,799 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,800 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,800 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,801 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,801 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,802 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,802 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,802 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,803 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,803 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,806 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,806 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,807 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,807 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,807 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,810 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,811 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,811 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,811 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,811 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,813 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,813 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,813 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,813 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,813 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,815 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,815 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,815 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,815 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,816 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,820 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,821 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,822 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,823 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,824 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,824 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:02:04,828 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-05 23:02:04,828 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:02:04,828 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:02:04,828 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 23:02:04,828 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:02:04,828 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:02:04,829 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:02:04,829 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:02:04,829 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:02:04,831 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 122 transitions, 334 flow [2020-10-05 23:02:04,832 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 122 transitions, 334 flow [2020-10-05 23:02:04,856 INFO L129 PetriNetUnfolder]: 8/152 cut-off events. [2020-10-05 23:02:04,857 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-05 23:02:04,858 INFO L80 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 152 events. 8/152 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 251 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 179. Up to 12 conditions per place. [2020-10-05 23:02:04,862 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 122 transitions, 334 flow [2020-10-05 23:02:04,965 INFO L129 PetriNetUnfolder]: 8/152 cut-off events. [2020-10-05 23:02:04,966 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-10-05 23:02:04,967 INFO L80 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 152 events. 8/152 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 251 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 179. Up to 12 conditions per place. [2020-10-05 23:02:04,970 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2264 [2020-10-05 23:02:04,970 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 23:02:06,571 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2020-10-05 23:02:06,799 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2020-10-05 23:02:06,998 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-10-05 23:02:07,078 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2999 [2020-10-05 23:02:07,078 INFO L214 etLargeBlockEncoding]: Total number of compositions: 104 [2020-10-05 23:02:07,079 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 39 transitions, 168 flow [2020-10-05 23:02:07,510 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2020-10-05 23:02:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2020-10-05 23:02:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:02:07,510 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:07,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:02:07,511 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:07,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:07,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1026170, now seen corresponding path program 1 times [2020-10-05 23:02:07,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:07,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000838547] [2020-10-05 23:02:07,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:02:07,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000838547] [2020-10-05 23:02:07,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:07,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:02:07,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186873043] [2020-10-05 23:02:07,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:02:07,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:07,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:02:07,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:02:07,527 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2020-10-05 23:02:07,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:07,586 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2020-10-05 23:02:07,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:02:07,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:02:07,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:07,599 INFO L225 Difference]: With dead ends: 5844 [2020-10-05 23:02:07,599 INFO L226 Difference]: Without dead ends: 5479 [2020-10-05 23:02:07,600 INFO L675 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 [2020-10-05 23:02:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-10-05 23:02:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-10-05 23:02:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-10-05 23:02:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 24493 transitions. [2020-10-05 23:02:07,744 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 24493 transitions. Word has length 3 [2020-10-05 23:02:07,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:07,744 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 24493 transitions. [2020-10-05 23:02:07,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:02:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 24493 transitions. [2020-10-05 23:02:07,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:02:07,745 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:07,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:07,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-05 23:02:07,745 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:07,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:07,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1344335463, now seen corresponding path program 1 times [2020-10-05 23:02:07,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:07,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215763504] [2020-10-05 23:02:07,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:02:07,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215763504] [2020-10-05 23:02:07,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:07,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:02:07,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676830423] [2020-10-05 23:02:07,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:02:07,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:07,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:02:07,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:02:07,781 INFO L87 Difference]: Start difference. First operand 5479 states and 24493 transitions. Second operand 5 states. [2020-10-05 23:02:07,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:07,922 INFO L93 Difference]: Finished difference Result 9673 states and 40333 transitions. [2020-10-05 23:02:07,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:02:07,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:02:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:07,948 INFO L225 Difference]: With dead ends: 9673 [2020-10-05 23:02:07,949 INFO L226 Difference]: Without dead ends: 9666 [2020-10-05 23:02:07,949 INFO L675 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 [2020-10-05 23:02:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2020-10-05 23:02:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 6331. [2020-10-05 23:02:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6331 states. [2020-10-05 23:02:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 28544 transitions. [2020-10-05 23:02:08,137 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 28544 transitions. Word has length 9 [2020-10-05 23:02:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:08,137 INFO L479 AbstractCegarLoop]: Abstraction has 6331 states and 28544 transitions. [2020-10-05 23:02:08,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:02:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 28544 transitions. [2020-10-05 23:02:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:02:08,137 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:08,137 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:08,138 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-05 23:02:08,138 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:08,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:08,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1513378118, now seen corresponding path program 1 times [2020-10-05 23:02:08,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:08,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595237816] [2020-10-05 23:02:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:08,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595237816] [2020-10-05 23:02:08,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:08,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:02:08,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507756505] [2020-10-05 23:02:08,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:02:08,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:08,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:02:08,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:02:08,174 INFO L87 Difference]: Start difference. First operand 6331 states and 28544 transitions. Second operand 5 states. [2020-10-05 23:02:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:08,318 INFO L93 Difference]: Finished difference Result 11081 states and 46826 transitions. [2020-10-05 23:02:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:02:08,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:02:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:08,342 INFO L225 Difference]: With dead ends: 11081 [2020-10-05 23:02:08,342 INFO L226 Difference]: Without dead ends: 11068 [2020-10-05 23:02:08,343 INFO L675 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 [2020-10-05 23:02:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11068 states. [2020-10-05 23:02:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11068 to 7391. [2020-10-05 23:02:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7391 states. [2020-10-05 23:02:09,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 33694 transitions. [2020-10-05 23:02:09,151 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 33694 transitions. Word has length 13 [2020-10-05 23:02:09,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:09,152 INFO L479 AbstractCegarLoop]: Abstraction has 7391 states and 33694 transitions. [2020-10-05 23:02:09,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:02:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 33694 transitions. [2020-10-05 23:02:09,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:02:09,152 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:09,152 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:09,152 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-05 23:02:09,153 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:09,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:09,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1678648171, now seen corresponding path program 1 times [2020-10-05 23:02:09,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:09,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413939599] [2020-10-05 23:02:09,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:02:09,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413939599] [2020-10-05 23:02:09,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594532082] [2020-10-05 23:02:09,202 INFO L95 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 [2020-10-05 23:02:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:09,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:02:09,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:02:09,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:09,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:02:09,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53345839] [2020-10-05 23:02:09,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:02:09,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:09,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:02:09,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:02:09,350 INFO L87 Difference]: Start difference. First operand 7391 states and 33694 transitions. Second operand 12 states. [2020-10-05 23:02:09,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:09,769 INFO L93 Difference]: Finished difference Result 16749 states and 66010 transitions. [2020-10-05 23:02:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:09,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:02:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:09,824 INFO L225 Difference]: With dead ends: 16749 [2020-10-05 23:02:09,824 INFO L226 Difference]: Without dead ends: 16736 [2020-10-05 23:02:09,825 INFO L675 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 [2020-10-05 23:02:09,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16736 states. [2020-10-05 23:02:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16736 to 7303. [2020-10-05 23:02:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2020-10-05 23:02:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 33260 transitions. [2020-10-05 23:02:10,159 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 33260 transitions. Word has length 15 [2020-10-05 23:02:10,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:10,159 INFO L479 AbstractCegarLoop]: Abstraction has 7303 states and 33260 transitions. [2020-10-05 23:02:10,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:02:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 33260 transitions. [2020-10-05 23:02:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:02:10,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:10,160 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:10,375 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:10,376 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:10,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:10,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1637555113, now seen corresponding path program 2 times [2020-10-05 23:02:10,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:10,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217689213] [2020-10-05 23:02:10,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:10,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217689213] [2020-10-05 23:02:10,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:10,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:02:10,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336720749] [2020-10-05 23:02:10,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:02:10,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:10,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:02:10,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:02:10,420 INFO L87 Difference]: Start difference. First operand 7303 states and 33260 transitions. Second operand 7 states. [2020-10-05 23:02:10,618 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-10-05 23:02:10,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:10,869 INFO L93 Difference]: Finished difference Result 17085 states and 67393 transitions. [2020-10-05 23:02:10,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:10,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:02:10,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:10,905 INFO L225 Difference]: With dead ends: 17085 [2020-10-05 23:02:10,906 INFO L226 Difference]: Without dead ends: 17071 [2020-10-05 23:02:10,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:02:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2020-10-05 23:02:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 7048. [2020-10-05 23:02:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2020-10-05 23:02:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 32136 transitions. [2020-10-05 23:02:11,165 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 32136 transitions. Word has length 15 [2020-10-05 23:02:11,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:11,165 INFO L479 AbstractCegarLoop]: Abstraction has 7048 states and 32136 transitions. [2020-10-05 23:02:11,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:02:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 32136 transitions. [2020-10-05 23:02:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:02:11,166 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:11,166 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:11,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-05 23:02:11,166 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:11,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:11,166 INFO L82 PathProgramCache]: Analyzing trace with hash -288445665, now seen corresponding path program 1 times [2020-10-05 23:02:11,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:11,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763875399] [2020-10-05 23:02:11,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:11,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:02:11,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763875399] [2020-10-05 23:02:11,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:11,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:02:11,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644016063] [2020-10-05 23:02:11,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:02:11,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:11,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:02:11,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:02:11,207 INFO L87 Difference]: Start difference. First operand 7048 states and 32136 transitions. Second operand 5 states. [2020-10-05 23:02:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:11,347 INFO L93 Difference]: Finished difference Result 12234 states and 52488 transitions. [2020-10-05 23:02:11,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:02:11,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:02:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:11,373 INFO L225 Difference]: With dead ends: 12234 [2020-10-05 23:02:11,374 INFO L226 Difference]: Without dead ends: 12212 [2020-10-05 23:02:11,374 INFO L675 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 [2020-10-05 23:02:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2020-10-05 23:02:11,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 8342. [2020-10-05 23:02:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8342 states. [2020-10-05 23:02:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 38278 transitions. [2020-10-05 23:02:11,812 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 38278 transitions. Word has length 17 [2020-10-05 23:02:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:11,812 INFO L479 AbstractCegarLoop]: Abstraction has 8342 states and 38278 transitions. [2020-10-05 23:02:11,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:02:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 38278 transitions. [2020-10-05 23:02:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:02:11,813 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:11,813 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:11,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-05 23:02:11,814 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1255672082, now seen corresponding path program 1 times [2020-10-05 23:02:11,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:11,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189020729] [2020-10-05 23:02:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:02:11,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189020729] [2020-10-05 23:02:11,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507923517] [2020-10-05 23:02:11,857 INFO L95 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 [2020-10-05 23:02:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:11,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:02:11,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:02:11,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:11,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:02:11,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604248277] [2020-10-05 23:02:11,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:02:11,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:11,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:02:11,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:02:11,996 INFO L87 Difference]: Start difference. First operand 8342 states and 38278 transitions. Second operand 12 states. [2020-10-05 23:02:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:12,335 INFO L93 Difference]: Finished difference Result 19016 states and 76191 transitions. [2020-10-05 23:02:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:12,335 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:02:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:12,375 INFO L225 Difference]: With dead ends: 19016 [2020-10-05 23:02:12,376 INFO L226 Difference]: Without dead ends: 18998 [2020-10-05 23:02:12,376 INFO L675 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 [2020-10-05 23:02:12,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2020-10-05 23:02:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 8452. [2020-10-05 23:02:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8452 states. [2020-10-05 23:02:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8452 states to 8452 states and 38704 transitions. [2020-10-05 23:02:12,678 INFO L78 Accepts]: Start accepts. Automaton has 8452 states and 38704 transitions. Word has length 19 [2020-10-05 23:02:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:12,678 INFO L479 AbstractCegarLoop]: Abstraction has 8452 states and 38704 transitions. [2020-10-05 23:02:12,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:02:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 8452 states and 38704 transitions. [2020-10-05 23:02:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:02:12,680 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:12,680 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:12,880 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-10-05 23:02:12,881 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:12,881 INFO L82 PathProgramCache]: Analyzing trace with hash 402059005, now seen corresponding path program 1 times [2020-10-05 23:02:12,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:12,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400918011] [2020-10-05 23:02:12,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:12,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400918011] [2020-10-05 23:02:12,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525074338] [2020-10-05 23:02:12,925 INFO L95 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 [2020-10-05 23:02:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:12,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:02:12,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:13,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:13,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:02:13,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288577767] [2020-10-05 23:02:13,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:02:13,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:13,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:02:13,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:02:13,053 INFO L87 Difference]: Start difference. First operand 8452 states and 38704 transitions. Second operand 12 states. [2020-10-05 23:02:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:13,474 INFO L93 Difference]: Finished difference Result 19670 states and 79028 transitions. [2020-10-05 23:02:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:13,475 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:02:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:13,551 INFO L225 Difference]: With dead ends: 19670 [2020-10-05 23:02:13,552 INFO L226 Difference]: Without dead ends: 19645 [2020-10-05 23:02:13,552 INFO L675 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 [2020-10-05 23:02:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19645 states. [2020-10-05 23:02:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19645 to 8480. [2020-10-05 23:02:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8480 states. [2020-10-05 23:02:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 38825 transitions. [2020-10-05 23:02:14,188 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 38825 transitions. Word has length 19 [2020-10-05 23:02:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:14,188 INFO L479 AbstractCegarLoop]: Abstraction has 8480 states and 38825 transitions. [2020-10-05 23:02:14,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:02:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 38825 transitions. [2020-10-05 23:02:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:02:14,189 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:14,189 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:14,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-10-05 23:02:14,390 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:14,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:14,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1976597437, now seen corresponding path program 2 times [2020-10-05 23:02:14,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:14,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628114341] [2020-10-05 23:02:14,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:02:14,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628114341] [2020-10-05 23:02:14,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:14,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:02:14,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668625971] [2020-10-05 23:02:14,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:02:14,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:14,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:02:14,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:02:14,438 INFO L87 Difference]: Start difference. First operand 8480 states and 38825 transitions. Second operand 7 states. [2020-10-05 23:02:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:14,804 INFO L93 Difference]: Finished difference Result 19852 states and 79846 transitions. [2020-10-05 23:02:14,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:14,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:02:14,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:14,854 INFO L225 Difference]: With dead ends: 19852 [2020-10-05 23:02:14,855 INFO L226 Difference]: Without dead ends: 19827 [2020-10-05 23:02:14,855 INFO L675 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 [2020-10-05 23:02:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19827 states. [2020-10-05 23:02:15,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19827 to 8379. [2020-10-05 23:02:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8379 states. [2020-10-05 23:02:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8379 states to 8379 states and 38406 transitions. [2020-10-05 23:02:15,180 INFO L78 Accepts]: Start accepts. Automaton has 8379 states and 38406 transitions. Word has length 19 [2020-10-05 23:02:15,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:15,180 INFO L479 AbstractCegarLoop]: Abstraction has 8379 states and 38406 transitions. [2020-10-05 23:02:15,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:02:15,180 INFO L276 IsEmpty]: Start isEmpty. Operand 8379 states and 38406 transitions. [2020-10-05 23:02:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:02:15,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:15,181 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:15,181 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-05 23:02:15,181 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:15,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1976577008, now seen corresponding path program 2 times [2020-10-05 23:02:15,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:15,182 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933130697] [2020-10-05 23:02:15,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:02:15,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933130697] [2020-10-05 23:02:15,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:15,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:02:15,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865484108] [2020-10-05 23:02:15,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:02:15,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:15,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:02:15,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:02:15,236 INFO L87 Difference]: Start difference. First operand 8379 states and 38406 transitions. Second operand 7 states. [2020-10-05 23:02:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:15,744 INFO L93 Difference]: Finished difference Result 19555 states and 78564 transitions. [2020-10-05 23:02:15,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:15,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:02:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:15,785 INFO L225 Difference]: With dead ends: 19555 [2020-10-05 23:02:15,786 INFO L226 Difference]: Without dead ends: 19530 [2020-10-05 23:02:15,786 INFO L675 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 [2020-10-05 23:02:15,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2020-10-05 23:02:16,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 8317. [2020-10-05 23:02:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8317 states. [2020-10-05 23:02:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 38184 transitions. [2020-10-05 23:02:16,097 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 38184 transitions. Word has length 19 [2020-10-05 23:02:16,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:16,098 INFO L479 AbstractCegarLoop]: Abstraction has 8317 states and 38184 transitions. [2020-10-05 23:02:16,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:02:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 38184 transitions. [2020-10-05 23:02:16,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:02:16,099 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:16,099 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:16,099 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-05 23:02:16,100 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:16,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:16,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1389591796, now seen corresponding path program 1 times [2020-10-05 23:02:16,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:16,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783147685] [2020-10-05 23:02:16,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:02:16,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783147685] [2020-10-05 23:02:16,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760260555] [2020-10-05 23:02:16,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:16,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:16,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:02:16,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:16,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:16,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531874449] [2020-10-05 23:02:16,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:16,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:16,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:16,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:16,335 INFO L87 Difference]: Start difference. First operand 8317 states and 38184 transitions. Second operand 16 states. [2020-10-05 23:02:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:17,262 INFO L93 Difference]: Finished difference Result 26969 states and 101544 transitions. [2020-10-05 23:02:17,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:17,263 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:02:17,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:17,323 INFO L225 Difference]: With dead ends: 26969 [2020-10-05 23:02:17,323 INFO L226 Difference]: Without dead ends: 26957 [2020-10-05 23:02:17,323 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:02:17,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2020-10-05 23:02:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 8204. [2020-10-05 23:02:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2020-10-05 23:02:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 37628 transitions. [2020-10-05 23:02:17,922 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 37628 transitions. Word has length 21 [2020-10-05 23:02:17,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:17,922 INFO L479 AbstractCegarLoop]: Abstraction has 8204 states and 37628 transitions. [2020-10-05 23:02:17,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 37628 transitions. [2020-10-05 23:02:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:02:17,923 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:17,923 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:18,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:18,124 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:18,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:18,125 INFO L82 PathProgramCache]: Analyzing trace with hash 184946636, now seen corresponding path program 2 times [2020-10-05 23:02:18,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:18,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818724131] [2020-10-05 23:02:18,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:02:18,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818724131] [2020-10-05 23:02:18,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92609985] [2020-10-05 23:02:18,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:18,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:02:18,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:18,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:18,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:18,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:02:18,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:18,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:18,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378799510] [2020-10-05 23:02:18,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:18,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:18,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:18,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:18,354 INFO L87 Difference]: Start difference. First operand 8204 states and 37628 transitions. Second operand 16 states. [2020-10-05 23:02:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:19,264 INFO L93 Difference]: Finished difference Result 26661 states and 100277 transitions. [2020-10-05 23:02:19,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:19,265 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:02:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:19,323 INFO L225 Difference]: With dead ends: 26661 [2020-10-05 23:02:19,323 INFO L226 Difference]: Without dead ends: 26645 [2020-10-05 23:02:19,324 INFO L675 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 [2020-10-05 23:02:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26645 states. [2020-10-05 23:02:19,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26645 to 8091. [2020-10-05 23:02:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8091 states. [2020-10-05 23:02:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 37076 transitions. [2020-10-05 23:02:19,698 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 37076 transitions. Word has length 21 [2020-10-05 23:02:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:19,698 INFO L479 AbstractCegarLoop]: Abstraction has 8091 states and 37076 transitions. [2020-10-05 23:02:19,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 37076 transitions. [2020-10-05 23:02:19,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:02:19,699 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:19,699 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:19,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2020-10-05 23:02:19,900 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:19,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:19,901 INFO L82 PathProgramCache]: Analyzing trace with hash -231570740, now seen corresponding path program 3 times [2020-10-05 23:02:19,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:19,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791867451] [2020-10-05 23:02:19,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:19,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791867451] [2020-10-05 23:02:19,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239624482] [2020-10-05 23:02:19,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:20,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:02:20,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:20,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:20,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:20,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:20,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:20,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344418749] [2020-10-05 23:02:20,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:20,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:20,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:20,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:20,368 INFO L87 Difference]: Start difference. First operand 8091 states and 37076 transitions. Second operand 16 states. [2020-10-05 23:02:21,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:21,258 INFO L93 Difference]: Finished difference Result 26686 states and 100402 transitions. [2020-10-05 23:02:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:21,260 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:02:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:21,323 INFO L225 Difference]: With dead ends: 26686 [2020-10-05 23:02:21,323 INFO L226 Difference]: Without dead ends: 26674 [2020-10-05 23:02:21,323 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:02:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26674 states. [2020-10-05 23:02:21,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26674 to 7861. [2020-10-05 23:02:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2020-10-05 23:02:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 36066 transitions. [2020-10-05 23:02:21,685 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 36066 transitions. Word has length 21 [2020-10-05 23:02:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:21,685 INFO L479 AbstractCegarLoop]: Abstraction has 7861 states and 36066 transitions. [2020-10-05 23:02:21,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 36066 transitions. [2020-10-05 23:02:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:02:21,686 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:21,686 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:21,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:21,887 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:21,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:21,888 INFO L82 PathProgramCache]: Analyzing trace with hash -168366002, now seen corresponding path program 4 times [2020-10-05 23:02:21,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:21,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979658866] [2020-10-05 23:02:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:21,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979658866] [2020-10-05 23:02:21,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480597854] [2020-10-05 23:02:21,950 INFO L93 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:22,017 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:02:22,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:22,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:22,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:02:22,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:22,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:22,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824107529] [2020-10-05 23:02:22,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:22,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:22,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:22,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:22,117 INFO L87 Difference]: Start difference. First operand 7861 states and 36066 transitions. Second operand 16 states. [2020-10-05 23:02:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:23,075 INFO L93 Difference]: Finished difference Result 26489 states and 99650 transitions. [2020-10-05 23:02:23,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:23,076 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:02:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:23,140 INFO L225 Difference]: With dead ends: 26489 [2020-10-05 23:02:23,140 INFO L226 Difference]: Without dead ends: 26473 [2020-10-05 23:02:23,141 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:02:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26473 states. [2020-10-05 23:02:24,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26473 to 7748. [2020-10-05 23:02:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7748 states. [2020-10-05 23:02:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7748 states to 7748 states and 35514 transitions. [2020-10-05 23:02:24,239 INFO L78 Accepts]: Start accepts. Automaton has 7748 states and 35514 transitions. Word has length 21 [2020-10-05 23:02:24,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:24,240 INFO L479 AbstractCegarLoop]: Abstraction has 7748 states and 35514 transitions. [2020-10-05 23:02:24,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 7748 states and 35514 transitions. [2020-10-05 23:02:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:02:24,241 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:24,241 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:24,446 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-10-05 23:02:24,447 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:24,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:24,448 INFO L82 PathProgramCache]: Analyzing trace with hash 210203517, now seen corresponding path program 1 times [2020-10-05 23:02:24,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:24,448 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513190403] [2020-10-05 23:02:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:24,481 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:02:24,481 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513190403] [2020-10-05 23:02:24,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:24,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:02:24,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708755213] [2020-10-05 23:02:24,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:02:24,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:24,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:02:24,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:02:24,482 INFO L87 Difference]: Start difference. First operand 7748 states and 35514 transitions. Second operand 5 states. [2020-10-05 23:02:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:24,632 INFO L93 Difference]: Finished difference Result 13251 states and 57501 transitions. [2020-10-05 23:02:24,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:02:24,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:02:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:24,663 INFO L225 Difference]: With dead ends: 13251 [2020-10-05 23:02:24,663 INFO L226 Difference]: Without dead ends: 13220 [2020-10-05 23:02:24,663 INFO L675 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 [2020-10-05 23:02:24,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13220 states. [2020-10-05 23:02:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13220 to 9255. [2020-10-05 23:02:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9255 states. [2020-10-05 23:02:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9255 states to 9255 states and 42368 transitions. [2020-10-05 23:02:24,924 INFO L78 Accepts]: Start accepts. Automaton has 9255 states and 42368 transitions. Word has length 21 [2020-10-05 23:02:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:24,924 INFO L479 AbstractCegarLoop]: Abstraction has 9255 states and 42368 transitions. [2020-10-05 23:02:24,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:02:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 9255 states and 42368 transitions. [2020-10-05 23:02:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:02:24,926 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:24,926 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:24,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-10-05 23:02:24,926 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:24,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1134578958, now seen corresponding path program 5 times [2020-10-05 23:02:24,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:24,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080619736] [2020-10-05 23:02:24,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:02:24,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080619736] [2020-10-05 23:02:24,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:24,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:02:24,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607069037] [2020-10-05 23:02:24,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:02:24,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:24,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:02:24,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:02:24,996 INFO L87 Difference]: Start difference. First operand 9255 states and 42368 transitions. Second operand 9 states. [2020-10-05 23:02:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:25,808 INFO L93 Difference]: Finished difference Result 29788 states and 113841 transitions. [2020-10-05 23:02:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:25,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:02:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:25,869 INFO L225 Difference]: With dead ends: 29788 [2020-10-05 23:02:25,869 INFO L226 Difference]: Without dead ends: 29770 [2020-10-05 23:02:25,870 INFO L675 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 [2020-10-05 23:02:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2020-10-05 23:02:26,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 8964. [2020-10-05 23:02:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2020-10-05 23:02:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 41031 transitions. [2020-10-05 23:02:26,524 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 41031 transitions. Word has length 21 [2020-10-05 23:02:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:26,524 INFO L479 AbstractCegarLoop]: Abstraction has 8964 states and 41031 transitions. [2020-10-05 23:02:26,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:02:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 41031 transitions. [2020-10-05 23:02:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:02:26,526 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:26,526 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:26,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-10-05 23:02:26,526 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:02:26,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1114967118, now seen corresponding path program 6 times [2020-10-05 23:02:26,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:26,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601954357] [2020-10-05 23:02:26,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:02:26,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601954357] [2020-10-05 23:02:26,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:26,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:02:26,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949336889] [2020-10-05 23:02:26,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:02:26,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:26,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:02:26,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:02:26,595 INFO L87 Difference]: Start difference. First operand 8964 states and 41031 transitions. Second operand 9 states. [2020-10-05 23:02:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:27,402 INFO L93 Difference]: Finished difference Result 29379 states and 112099 transitions. [2020-10-05 23:02:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:27,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:02:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:27,465 INFO L225 Difference]: With dead ends: 29379 [2020-10-05 23:02:27,465 INFO L226 Difference]: Without dead ends: 29356 [2020-10-05 23:02:27,465 INFO L675 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 [2020-10-05 23:02:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29356 states. [2020-10-05 23:02:27,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29356 to 8573. [2020-10-05 23:02:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8573 states. [2020-10-05 23:02:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8573 states to 8573 states and 39353 transitions. [2020-10-05 23:02:27,896 INFO L78 Accepts]: Start accepts. Automaton has 8573 states and 39353 transitions. Word has length 21 [2020-10-05 23:02:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:27,896 INFO L479 AbstractCegarLoop]: Abstraction has 8573 states and 39353 transitions. [2020-10-05 23:02:27,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:02:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 8573 states and 39353 transitions. [2020-10-05 23:02:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:02:27,898 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:27,898 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:27,898 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-10-05 23:02:27,898 INFO L427 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]=== [2020-10-05 23:02:27,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:27,898 INFO L82 PathProgramCache]: Analyzing trace with hash 715669452, now seen corresponding path program 1 times [2020-10-05 23:02:27,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:27,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748845486] [2020-10-05 23:02:27,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:27,950 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:27,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748845486] [2020-10-05 23:02:27,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040995460] [2020-10-05 23:02:27,951 INFO L95 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 [2020-10-05 23:02:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:28,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:02:28,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:28,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:28,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:02:28,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454979631] [2020-10-05 23:02:28,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:02:28,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:28,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:02:28,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:02:28,100 INFO L87 Difference]: Start difference. First operand 8573 states and 39353 transitions. Second operand 12 states. [2020-10-05 23:02:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:28,484 INFO L93 Difference]: Finished difference Result 19727 states and 80274 transitions. [2020-10-05 23:02:28,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:28,484 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:02:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:28,526 INFO L225 Difference]: With dead ends: 19727 [2020-10-05 23:02:28,527 INFO L226 Difference]: Without dead ends: 19703 [2020-10-05 23:02:28,527 INFO L675 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 [2020-10-05 23:02:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19703 states. [2020-10-05 23:02:28,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19703 to 8847. [2020-10-05 23:02:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2020-10-05 23:02:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40495 transitions. [2020-10-05 23:02:28,839 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40495 transitions. Word has length 23 [2020-10-05 23:02:28,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:28,840 INFO L479 AbstractCegarLoop]: Abstraction has 8847 states and 40495 transitions. [2020-10-05 23:02:28,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:02:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40495 transitions. [2020-10-05 23:02:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:02:28,841 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:28,842 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:29,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-10-05 23:02:29,043 INFO L427 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]=== [2020-10-05 23:02:29,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash 504272987, now seen corresponding path program 1 times [2020-10-05 23:02:29,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:29,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717929327] [2020-10-05 23:02:29,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:02:29,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717929327] [2020-10-05 23:02:29,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343272729] [2020-10-05 23:02:29,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:29,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:02:29,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:02:29,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:29,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:02:29,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634654910] [2020-10-05 23:02:29,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:02:29,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:29,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:02:29,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:02:29,247 INFO L87 Difference]: Start difference. First operand 8847 states and 40495 transitions. Second operand 12 states. [2020-10-05 23:02:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:29,720 INFO L93 Difference]: Finished difference Result 20694 states and 84261 transitions. [2020-10-05 23:02:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:29,721 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:02:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:29,767 INFO L225 Difference]: With dead ends: 20694 [2020-10-05 23:02:29,767 INFO L226 Difference]: Without dead ends: 20666 [2020-10-05 23:02:29,768 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:02:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20666 states. [2020-10-05 23:02:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20666 to 9115. [2020-10-05 23:02:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9115 states. [2020-10-05 23:02:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 41679 transitions. [2020-10-05 23:02:30,086 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 41679 transitions. Word has length 23 [2020-10-05 23:02:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:30,087 INFO L479 AbstractCegarLoop]: Abstraction has 9115 states and 41679 transitions. [2020-10-05 23:02:30,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:02:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 41679 transitions. [2020-10-05 23:02:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:02:30,090 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:30,090 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:30,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:30,305 INFO L427 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]=== [2020-10-05 23:02:30,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:30,305 INFO L82 PathProgramCache]: Analyzing trace with hash 591685125, now seen corresponding path program 1 times [2020-10-05 23:02:30,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:30,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777461583] [2020-10-05 23:02:30,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:30,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777461583] [2020-10-05 23:02:30,348 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139482284] [2020-10-05 23:02:30,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:30,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:02:30,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:30,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:30,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:02:30,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230870429] [2020-10-05 23:02:30,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:02:30,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:30,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:02:30,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:02:30,475 INFO L87 Difference]: Start difference. First operand 9115 states and 41679 transitions. Second operand 12 states. [2020-10-05 23:02:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:30,877 INFO L93 Difference]: Finished difference Result 21396 states and 87360 transitions. [2020-10-05 23:02:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:30,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:02:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:30,923 INFO L225 Difference]: With dead ends: 21396 [2020-10-05 23:02:30,923 INFO L226 Difference]: Without dead ends: 21359 [2020-10-05 23:02:30,924 INFO L675 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 [2020-10-05 23:02:31,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21359 states. [2020-10-05 23:02:31,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21359 to 9320. [2020-10-05 23:02:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9320 states. [2020-10-05 23:02:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9320 states to 9320 states and 42648 transitions. [2020-10-05 23:02:31,250 INFO L78 Accepts]: Start accepts. Automaton has 9320 states and 42648 transitions. Word has length 23 [2020-10-05 23:02:31,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:31,250 INFO L479 AbstractCegarLoop]: Abstraction has 9320 states and 42648 transitions. [2020-10-05 23:02:31,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:02:31,250 INFO L276 IsEmpty]: Start isEmpty. Operand 9320 states and 42648 transitions. [2020-10-05 23:02:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:02:31,252 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:31,252 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:31,452 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2020-10-05 23:02:31,453 INFO L427 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]=== [2020-10-05 23:02:31,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:31,453 INFO L82 PathProgramCache]: Analyzing trace with hash 142124187, now seen corresponding path program 2 times [2020-10-05 23:02:31,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:31,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076576295] [2020-10-05 23:02:31,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:02:31,499 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076576295] [2020-10-05 23:02:31,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:31,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:02:31,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845388295] [2020-10-05 23:02:31,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:02:31,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:31,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:02:31,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:02:31,501 INFO L87 Difference]: Start difference. First operand 9320 states and 42648 transitions. Second operand 7 states. [2020-10-05 23:02:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:31,859 INFO L93 Difference]: Finished difference Result 21489 states and 87752 transitions. [2020-10-05 23:02:31,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:31,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:02:31,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:31,907 INFO L225 Difference]: With dead ends: 21489 [2020-10-05 23:02:31,908 INFO L226 Difference]: Without dead ends: 21452 [2020-10-05 23:02:31,908 INFO L675 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 [2020-10-05 23:02:32,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2020-10-05 23:02:32,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 9401. [2020-10-05 23:02:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9401 states. [2020-10-05 23:02:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9401 states to 9401 states and 43010 transitions. [2020-10-05 23:02:32,418 INFO L78 Accepts]: Start accepts. Automaton has 9401 states and 43010 transitions. Word has length 23 [2020-10-05 23:02:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:32,418 INFO L479 AbstractCegarLoop]: Abstraction has 9401 states and 43010 transitions. [2020-10-05 23:02:32,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:02:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand 9401 states and 43010 transitions. [2020-10-05 23:02:32,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:02:32,420 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:32,421 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:32,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-10-05 23:02:32,421 INFO L427 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]=== [2020-10-05 23:02:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:32,421 INFO L82 PathProgramCache]: Analyzing trace with hash 142117429, now seen corresponding path program 2 times [2020-10-05 23:02:32,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:32,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94262830] [2020-10-05 23:02:32,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:02:32,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94262830] [2020-10-05 23:02:32,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:32,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:02:32,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514328849] [2020-10-05 23:02:32,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:02:32,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:32,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:02:32,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:02:32,468 INFO L87 Difference]: Start difference. First operand 9401 states and 43010 transitions. Second operand 7 states. [2020-10-05 23:02:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:32,835 INFO L93 Difference]: Finished difference Result 21198 states and 86437 transitions. [2020-10-05 23:02:32,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:32,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:02:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:32,880 INFO L225 Difference]: With dead ends: 21198 [2020-10-05 23:02:32,881 INFO L226 Difference]: Without dead ends: 21161 [2020-10-05 23:02:32,881 INFO L675 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 [2020-10-05 23:02:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21161 states. [2020-10-05 23:02:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21161 to 9396. [2020-10-05 23:02:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9396 states. [2020-10-05 23:02:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9396 states to 9396 states and 42985 transitions. [2020-10-05 23:02:33,210 INFO L78 Accepts]: Start accepts. Automaton has 9396 states and 42985 transitions. Word has length 23 [2020-10-05 23:02:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:33,210 INFO L479 AbstractCegarLoop]: Abstraction has 9396 states and 42985 transitions. [2020-10-05 23:02:33,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:02:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 9396 states and 42985 transitions. [2020-10-05 23:02:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:02:33,212 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:33,212 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:33,212 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-10-05 23:02:33,212 INFO L427 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]=== [2020-10-05 23:02:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash 142103758, now seen corresponding path program 2 times [2020-10-05 23:02:33,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:33,213 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644048066] [2020-10-05 23:02:33,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:02:33,266 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644048066] [2020-10-05 23:02:33,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:33,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:02:33,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854627200] [2020-10-05 23:02:33,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:02:33,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:33,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:02:33,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:02:33,267 INFO L87 Difference]: Start difference. First operand 9396 states and 42985 transitions. Second operand 7 states. [2020-10-05 23:02:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:33,612 INFO L93 Difference]: Finished difference Result 21067 states and 85734 transitions. [2020-10-05 23:02:33,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:02:33,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:02:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:33,656 INFO L225 Difference]: With dead ends: 21067 [2020-10-05 23:02:33,656 INFO L226 Difference]: Without dead ends: 21030 [2020-10-05 23:02:33,656 INFO L675 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 [2020-10-05 23:02:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21030 states. [2020-10-05 23:02:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21030 to 9426. [2020-10-05 23:02:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9426 states. [2020-10-05 23:02:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 43057 transitions. [2020-10-05 23:02:33,985 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 43057 transitions. Word has length 23 [2020-10-05 23:02:33,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:33,985 INFO L479 AbstractCegarLoop]: Abstraction has 9426 states and 43057 transitions. [2020-10-05 23:02:33,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:02:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 43057 transitions. [2020-10-05 23:02:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:33,988 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:33,988 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:33,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-10-05 23:02:33,988 INFO L427 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]=== [2020-10-05 23:02:33,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:33,988 INFO L82 PathProgramCache]: Analyzing trace with hash 925732074, now seen corresponding path program 1 times [2020-10-05 23:02:33,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:33,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580229595] [2020-10-05 23:02:33,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:02:34,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580229595] [2020-10-05 23:02:34,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609211722] [2020-10-05 23:02:34,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-05 23:02:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:34,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:34,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:02:34,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:34,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:34,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93904377] [2020-10-05 23:02:34,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:34,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:34,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:34,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:34,235 INFO L87 Difference]: Start difference. First operand 9426 states and 43057 transitions. Second operand 16 states. [2020-10-05 23:02:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:35,270 INFO L93 Difference]: Finished difference Result 30145 states and 115754 transitions. [2020-10-05 23:02:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:35,270 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:02:35,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:35,331 INFO L225 Difference]: With dead ends: 30145 [2020-10-05 23:02:35,331 INFO L226 Difference]: Without dead ends: 30125 [2020-10-05 23:02:35,332 INFO L675 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 [2020-10-05 23:02:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30125 states. [2020-10-05 23:02:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30125 to 9338. [2020-10-05 23:02:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9338 states. [2020-10-05 23:02:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9338 states to 9338 states and 42582 transitions. [2020-10-05 23:02:35,907 INFO L78 Accepts]: Start accepts. Automaton has 9338 states and 42582 transitions. Word has length 25 [2020-10-05 23:02:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:35,907 INFO L479 AbstractCegarLoop]: Abstraction has 9338 states and 42582 transitions. [2020-10-05 23:02:35,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 9338 states and 42582 transitions. [2020-10-05 23:02:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:35,910 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:35,910 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:36,111 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-10-05 23:02:36,111 INFO L427 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]=== [2020-10-05 23:02:36,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:36,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1013144212, now seen corresponding path program 1 times [2020-10-05 23:02:36,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:36,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342350187] [2020-10-05 23:02:36,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:02:36,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342350187] [2020-10-05 23:02:36,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928872274] [2020-10-05 23:02:36,171 INFO L95 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 [2020-10-05 23:02:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:36,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:36,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:02:36,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:36,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:36,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057799074] [2020-10-05 23:02:36,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:36,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:36,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:36,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:36,340 INFO L87 Difference]: Start difference. First operand 9338 states and 42582 transitions. Second operand 16 states. [2020-10-05 23:02:37,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:37,236 INFO L93 Difference]: Finished difference Result 29696 states and 113916 transitions. [2020-10-05 23:02:37,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:37,236 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:02:37,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:37,297 INFO L225 Difference]: With dead ends: 29696 [2020-10-05 23:02:37,298 INFO L226 Difference]: Without dead ends: 29676 [2020-10-05 23:02:37,298 INFO L675 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 [2020-10-05 23:02:37,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29676 states. [2020-10-05 23:02:37,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29676 to 9291. [2020-10-05 23:02:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9291 states. [2020-10-05 23:02:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 42295 transitions. [2020-10-05 23:02:37,716 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 42295 transitions. Word has length 25 [2020-10-05 23:02:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:37,717 INFO L479 AbstractCegarLoop]: Abstraction has 9291 states and 42295 transitions. [2020-10-05 23:02:37,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 42295 transitions. [2020-10-05 23:02:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:37,720 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:37,720 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:37,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2020-10-05 23:02:37,920 INFO L427 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]=== [2020-10-05 23:02:37,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:37,921 INFO L82 PathProgramCache]: Analyzing trace with hash 563583274, now seen corresponding path program 2 times [2020-10-05 23:02:37,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:37,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410980424] [2020-10-05 23:02:37,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:37,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410980424] [2020-10-05 23:02:37,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575998509] [2020-10-05 23:02:37,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-05 23:02:38,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:02:38,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:38,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:38,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:38,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:38,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:38,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541898395] [2020-10-05 23:02:38,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:38,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:38,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:38,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:38,169 INFO L87 Difference]: Start difference. First operand 9291 states and 42295 transitions. Second operand 16 states. [2020-10-05 23:02:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:39,067 INFO L93 Difference]: Finished difference Result 29267 states and 112142 transitions. [2020-10-05 23:02:39,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:39,067 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:02:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:39,129 INFO L225 Difference]: With dead ends: 29267 [2020-10-05 23:02:39,129 INFO L226 Difference]: Without dead ends: 29245 [2020-10-05 23:02:39,129 INFO L675 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 [2020-10-05 23:02:39,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2020-10-05 23:02:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 9288. [2020-10-05 23:02:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9288 states. [2020-10-05 23:02:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 42242 transitions. [2020-10-05 23:02:39,708 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 42242 transitions. Word has length 25 [2020-10-05 23:02:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:39,708 INFO L479 AbstractCegarLoop]: Abstraction has 9288 states and 42242 transitions. [2020-10-05 23:02:39,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 42242 transitions. [2020-10-05 23:02:39,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:39,711 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:39,711 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:39,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2020-10-05 23:02:39,912 INFO L427 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]=== [2020-10-05 23:02:39,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:39,913 INFO L82 PathProgramCache]: Analyzing trace with hash 563576516, now seen corresponding path program 2 times [2020-10-05 23:02:39,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:39,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616267131] [2020-10-05 23:02:39,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:39,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616267131] [2020-10-05 23:02:39,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419029236] [2020-10-05 23:02:39,983 INFO L93 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 [2020-10-05 23:02:40,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:02:40,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:40,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:40,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:40,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:40,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:40,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144018771] [2020-10-05 23:02:40,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:40,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:40,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:40,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:40,160 INFO L87 Difference]: Start difference. First operand 9288 states and 42242 transitions. Second operand 16 states. [2020-10-05 23:02:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:41,196 INFO L93 Difference]: Finished difference Result 28920 states and 110796 transitions. [2020-10-05 23:02:41,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:41,197 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:02:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:41,255 INFO L225 Difference]: With dead ends: 28920 [2020-10-05 23:02:41,256 INFO L226 Difference]: Without dead ends: 28898 [2020-10-05 23:02:41,256 INFO L675 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 [2020-10-05 23:02:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28898 states. [2020-10-05 23:02:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28898 to 9176. [2020-10-05 23:02:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2020-10-05 23:02:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 41695 transitions. [2020-10-05 23:02:41,655 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 41695 transitions. Word has length 25 [2020-10-05 23:02:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:41,655 INFO L479 AbstractCegarLoop]: Abstraction has 9176 states and 41695 transitions. [2020-10-05 23:02:41,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 41695 transitions. [2020-10-05 23:02:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:41,658 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:41,658 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:41,859 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:41,859 INFO L427 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]=== [2020-10-05 23:02:41,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:41,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2052215638, now seen corresponding path program 3 times [2020-10-05 23:02:41,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:41,860 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325780102] [2020-10-05 23:02:41,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-05 23:02:41,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325780102] [2020-10-05 23:02:41,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491908516] [2020-10-05 23:02:41,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-05 23:02:42,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-05 23:02:42,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:42,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:42,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-05 23:02:42,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:42,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:42,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981665753] [2020-10-05 23:02:42,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:42,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:42,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:42,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:42,113 INFO L87 Difference]: Start difference. First operand 9176 states and 41695 transitions. Second operand 16 states. [2020-10-05 23:02:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:43,008 INFO L93 Difference]: Finished difference Result 29038 states and 111216 transitions. [2020-10-05 23:02:43,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:43,009 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:02:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:43,068 INFO L225 Difference]: With dead ends: 29038 [2020-10-05 23:02:43,068 INFO L226 Difference]: Without dead ends: 29018 [2020-10-05 23:02:43,069 INFO L675 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 [2020-10-05 23:02:43,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29018 states. [2020-10-05 23:02:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29018 to 9000. [2020-10-05 23:02:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9000 states. [2020-10-05 23:02:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9000 states to 9000 states and 40897 transitions. [2020-10-05 23:02:43,468 INFO L78 Accepts]: Start accepts. Automaton has 9000 states and 40897 transitions. Word has length 25 [2020-10-05 23:02:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:43,468 INFO L479 AbstractCegarLoop]: Abstraction has 9000 states and 40897 transitions. [2020-10-05 23:02:43,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:43,468 INFO L276 IsEmpty]: Start isEmpty. Operand 9000 states and 40897 transitions. [2020-10-05 23:02:43,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:43,471 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:43,471 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:43,671 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-10-05 23:02:43,672 INFO L427 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]=== [2020-10-05 23:02:43,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:43,672 INFO L82 PathProgramCache]: Analyzing trace with hash -275395741, now seen corresponding path program 1 times [2020-10-05 23:02:43,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:43,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266982715] [2020-10-05 23:02:43,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:02:43,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266982715] [2020-10-05 23:02:43,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655602608] [2020-10-05 23:02:43,750 INFO L95 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 [2020-10-05 23:02:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:43,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:43,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-05 23:02:43,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:43,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:43,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788126081] [2020-10-05 23:02:43,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:43,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:43,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:43,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:43,917 INFO L87 Difference]: Start difference. First operand 9000 states and 40897 transitions. Second operand 16 states. [2020-10-05 23:02:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:44,989 INFO L93 Difference]: Finished difference Result 29417 states and 113034 transitions. [2020-10-05 23:02:44,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:44,990 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:02:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:45,051 INFO L225 Difference]: With dead ends: 29417 [2020-10-05 23:02:45,051 INFO L226 Difference]: Without dead ends: 29397 [2020-10-05 23:02:45,052 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:02:45,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29397 states. [2020-10-05 23:02:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29397 to 8990. [2020-10-05 23:02:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8990 states. [2020-10-05 23:02:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8990 states to 8990 states and 40786 transitions. [2020-10-05 23:02:45,463 INFO L78 Accepts]: Start accepts. Automaton has 8990 states and 40786 transitions. Word has length 25 [2020-10-05 23:02:45,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:45,463 INFO L479 AbstractCegarLoop]: Abstraction has 8990 states and 40786 transitions. [2020-10-05 23:02:45,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:45,464 INFO L276 IsEmpty]: Start isEmpty. Operand 8990 states and 40786 transitions. [2020-10-05 23:02:45,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:45,466 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:45,467 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:45,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:45,668 INFO L427 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]=== [2020-10-05 23:02:45,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:45,668 INFO L82 PathProgramCache]: Analyzing trace with hash -724963437, now seen corresponding path program 2 times [2020-10-05 23:02:45,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:45,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216054656] [2020-10-05 23:02:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:02:45,732 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216054656] [2020-10-05 23:02:45,732 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845142601] [2020-10-05 23:02:45,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-05 23:02:45,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:02:45,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:45,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:45,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:02:45,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:45,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:45,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59196886] [2020-10-05 23:02:45,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:45,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:45,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:45,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:45,901 INFO L87 Difference]: Start difference. First operand 8990 states and 40786 transitions. Second operand 16 states. [2020-10-05 23:02:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:46,818 INFO L93 Difference]: Finished difference Result 29064 states and 111552 transitions. [2020-10-05 23:02:46,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:46,819 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:02:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:46,880 INFO L225 Difference]: With dead ends: 29064 [2020-10-05 23:02:46,880 INFO L226 Difference]: Without dead ends: 29037 [2020-10-05 23:02:46,881 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:02:47,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29037 states. [2020-10-05 23:02:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29037 to 8953. [2020-10-05 23:02:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8953 states. [2020-10-05 23:02:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8953 states to 8953 states and 40609 transitions. [2020-10-05 23:02:47,283 INFO L78 Accepts]: Start accepts. Automaton has 8953 states and 40609 transitions. Word has length 25 [2020-10-05 23:02:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:47,284 INFO L479 AbstractCegarLoop]: Abstraction has 8953 states and 40609 transitions. [2020-10-05 23:02:47,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:47,284 INFO L276 IsEmpty]: Start isEmpty. Operand 8953 states and 40609 transitions. [2020-10-05 23:02:47,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:47,287 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:47,287 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:47,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2020-10-05 23:02:47,488 INFO L427 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]=== [2020-10-05 23:02:47,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:47,488 INFO L82 PathProgramCache]: Analyzing trace with hash -724977108, now seen corresponding path program 4 times [2020-10-05 23:02:47,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:47,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756495314] [2020-10-05 23:02:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:02:47,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756495314] [2020-10-05 23:02:47,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25405764] [2020-10-05 23:02:47,545 INFO L93 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 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 [2020-10-05 23:02:47,624 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:02:47,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:47,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:47,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:47,722 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:02:47,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:47,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:47,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022344291] [2020-10-05 23:02:47,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:47,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:47,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:47,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:47,724 INFO L87 Difference]: Start difference. First operand 8953 states and 40609 transitions. Second operand 16 states. [2020-10-05 23:02:48,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:48,621 INFO L93 Difference]: Finished difference Result 28523 states and 109227 transitions. [2020-10-05 23:02:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:48,622 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:02:48,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:48,680 INFO L225 Difference]: With dead ends: 28523 [2020-10-05 23:02:48,680 INFO L226 Difference]: Without dead ends: 28501 [2020-10-05 23:02:48,681 INFO L675 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 [2020-10-05 23:02:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28501 states. [2020-10-05 23:02:49,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28501 to 8841. [2020-10-05 23:02:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8841 states. [2020-10-05 23:02:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 40062 transitions. [2020-10-05 23:02:49,210 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 40062 transitions. Word has length 25 [2020-10-05 23:02:49,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:49,210 INFO L479 AbstractCegarLoop]: Abstraction has 8841 states and 40062 transitions. [2020-10-05 23:02:49,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 40062 transitions. [2020-10-05 23:02:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:49,214 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:49,214 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:49,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:49,415 INFO L427 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]=== [2020-10-05 23:02:49,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:49,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1969402905, now seen corresponding path program 3 times [2020-10-05 23:02:49,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:49,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082066964] [2020-10-05 23:02:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:49,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082066964] [2020-10-05 23:02:49,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906843483] [2020-10-05 23:02:49,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-05 23:02:49,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:02:49,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:49,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:49,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:49,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:49,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:49,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677475858] [2020-10-05 23:02:49,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:49,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:49,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:49,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:49,717 INFO L87 Difference]: Start difference. First operand 8841 states and 40062 transitions. Second operand 16 states. [2020-10-05 23:02:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:50,698 INFO L93 Difference]: Finished difference Result 28636 states and 109852 transitions. [2020-10-05 23:02:50,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:50,699 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:02:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:50,759 INFO L225 Difference]: With dead ends: 28636 [2020-10-05 23:02:50,759 INFO L226 Difference]: Without dead ends: 28616 [2020-10-05 23:02:50,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:02:50,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28616 states. [2020-10-05 23:02:51,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28616 to 8702. [2020-10-05 23:02:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8702 states. [2020-10-05 23:02:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8702 states to 8702 states and 39438 transitions. [2020-10-05 23:02:51,148 INFO L78 Accepts]: Start accepts. Automaton has 8702 states and 39438 transitions. Word has length 25 [2020-10-05 23:02:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:51,148 INFO L479 AbstractCegarLoop]: Abstraction has 8702 states and 39438 transitions. [2020-10-05 23:02:51,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 8702 states and 39438 transitions. [2020-10-05 23:02:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:51,151 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:51,151 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:51,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2020-10-05 23:02:51,357 INFO L427 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]=== [2020-10-05 23:02:51,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:51,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1576190868, now seen corresponding path program 3 times [2020-10-05 23:02:51,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:51,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444091866] [2020-10-05 23:02:51,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:51,419 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444091866] [2020-10-05 23:02:51,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419088774] [2020-10-05 23:02:51,420 INFO L93 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 [2020-10-05 23:02:51,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:02:51,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:51,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:51,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:51,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:51,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:51,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570919362] [2020-10-05 23:02:51,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:51,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:51,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:51,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:51,614 INFO L87 Difference]: Start difference. First operand 8702 states and 39438 transitions. Second operand 16 states. [2020-10-05 23:02:52,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:52,462 INFO L93 Difference]: Finished difference Result 28297 states and 108461 transitions. [2020-10-05 23:02:52,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:52,465 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:02:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:52,524 INFO L225 Difference]: With dead ends: 28297 [2020-10-05 23:02:52,524 INFO L226 Difference]: Without dead ends: 28277 [2020-10-05 23:02:52,524 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:02:52,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28277 states. [2020-10-05 23:02:52,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28277 to 8596. [2020-10-05 23:02:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8596 states. [2020-10-05 23:02:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 38978 transitions. [2020-10-05 23:02:52,911 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 38978 transitions. Word has length 25 [2020-10-05 23:02:52,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:52,911 INFO L479 AbstractCegarLoop]: Abstraction has 8596 states and 38978 transitions. [2020-10-05 23:02:52,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:52,911 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 38978 transitions. [2020-10-05 23:02:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:52,914 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:52,914 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:53,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:53,115 INFO L427 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]=== [2020-10-05 23:02:53,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:53,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1673729315, now seen corresponding path program 4 times [2020-10-05 23:02:53,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:53,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517273272] [2020-10-05 23:02:53,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:53,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517273272] [2020-10-05 23:02:53,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248607101] [2020-10-05 23:02:53,174 INFO L93 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 [2020-10-05 23:02:53,246 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:02:53,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:53,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:53,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:53,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:53,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:53,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587698467] [2020-10-05 23:02:53,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:53,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:53,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:53,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:53,340 INFO L87 Difference]: Start difference. First operand 8596 states and 38978 transitions. Second operand 16 states. [2020-10-05 23:02:54,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:54,421 INFO L93 Difference]: Finished difference Result 28565 states and 109596 transitions. [2020-10-05 23:02:54,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:54,422 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:02:54,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:54,611 INFO L225 Difference]: With dead ends: 28565 [2020-10-05 23:02:54,612 INFO L226 Difference]: Without dead ends: 28538 [2020-10-05 23:02:54,612 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:02:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2020-10-05 23:02:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8563. [2020-10-05 23:02:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8563 states. [2020-10-05 23:02:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 38809 transitions. [2020-10-05 23:02:54,987 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 38809 transitions. Word has length 25 [2020-10-05 23:02:54,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:54,987 INFO L479 AbstractCegarLoop]: Abstraction has 8563 states and 38809 transitions. [2020-10-05 23:02:54,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 38809 transitions. [2020-10-05 23:02:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:54,990 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:54,990 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:55,191 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2020-10-05 23:02:55,191 INFO L427 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]=== [2020-10-05 23:02:55,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1673708886, now seen corresponding path program 4 times [2020-10-05 23:02:55,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:55,192 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537681754] [2020-10-05 23:02:55,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:55,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537681754] [2020-10-05 23:02:55,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971702490] [2020-10-05 23:02:55,259 INFO L93 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 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 [2020-10-05 23:02:55,360 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:02:55,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:02:55,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:02:55,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:02:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-05 23:02:55,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:02:55,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:02:55,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686637662] [2020-10-05 23:02:55,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:02:55,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:55,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:02:55,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:02:55,484 INFO L87 Difference]: Start difference. First operand 8563 states and 38809 transitions. Second operand 16 states. [2020-10-05 23:02:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:56,474 INFO L93 Difference]: Finished difference Result 28213 states and 108237 transitions. [2020-10-05 23:02:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:56,474 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:02:56,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:56,534 INFO L225 Difference]: With dead ends: 28213 [2020-10-05 23:02:56,534 INFO L226 Difference]: Without dead ends: 28186 [2020-10-05 23:02:56,534 INFO L675 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 [2020-10-05 23:02:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28186 states. [2020-10-05 23:02:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28186 to 8421. [2020-10-05 23:02:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8421 states. [2020-10-05 23:02:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8421 states to 8421 states and 38146 transitions. [2020-10-05 23:02:56,917 INFO L78 Accepts]: Start accepts. Automaton has 8421 states and 38146 transitions. Word has length 25 [2020-10-05 23:02:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:56,917 INFO L479 AbstractCegarLoop]: Abstraction has 8421 states and 38146 transitions. [2020-10-05 23:02:56,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:02:56,918 INFO L276 IsEmpty]: Start isEmpty. Operand 8421 states and 38146 transitions. [2020-10-05 23:02:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:56,920 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:56,920 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:57,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:02:57,121 INFO L427 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]=== [2020-10-05 23:02:57,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:57,122 INFO L82 PathProgramCache]: Analyzing trace with hash -857609261, now seen corresponding path program 5 times [2020-10-05 23:02:57,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:57,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051071474] [2020-10-05 23:02:57,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:02:57,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051071474] [2020-10-05 23:02:57,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:57,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:02:57,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202388698] [2020-10-05 23:02:57,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:02:57,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:57,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:02:57,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:02:57,185 INFO L87 Difference]: Start difference. First operand 8421 states and 38146 transitions. Second operand 9 states. [2020-10-05 23:02:58,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:58,216 INFO L93 Difference]: Finished difference Result 28226 states and 108274 transitions. [2020-10-05 23:02:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:58,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:02:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:58,277 INFO L225 Difference]: With dead ends: 28226 [2020-10-05 23:02:58,277 INFO L226 Difference]: Without dead ends: 28206 [2020-10-05 23:02:58,277 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:02:58,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28206 states. [2020-10-05 23:02:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28206 to 8277. [2020-10-05 23:02:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8277 states. [2020-10-05 23:02:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 37487 transitions. [2020-10-05 23:02:58,667 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 37487 transitions. Word has length 25 [2020-10-05 23:02:58,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:02:58,667 INFO L479 AbstractCegarLoop]: Abstraction has 8277 states and 37487 transitions. [2020-10-05 23:02:58,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:02:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 37487 transitions. [2020-10-05 23:02:58,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:02:58,670 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:02:58,670 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:02:58,670 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-10-05 23:02:58,670 INFO L427 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]=== [2020-10-05 23:02:58,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:02:58,671 INFO L82 PathProgramCache]: Analyzing trace with hash -857622932, now seen corresponding path program 5 times [2020-10-05 23:02:58,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:02:58,671 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500064090] [2020-10-05 23:02:58,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:02:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:02:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:02:58,732 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500064090] [2020-10-05 23:02:58,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:02:58,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:02:58,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820037357] [2020-10-05 23:02:58,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:02:58,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:02:58,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:02:58,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:02:58,733 INFO L87 Difference]: Start difference. First operand 8277 states and 37487 transitions. Second operand 9 states. [2020-10-05 23:02:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:02:59,556 INFO L93 Difference]: Finished difference Result 27801 states and 106552 transitions. [2020-10-05 23:02:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:02:59,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:02:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:02:59,615 INFO L225 Difference]: With dead ends: 27801 [2020-10-05 23:02:59,616 INFO L226 Difference]: Without dead ends: 27781 [2020-10-05 23:02:59,616 INFO L675 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 [2020-10-05 23:02:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27781 states. [2020-10-05 23:03:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27781 to 8127. [2020-10-05 23:03:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8127 states. [2020-10-05 23:03:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8127 states to 8127 states and 36806 transitions. [2020-10-05 23:03:00,132 INFO L78 Accepts]: Start accepts. Automaton has 8127 states and 36806 transitions. Word has length 25 [2020-10-05 23:03:00,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:00,132 INFO L479 AbstractCegarLoop]: Abstraction has 8127 states and 36806 transitions. [2020-10-05 23:03:00,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:03:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 8127 states and 36806 transitions. [2020-10-05 23:03:00,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:03:00,135 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:00,135 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:00,135 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-10-05 23:03:00,135 INFO L427 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]=== [2020-10-05 23:03:00,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:00,135 INFO L82 PathProgramCache]: Analyzing trace with hash -864096941, now seen corresponding path program 6 times [2020-10-05 23:03:00,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:00,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346745214] [2020-10-05 23:03:00,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:03:00,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346745214] [2020-10-05 23:03:00,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:00,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:03:00,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178223952] [2020-10-05 23:03:00,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:03:00,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:00,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:03:00,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:03:00,200 INFO L87 Difference]: Start difference. First operand 8127 states and 36806 transitions. Second operand 9 states. [2020-10-05 23:03:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:01,158 INFO L93 Difference]: Finished difference Result 27548 states and 105447 transitions. [2020-10-05 23:03:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:01,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:03:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:01,223 INFO L225 Difference]: With dead ends: 27548 [2020-10-05 23:03:01,223 INFO L226 Difference]: Without dead ends: 27521 [2020-10-05 23:03:01,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:03:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27521 states. [2020-10-05 23:03:01,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27521 to 7841. [2020-10-05 23:03:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7841 states. [2020-10-05 23:03:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7841 states to 7841 states and 35578 transitions. [2020-10-05 23:03:01,597 INFO L78 Accepts]: Start accepts. Automaton has 7841 states and 35578 transitions. Word has length 25 [2020-10-05 23:03:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:01,598 INFO L479 AbstractCegarLoop]: Abstraction has 7841 states and 35578 transitions. [2020-10-05 23:03:01,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:03:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 7841 states and 35578 transitions. [2020-10-05 23:03:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:03:01,601 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:01,601 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:01,601 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-10-05 23:03:01,601 INFO L427 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]=== [2020-10-05 23:03:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash -864117370, now seen corresponding path program 5 times [2020-10-05 23:03:01,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:01,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236063215] [2020-10-05 23:03:01,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:03:01,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236063215] [2020-10-05 23:03:01,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:01,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:03:01,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775616755] [2020-10-05 23:03:01,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:03:01,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:01,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:03:01,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:03:01,663 INFO L87 Difference]: Start difference. First operand 7841 states and 35578 transitions. Second operand 9 states. [2020-10-05 23:03:02,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:02,487 INFO L93 Difference]: Finished difference Result 27167 states and 103966 transitions. [2020-10-05 23:03:02,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:02,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:03:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:02,546 INFO L225 Difference]: With dead ends: 27167 [2020-10-05 23:03:02,546 INFO L226 Difference]: Without dead ends: 27147 [2020-10-05 23:03:02,547 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:03:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27147 states. [2020-10-05 23:03:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27147 to 7743. [2020-10-05 23:03:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7743 states. [2020-10-05 23:03:02,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7743 states to 7743 states and 35142 transitions. [2020-10-05 23:03:02,912 INFO L78 Accepts]: Start accepts. Automaton has 7743 states and 35142 transitions. Word has length 25 [2020-10-05 23:03:02,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:02,912 INFO L479 AbstractCegarLoop]: Abstraction has 7743 states and 35142 transitions. [2020-10-05 23:03:02,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:03:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 7743 states and 35142 transitions. [2020-10-05 23:03:02,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:03:02,915 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:02,915 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:02,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-10-05 23:03:02,915 INFO L427 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]=== [2020-10-05 23:03:02,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:02,915 INFO L82 PathProgramCache]: Analyzing trace with hash -877234772, now seen corresponding path program 6 times [2020-10-05 23:03:02,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:02,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960580025] [2020-10-05 23:03:02,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:03:02,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960580025] [2020-10-05 23:03:02,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:02,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:03:02,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56291084] [2020-10-05 23:03:02,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:03:02,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:02,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:03:02,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:03:02,970 INFO L87 Difference]: Start difference. First operand 7743 states and 35142 transitions. Second operand 9 states. [2020-10-05 23:03:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:03,850 INFO L93 Difference]: Finished difference Result 26955 states and 103085 transitions. [2020-10-05 23:03:03,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:03,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:03:03,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:03,905 INFO L225 Difference]: With dead ends: 26955 [2020-10-05 23:03:03,905 INFO L226 Difference]: Without dead ends: 26928 [2020-10-05 23:03:03,905 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:03:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26928 states. [2020-10-05 23:03:04,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26928 to 7532. [2020-10-05 23:03:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7532 states. [2020-10-05 23:03:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7532 states to 7532 states and 34256 transitions. [2020-10-05 23:03:04,259 INFO L78 Accepts]: Start accepts. Automaton has 7532 states and 34256 transitions. Word has length 25 [2020-10-05 23:03:04,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:04,260 INFO L479 AbstractCegarLoop]: Abstraction has 7532 states and 34256 transitions. [2020-10-05 23:03:04,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:03:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 7532 states and 34256 transitions. [2020-10-05 23:03:04,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:03:04,263 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:04,263 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:04,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-10-05 23:03:04,263 INFO L427 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]=== [2020-10-05 23:03:04,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:04,263 INFO L82 PathProgramCache]: Analyzing trace with hash -877241530, now seen corresponding path program 6 times [2020-10-05 23:03:04,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:04,264 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325703521] [2020-10-05 23:03:04,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:03:04,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325703521] [2020-10-05 23:03:04,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:04,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:03:04,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221207206] [2020-10-05 23:03:04,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:03:04,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:04,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:03:04,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:03:04,341 INFO L87 Difference]: Start difference. First operand 7532 states and 34256 transitions. Second operand 9 states. [2020-10-05 23:03:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:05,626 INFO L93 Difference]: Finished difference Result 26632 states and 101828 transitions. [2020-10-05 23:03:05,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:05,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:03:05,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:05,721 INFO L225 Difference]: With dead ends: 26632 [2020-10-05 23:03:05,721 INFO L226 Difference]: Without dead ends: 26605 [2020-10-05 23:03:05,722 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:03:06,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26605 states. [2020-10-05 23:03:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26605 to 7269. [2020-10-05 23:03:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7269 states. [2020-10-05 23:03:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7269 states to 7269 states and 33154 transitions. [2020-10-05 23:03:06,216 INFO L78 Accepts]: Start accepts. Automaton has 7269 states and 33154 transitions. Word has length 25 [2020-10-05 23:03:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:06,217 INFO L479 AbstractCegarLoop]: Abstraction has 7269 states and 33154 transitions. [2020-10-05 23:03:06,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:03:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 7269 states and 33154 transitions. [2020-10-05 23:03:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:03:06,219 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:06,219 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:06,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-10-05 23:03:06,220 INFO L427 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]=== [2020-10-05 23:03:06,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:06,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1311164244, now seen corresponding path program 1 times [2020-10-05 23:03:06,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:06,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640905220] [2020-10-05 23:03:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-05 23:03:06,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640905220] [2020-10-05 23:03:06,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:06,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:03:06,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411785491] [2020-10-05 23:03:06,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:03:06,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:06,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:03:06,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:03:06,248 INFO L87 Difference]: Start difference. First operand 7269 states and 33154 transitions. Second operand 5 states. [2020-10-05 23:03:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:06,397 INFO L93 Difference]: Finished difference Result 11919 states and 51979 transitions. [2020-10-05 23:03:06,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:03:06,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-10-05 23:03:06,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:06,423 INFO L225 Difference]: With dead ends: 11919 [2020-10-05 23:03:06,423 INFO L226 Difference]: Without dead ends: 11887 [2020-10-05 23:03:06,424 INFO L675 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 [2020-10-05 23:03:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-10-05 23:03:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 8560. [2020-10-05 23:03:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8560 states. [2020-10-05 23:03:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 38495 transitions. [2020-10-05 23:03:06,652 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 38495 transitions. Word has length 25 [2020-10-05 23:03:06,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:06,652 INFO L479 AbstractCegarLoop]: Abstraction has 8560 states and 38495 transitions. [2020-10-05 23:03:06,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:03:06,652 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 38495 transitions. [2020-10-05 23:03:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-05 23:03:06,656 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:06,656 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:06,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-10-05 23:03:06,656 INFO L427 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]=== [2020-10-05 23:03:06,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:06,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1986416772, now seen corresponding path program 1 times [2020-10-05 23:03:06,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:06,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001553101] [2020-10-05 23:03:06,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:03:06,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:03:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:03:06,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:03:06,675 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:03:06,675 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:03:06,675 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-10-05 23:03:06,675 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:03:06,676 WARN L363 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-10-05 23:03:06,676 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-10-05 23:03:06,698 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,698 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,698 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,698 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,699 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,699 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,699 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,699 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,699 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,699 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,699 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,700 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,700 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,700 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,700 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,701 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,701 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,701 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,701 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,701 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,701 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,702 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,702 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,702 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,702 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,702 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,702 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,702 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,703 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,703 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,703 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,703 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,703 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,703 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,703 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,705 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,705 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,705 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,705 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,705 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,705 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,705 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,706 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,706 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,707 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,707 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,708 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,708 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,715 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,716 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,716 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,717 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,717 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,718 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,718 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,719 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,719 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,720 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,720 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,721 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,721 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,721 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,721 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,721 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,722 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,726 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,726 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,727 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,727 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,727 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,728 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,728 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,728 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,728 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,728 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,729 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,729 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,730 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,730 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,730 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,731 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,731 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,731 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,731 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,731 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,733 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,733 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,734 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,734 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,734 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,735 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,735 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,736 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,737 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,737 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,738 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,738 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,739 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,739 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,740 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,740 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,741 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,741 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,742 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,742 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,743 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,743 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:03:06,744 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-10-05 23:03:06,744 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:03:06,744 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:03:06,744 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 23:03:06,744 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:03:06,744 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:03:06,745 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:03:06,745 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:03:06,745 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:03:06,746 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 138 transitions, 396 flow [2020-10-05 23:03:06,746 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 156 places, 138 transitions, 396 flow [2020-10-05 23:03:06,764 INFO L129 PetriNetUnfolder]: 9/173 cut-off events. [2020-10-05 23:03:06,764 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-05 23:03:06,765 INFO L80 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 173 events. 9/173 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 284 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 208. Up to 14 conditions per place. [2020-10-05 23:03:06,770 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 156 places, 138 transitions, 396 flow [2020-10-05 23:03:06,787 INFO L129 PetriNetUnfolder]: 9/173 cut-off events. [2020-10-05 23:03:06,787 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-10-05 23:03:06,788 INFO L80 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 173 events. 9/173 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 284 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 208. Up to 14 conditions per place. [2020-10-05 23:03:06,793 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2020-10-05 23:03:06,793 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 23:03:08,686 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-10-05 23:03:08,996 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-10-05 23:03:09,133 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-10-05 23:03:09,147 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3678 [2020-10-05 23:03:09,148 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2020-10-05 23:03:09,148 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 45 transitions, 210 flow [2020-10-05 23:03:10,589 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2020-10-05 23:03:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2020-10-05 23:03:10,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-05 23:03:10,590 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:10,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-05 23:03:10,590 INFO L427 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]=== [2020-10-05 23:03:10,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:10,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1298891, now seen corresponding path program 1 times [2020-10-05 23:03:10,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:10,590 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931078563] [2020-10-05 23:03:10,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:03:10,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931078563] [2020-10-05 23:03:10,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:10,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:03:10,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691965672] [2020-10-05 23:03:10,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:03:10,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:10,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:03:10,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:03:10,601 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2020-10-05 23:03:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:10,756 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2020-10-05 23:03:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:03:10,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-05 23:03:10,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:10,803 INFO L225 Difference]: With dead ends: 17885 [2020-10-05 23:03:10,803 INFO L226 Difference]: Without dead ends: 16791 [2020-10-05 23:03:10,803 INFO L675 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 [2020-10-05 23:03:11,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2020-10-05 23:03:11,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16791. [2020-10-05 23:03:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16791 states. [2020-10-05 23:03:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16791 states to 16791 states and 86558 transitions. [2020-10-05 23:03:11,800 INFO L78 Accepts]: Start accepts. Automaton has 16791 states and 86558 transitions. Word has length 3 [2020-10-05 23:03:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:11,800 INFO L479 AbstractCegarLoop]: Abstraction has 16791 states and 86558 transitions. [2020-10-05 23:03:11,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:03:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand 16791 states and 86558 transitions. [2020-10-05 23:03:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:03:11,800 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:11,801 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:11,801 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-10-05 23:03:11,801 INFO L427 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]=== [2020-10-05 23:03:11,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:11,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1091574945, now seen corresponding path program 1 times [2020-10-05 23:03:11,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:11,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413306115] [2020-10-05 23:03:11,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:03:11,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413306115] [2020-10-05 23:03:11,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:11,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:03:11,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158804021] [2020-10-05 23:03:11,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:03:11,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:11,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:03:11,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:03:11,830 INFO L87 Difference]: Start difference. First operand 16791 states and 86558 transitions. Second operand 5 states. [2020-10-05 23:03:12,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:12,082 INFO L93 Difference]: Finished difference Result 30985 states and 150574 transitions. [2020-10-05 23:03:12,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:03:12,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-05 23:03:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:12,171 INFO L225 Difference]: With dead ends: 30985 [2020-10-05 23:03:12,171 INFO L226 Difference]: Without dead ends: 30977 [2020-10-05 23:03:12,171 INFO L675 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 [2020-10-05 23:03:12,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30977 states. [2020-10-05 23:03:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30977 to 19868. [2020-10-05 23:03:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19868 states. [2020-10-05 23:03:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19868 states to 19868 states and 103363 transitions. [2020-10-05 23:03:13,170 INFO L78 Accepts]: Start accepts. Automaton has 19868 states and 103363 transitions. Word has length 9 [2020-10-05 23:03:13,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:13,170 INFO L479 AbstractCegarLoop]: Abstraction has 19868 states and 103363 transitions. [2020-10-05 23:03:13,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:03:13,170 INFO L276 IsEmpty]: Start isEmpty. Operand 19868 states and 103363 transitions. [2020-10-05 23:03:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:03:13,170 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:13,170 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:13,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-10-05 23:03:13,171 INFO L427 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]=== [2020-10-05 23:03:13,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:13,171 INFO L82 PathProgramCache]: Analyzing trace with hash -231509072, now seen corresponding path program 1 times [2020-10-05 23:03:13,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:13,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882601712] [2020-10-05 23:03:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:03:13,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882601712] [2020-10-05 23:03:13,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:13,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:03:13,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846290727] [2020-10-05 23:03:13,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:03:13,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:13,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:03:13,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:03:13,196 INFO L87 Difference]: Start difference. First operand 19868 states and 103363 transitions. Second operand 5 states. [2020-10-05 23:03:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:13,471 INFO L93 Difference]: Finished difference Result 36296 states and 178836 transitions. [2020-10-05 23:03:13,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:03:13,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:03:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:13,574 INFO L225 Difference]: With dead ends: 36296 [2020-10-05 23:03:13,574 INFO L226 Difference]: Without dead ends: 36280 [2020-10-05 23:03:13,575 INFO L675 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 [2020-10-05 23:03:14,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36280 states. [2020-10-05 23:03:14,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36280 to 23806. [2020-10-05 23:03:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23806 states. [2020-10-05 23:03:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 125455 transitions. [2020-10-05 23:03:17,062 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 125455 transitions. Word has length 13 [2020-10-05 23:03:17,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:17,062 INFO L479 AbstractCegarLoop]: Abstraction has 23806 states and 125455 transitions. [2020-10-05 23:03:17,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:03:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 125455 transitions. [2020-10-05 23:03:17,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:03:17,062 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:17,062 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:17,063 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-10-05 23:03:17,063 INFO L427 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]=== [2020-10-05 23:03:17,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:17,063 INFO L82 PathProgramCache]: Analyzing trace with hash -588793474, now seen corresponding path program 1 times [2020-10-05 23:03:17,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:17,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59104615] [2020-10-05 23:03:17,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:03:17,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59104615] [2020-10-05 23:03:17,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048506476] [2020-10-05 23:03:17,100 INFO L95 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 [2020-10-05 23:03:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:17,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:03:17,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:03:17,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:17,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:03:17,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042335862] [2020-10-05 23:03:17,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:03:17,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:17,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:03:17,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:03:17,254 INFO L87 Difference]: Start difference. First operand 23806 states and 125455 transitions. Second operand 12 states. [2020-10-05 23:03:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:17,894 INFO L93 Difference]: Finished difference Result 56720 states and 262685 transitions. [2020-10-05 23:03:17,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:03:17,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-10-05 23:03:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:18,056 INFO L225 Difference]: With dead ends: 56720 [2020-10-05 23:03:18,056 INFO L226 Difference]: Without dead ends: 56704 [2020-10-05 23:03:18,057 INFO L675 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 [2020-10-05 23:03:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56704 states. [2020-10-05 23:03:19,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56704 to 23629. [2020-10-05 23:03:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23629 states. [2020-10-05 23:03:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23629 states to 23629 states and 124418 transitions. [2020-10-05 23:03:19,516 INFO L78 Accepts]: Start accepts. Automaton has 23629 states and 124418 transitions. Word has length 15 [2020-10-05 23:03:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:19,516 INFO L479 AbstractCegarLoop]: Abstraction has 23629 states and 124418 transitions. [2020-10-05 23:03:19,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:03:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 23629 states and 124418 transitions. [2020-10-05 23:03:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:03:19,517 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:19,517 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:19,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-10-05 23:03:19,725 INFO L427 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]=== [2020-10-05 23:03:19,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:19,725 INFO L82 PathProgramCache]: Analyzing trace with hash 858081470, now seen corresponding path program 2 times [2020-10-05 23:03:19,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:19,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856256621] [2020-10-05 23:03:19,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:03:19,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856256621] [2020-10-05 23:03:19,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:19,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:03:19,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911703255] [2020-10-05 23:03:19,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:03:19,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:19,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:03:19,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:03:19,769 INFO L87 Difference]: Start difference. First operand 23629 states and 124418 transitions. Second operand 7 states. [2020-10-05 23:03:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:20,482 INFO L93 Difference]: Finished difference Result 58078 states and 269185 transitions. [2020-10-05 23:03:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:03:20,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-05 23:03:20,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:20,640 INFO L225 Difference]: With dead ends: 58078 [2020-10-05 23:03:20,640 INFO L226 Difference]: Without dead ends: 58061 [2020-10-05 23:03:20,640 INFO L675 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 [2020-10-05 23:03:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58061 states. [2020-10-05 23:03:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58061 to 23109. [2020-10-05 23:03:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23109 states. [2020-10-05 23:03:22,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 121651 transitions. [2020-10-05 23:03:22,548 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 121651 transitions. Word has length 15 [2020-10-05 23:03:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:22,549 INFO L479 AbstractCegarLoop]: Abstraction has 23109 states and 121651 transitions. [2020-10-05 23:03:22,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:03:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 121651 transitions. [2020-10-05 23:03:22,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:03:22,549 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:22,549 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:22,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-10-05 23:03:22,550 INFO L427 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]=== [2020-10-05 23:03:22,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash 704376303, now seen corresponding path program 1 times [2020-10-05 23:03:22,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:22,550 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358968448] [2020-10-05 23:03:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:03:22,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358968448] [2020-10-05 23:03:22,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:22,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:03:22,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636913834] [2020-10-05 23:03:22,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:03:22,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:22,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:03:22,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:03:22,577 INFO L87 Difference]: Start difference. First operand 23109 states and 121651 transitions. Second operand 5 states. [2020-10-05 23:03:22,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:22,898 INFO L93 Difference]: Finished difference Result 41885 states and 209629 transitions. [2020-10-05 23:03:22,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:03:22,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:03:22,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:23,018 INFO L225 Difference]: With dead ends: 41885 [2020-10-05 23:03:23,018 INFO L226 Difference]: Without dead ends: 41856 [2020-10-05 23:03:23,018 INFO L675 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 [2020-10-05 23:03:23,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41856 states. [2020-10-05 23:03:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41856 to 28237. [2020-10-05 23:03:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28237 states. [2020-10-05 23:03:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28237 states to 28237 states and 150261 transitions. [2020-10-05 23:03:24,318 INFO L78 Accepts]: Start accepts. Automaton has 28237 states and 150261 transitions. Word has length 17 [2020-10-05 23:03:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:24,318 INFO L479 AbstractCegarLoop]: Abstraction has 28237 states and 150261 transitions. [2020-10-05 23:03:24,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:03:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 28237 states and 150261 transitions. [2020-10-05 23:03:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:03:24,319 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:24,319 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:24,319 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-10-05 23:03:24,319 INFO L427 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]=== [2020-10-05 23:03:24,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:24,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1918672061, now seen corresponding path program 1 times [2020-10-05 23:03:24,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:24,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834003908] [2020-10-05 23:03:24,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:03:24,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834003908] [2020-10-05 23:03:24,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959889721] [2020-10-05 23:03:24,367 INFO L95 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 [2020-10-05 23:03:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:24,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:03:24,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:03:24,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:24,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:03:24,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706289629] [2020-10-05 23:03:24,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:03:24,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:24,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:03:24,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:03:24,581 INFO L87 Difference]: Start difference. First operand 28237 states and 150261 transitions. Second operand 12 states. [2020-10-05 23:03:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:27,287 INFO L93 Difference]: Finished difference Result 66831 states and 314874 transitions. [2020-10-05 23:03:27,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:03:27,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:03:27,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:27,465 INFO L225 Difference]: With dead ends: 66831 [2020-10-05 23:03:27,466 INFO L226 Difference]: Without dead ends: 66807 [2020-10-05 23:03:27,466 INFO L675 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 [2020-10-05 23:03:28,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66807 states. [2020-10-05 23:03:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66807 to 28673. [2020-10-05 23:03:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28673 states. [2020-10-05 23:03:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28673 states to 28673 states and 152375 transitions. [2020-10-05 23:03:29,065 INFO L78 Accepts]: Start accepts. Automaton has 28673 states and 152375 transitions. Word has length 19 [2020-10-05 23:03:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:29,065 INFO L479 AbstractCegarLoop]: Abstraction has 28673 states and 152375 transitions. [2020-10-05 23:03:29,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:03:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 28673 states and 152375 transitions. [2020-10-05 23:03:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:03:29,066 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:29,066 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:29,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2020-10-05 23:03:29,280 INFO L427 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]=== [2020-10-05 23:03:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:29,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1064014108, now seen corresponding path program 1 times [2020-10-05 23:03:29,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:29,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314496274] [2020-10-05 23:03:29,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:03:29,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314496274] [2020-10-05 23:03:29,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991580444] [2020-10-05 23:03:29,321 INFO L95 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 [2020-10-05 23:03:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:29,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:03:29,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:03:29,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:29,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:03:29,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319007574] [2020-10-05 23:03:29,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:03:29,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:29,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:03:29,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:03:29,462 INFO L87 Difference]: Start difference. First operand 28673 states and 152375 transitions. Second operand 12 states. [2020-10-05 23:03:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:30,124 INFO L93 Difference]: Finished difference Result 69484 states and 328264 transitions. [2020-10-05 23:03:30,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:03:30,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-10-05 23:03:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:30,313 INFO L225 Difference]: With dead ends: 69484 [2020-10-05 23:03:30,313 INFO L226 Difference]: Without dead ends: 69451 [2020-10-05 23:03:30,314 INFO L675 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 [2020-10-05 23:03:31,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69451 states. [2020-10-05 23:03:32,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69451 to 28873. [2020-10-05 23:03:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28873 states. [2020-10-05 23:03:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28873 states to 28873 states and 153454 transitions. [2020-10-05 23:03:32,550 INFO L78 Accepts]: Start accepts. Automaton has 28873 states and 153454 transitions. Word has length 19 [2020-10-05 23:03:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:32,550 INFO L479 AbstractCegarLoop]: Abstraction has 28873 states and 153454 transitions. [2020-10-05 23:03:32,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:03:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 28873 states and 153454 transitions. [2020-10-05 23:03:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:03:32,551 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:32,551 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:32,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:03:32,752 INFO L427 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]=== [2020-10-05 23:03:32,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:32,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1699177508, now seen corresponding path program 2 times [2020-10-05 23:03:32,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:32,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723908323] [2020-10-05 23:03:32,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:03:32,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723908323] [2020-10-05 23:03:32,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:32,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:03:32,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546424580] [2020-10-05 23:03:32,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:03:32,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:32,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:03:32,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:03:32,794 INFO L87 Difference]: Start difference. First operand 28873 states and 153454 transitions. Second operand 7 states. [2020-10-05 23:03:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:33,432 INFO L93 Difference]: Finished difference Result 70510 states and 333491 transitions. [2020-10-05 23:03:33,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:03:33,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:03:33,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:33,633 INFO L225 Difference]: With dead ends: 70510 [2020-10-05 23:03:33,634 INFO L226 Difference]: Without dead ends: 70477 [2020-10-05 23:03:33,634 INFO L675 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 [2020-10-05 23:03:34,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70477 states. [2020-10-05 23:03:35,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70477 to 28942. [2020-10-05 23:03:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28942 states. [2020-10-05 23:03:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28942 states to 28942 states and 153921 transitions. [2020-10-05 23:03:36,130 INFO L78 Accepts]: Start accepts. Automaton has 28942 states and 153921 transitions. Word has length 19 [2020-10-05 23:03:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:36,131 INFO L479 AbstractCegarLoop]: Abstraction has 28942 states and 153921 transitions. [2020-10-05 23:03:36,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:03:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 28942 states and 153921 transitions. [2020-10-05 23:03:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:03:36,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:36,132 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:36,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-10-05 23:03:36,132 INFO L427 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]=== [2020-10-05 23:03:36,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:36,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1699205315, now seen corresponding path program 2 times [2020-10-05 23:03:36,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:36,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899146340] [2020-10-05 23:03:36,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:03:36,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899146340] [2020-10-05 23:03:36,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:03:36,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:03:36,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306247005] [2020-10-05 23:03:36,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:03:36,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:36,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:03:36,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:03:36,175 INFO L87 Difference]: Start difference. First operand 28942 states and 153921 transitions. Second operand 7 states. [2020-10-05 23:03:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:36,799 INFO L93 Difference]: Finished difference Result 70096 states and 331298 transitions. [2020-10-05 23:03:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:03:36,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-05 23:03:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:36,988 INFO L225 Difference]: With dead ends: 70096 [2020-10-05 23:03:36,988 INFO L226 Difference]: Without dead ends: 70063 [2020-10-05 23:03:36,988 INFO L675 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 [2020-10-05 23:03:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70063 states. [2020-10-05 23:03:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70063 to 29094. [2020-10-05 23:03:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29094 states. [2020-10-05 23:03:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 154883 transitions. [2020-10-05 23:03:38,687 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 154883 transitions. Word has length 19 [2020-10-05 23:03:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:38,687 INFO L479 AbstractCegarLoop]: Abstraction has 29094 states and 154883 transitions. [2020-10-05 23:03:38,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:03:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 154883 transitions. [2020-10-05 23:03:38,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:03:38,688 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:38,688 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:38,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-10-05 23:03:38,688 INFO L427 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]=== [2020-10-05 23:03:38,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:38,689 INFO L82 PathProgramCache]: Analyzing trace with hash -228866966, now seen corresponding path program 1 times [2020-10-05 23:03:38,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:38,689 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452565136] [2020-10-05 23:03:38,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:03:38,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452565136] [2020-10-05 23:03:38,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751734095] [2020-10-05 23:03:38,752 INFO L95 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 [2020-10-05 23:03:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:38,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:03:38,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:38,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:03:38,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:38,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:03:38,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84288683] [2020-10-05 23:03:38,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:03:38,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:38,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:03:38,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:03:38,936 INFO L87 Difference]: Start difference. First operand 29094 states and 154883 transitions. Second operand 16 states. [2020-10-05 23:03:40,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:40,597 INFO L93 Difference]: Finished difference Result 100731 states and 448596 transitions. [2020-10-05 23:03:40,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:40,597 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:03:40,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:40,877 INFO L225 Difference]: With dead ends: 100731 [2020-10-05 23:03:40,877 INFO L226 Difference]: Without dead ends: 100715 [2020-10-05 23:03:40,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:03:41,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100715 states. [2020-10-05 23:03:42,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100715 to 28719. [2020-10-05 23:03:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28719 states. [2020-10-05 23:03:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28719 states to 28719 states and 152760 transitions. [2020-10-05 23:03:42,982 INFO L78 Accepts]: Start accepts. Automaton has 28719 states and 152760 transitions. Word has length 21 [2020-10-05 23:03:42,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:42,983 INFO L479 AbstractCegarLoop]: Abstraction has 28719 states and 152760 transitions. [2020-10-05 23:03:42,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:03:42,983 INFO L276 IsEmpty]: Start isEmpty. Operand 28719 states and 152760 transitions. [2020-10-05 23:03:42,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:03:42,984 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:42,984 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:43,190 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2020-10-05 23:03:43,190 INFO L427 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]=== [2020-10-05 23:03:43,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:43,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1302908714, now seen corresponding path program 2 times [2020-10-05 23:03:43,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:43,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204993559] [2020-10-05 23:03:43,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:03:43,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204993559] [2020-10-05 23:03:43,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572226134] [2020-10-05 23:03:43,256 INFO L93 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 [2020-10-05 23:03:43,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:03:43,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:03:43,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:03:43,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:03:43,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:43,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:03:43,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855838762] [2020-10-05 23:03:43,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:03:43,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:43,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:03:43,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:03:43,452 INFO L87 Difference]: Start difference. First operand 28719 states and 152760 transitions. Second operand 16 states. [2020-10-05 23:03:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:45,048 INFO L93 Difference]: Finished difference Result 99876 states and 444348 transitions. [2020-10-05 23:03:45,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:45,049 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:03:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:45,327 INFO L225 Difference]: With dead ends: 99876 [2020-10-05 23:03:45,327 INFO L226 Difference]: Without dead ends: 99855 [2020-10-05 23:03:45,327 INFO L675 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 [2020-10-05 23:03:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99855 states. [2020-10-05 23:03:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99855 to 28343. [2020-10-05 23:03:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28343 states. [2020-10-05 23:03:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28343 states to 28343 states and 150639 transitions. [2020-10-05 23:03:50,621 INFO L78 Accepts]: Start accepts. Automaton has 28343 states and 150639 transitions. Word has length 21 [2020-10-05 23:03:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:50,622 INFO L479 AbstractCegarLoop]: Abstraction has 28343 states and 150639 transitions. [2020-10-05 23:03:50,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:03:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 28343 states and 150639 transitions. [2020-10-05 23:03:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:03:50,623 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:50,623 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:50,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:03:50,824 INFO L427 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]=== [2020-10-05 23:03:50,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:50,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1149181014, now seen corresponding path program 3 times [2020-10-05 23:03:50,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:50,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922606848] [2020-10-05 23:03:50,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:03:50,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922606848] [2020-10-05 23:03:50,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531693935] [2020-10-05 23:03:50,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-10-05 23:03:50,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-10-05 23:03:50,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:03:50,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:03:50,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:03:51,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:51,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:03:51,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338252419] [2020-10-05 23:03:51,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:03:51,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:51,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:03:51,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:03:51,086 INFO L87 Difference]: Start difference. First operand 28343 states and 150639 transitions. Second operand 16 states. [2020-10-05 23:03:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:52,526 INFO L93 Difference]: Finished difference Result 100071 states and 445291 transitions. [2020-10-05 23:03:52,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:52,527 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:03:52,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:52,790 INFO L225 Difference]: With dead ends: 100071 [2020-10-05 23:03:52,791 INFO L226 Difference]: Without dead ends: 100055 [2020-10-05 23:03:52,791 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:03:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100055 states. [2020-10-05 23:03:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100055 to 27654. [2020-10-05 23:03:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27654 states. [2020-10-05 23:03:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27654 states to 27654 states and 147080 transitions. [2020-10-05 23:03:55,300 INFO L78 Accepts]: Start accepts. Automaton has 27654 states and 147080 transitions. Word has length 21 [2020-10-05 23:03:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:03:55,300 INFO L479 AbstractCegarLoop]: Abstraction has 27654 states and 147080 transitions. [2020-10-05 23:03:55,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:03:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 27654 states and 147080 transitions. [2020-10-05 23:03:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:03:55,301 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:03:55,301 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:03:55,502 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2020-10-05 23:03:55,502 INFO L427 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]=== [2020-10-05 23:03:55,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:03:55,503 INFO L82 PathProgramCache]: Analyzing trace with hash 315341610, now seen corresponding path program 4 times [2020-10-05 23:03:55,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:03:55,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263111215] [2020-10-05 23:03:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:03:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:03:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:03:55,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263111215] [2020-10-05 23:03:55,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690376315] [2020-10-05 23:03:55,560 INFO L93 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 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 [2020-10-05 23:03:55,645 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:03:55,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:03:55,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:03:55,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:03:55,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:03:55,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:03:55,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:03:55,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601872691] [2020-10-05 23:03:55,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:03:55,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:03:55,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:03:55,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:03:55,755 INFO L87 Difference]: Start difference. First operand 27654 states and 147080 transitions. Second operand 16 states. [2020-10-05 23:03:57,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:03:57,123 INFO L93 Difference]: Finished difference Result 99523 states and 442763 transitions. [2020-10-05 23:03:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:03:57,123 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-10-05 23:03:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:03:57,399 INFO L225 Difference]: With dead ends: 99523 [2020-10-05 23:03:57,399 INFO L226 Difference]: Without dead ends: 99502 [2020-10-05 23:03:57,400 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:03:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99502 states. [2020-10-05 23:03:59,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99502 to 27278. [2020-10-05 23:03:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27278 states. [2020-10-05 23:04:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27278 states to 27278 states and 144959 transitions. [2020-10-05 23:04:00,063 INFO L78 Accepts]: Start accepts. Automaton has 27278 states and 144959 transitions. Word has length 21 [2020-10-05 23:04:00,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:00,063 INFO L479 AbstractCegarLoop]: Abstraction has 27278 states and 144959 transitions. [2020-10-05 23:04:00,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:04:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 27278 states and 144959 transitions. [2020-10-05 23:04:00,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:04:00,064 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:00,064 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:00,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2020-10-05 23:04:00,265 INFO L427 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]=== [2020-10-05 23:04:00,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:00,265 INFO L82 PathProgramCache]: Analyzing trace with hash -822012438, now seen corresponding path program 5 times [2020-10-05 23:04:00,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:00,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306934974] [2020-10-05 23:04:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:04:00,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306934974] [2020-10-05 23:04:00,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:04:00,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:04:00,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069995668] [2020-10-05 23:04:00,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:04:00,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:00,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:04:00,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:04:00,326 INFO L87 Difference]: Start difference. First operand 27278 states and 144959 transitions. Second operand 9 states. [2020-10-05 23:04:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:01,706 INFO L93 Difference]: Finished difference Result 99710 states and 443686 transitions. [2020-10-05 23:04:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:04:01,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:04:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:02,010 INFO L225 Difference]: With dead ends: 99710 [2020-10-05 23:04:02,011 INFO L226 Difference]: Without dead ends: 99694 [2020-10-05 23:04:02,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-10-05 23:04:03,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99694 states. [2020-10-05 23:04:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99694 to 26597. [2020-10-05 23:04:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26597 states. [2020-10-05 23:04:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26597 states to 26597 states and 141420 transitions. [2020-10-05 23:04:04,568 INFO L78 Accepts]: Start accepts. Automaton has 26597 states and 141420 transitions. Word has length 21 [2020-10-05 23:04:04,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:04,569 INFO L479 AbstractCegarLoop]: Abstraction has 26597 states and 141420 transitions. [2020-10-05 23:04:04,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:04:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 26597 states and 141420 transitions. [2020-10-05 23:04:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:04:04,570 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:04,570 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:04,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2020-10-05 23:04:04,570 INFO L427 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]=== [2020-10-05 23:04:04,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:04,570 INFO L82 PathProgramCache]: Analyzing trace with hash -848707158, now seen corresponding path program 6 times [2020-10-05 23:04:04,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:04,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646011080] [2020-10-05 23:04:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:04:04,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646011080] [2020-10-05 23:04:04,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:04:04,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:04:04,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102746978] [2020-10-05 23:04:04,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:04:04,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:04,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:04:04,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:04:04,635 INFO L87 Difference]: Start difference. First operand 26597 states and 141420 transitions. Second operand 9 states. [2020-10-05 23:04:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:05,924 INFO L93 Difference]: Finished difference Result 98863 states and 439458 transitions. [2020-10-05 23:04:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:04:05,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-05 23:04:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:06,185 INFO L225 Difference]: With dead ends: 98863 [2020-10-05 23:04:06,185 INFO L226 Difference]: Without dead ends: 98841 [2020-10-05 23:04:06,185 INFO L675 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 [2020-10-05 23:04:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98841 states. [2020-10-05 23:04:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98841 to 25744. [2020-10-05 23:04:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25744 states. [2020-10-05 23:04:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25744 states to 25744 states and 137181 transitions. [2020-10-05 23:04:08,658 INFO L78 Accepts]: Start accepts. Automaton has 25744 states and 137181 transitions. Word has length 21 [2020-10-05 23:04:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:08,659 INFO L479 AbstractCegarLoop]: Abstraction has 25744 states and 137181 transitions. [2020-10-05 23:04:08,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:04:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 25744 states and 137181 transitions. [2020-10-05 23:04:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:04:08,660 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:08,660 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:08,660 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-10-05 23:04:08,660 INFO L427 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]=== [2020-10-05 23:04:08,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:08,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1818695965, now seen corresponding path program 1 times [2020-10-05 23:04:08,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:08,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057773272] [2020-10-05 23:04:08,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:04:08,687 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057773272] [2020-10-05 23:04:08,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:04:08,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:04:08,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000233372] [2020-10-05 23:04:08,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:04:08,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:08,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:04:08,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:04:08,688 INFO L87 Difference]: Start difference. First operand 25744 states and 137181 transitions. Second operand 5 states. [2020-10-05 23:04:09,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:09,027 INFO L93 Difference]: Finished difference Result 46463 states and 236107 transitions. [2020-10-05 23:04:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:04:09,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-05 23:04:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:09,159 INFO L225 Difference]: With dead ends: 46463 [2020-10-05 23:04:09,159 INFO L226 Difference]: Without dead ends: 46417 [2020-10-05 23:04:09,159 INFO L675 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 [2020-10-05 23:04:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46417 states. [2020-10-05 23:04:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46417 to 31960. [2020-10-05 23:04:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31960 states. [2020-10-05 23:04:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31960 states to 31960 states and 171209 transitions. [2020-10-05 23:04:10,964 INFO L78 Accepts]: Start accepts. Automaton has 31960 states and 171209 transitions. Word has length 21 [2020-10-05 23:04:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:10,964 INFO L479 AbstractCegarLoop]: Abstraction has 31960 states and 171209 transitions. [2020-10-05 23:04:10,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:04:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand 31960 states and 171209 transitions. [2020-10-05 23:04:10,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:04:10,965 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:10,965 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:10,966 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-10-05 23:04:10,966 INFO L427 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]=== [2020-10-05 23:04:10,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:10,966 INFO L82 PathProgramCache]: Analyzing trace with hash 605532395, now seen corresponding path program 1 times [2020-10-05 23:04:10,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:10,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868923138] [2020-10-05 23:04:10,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:04:11,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868923138] [2020-10-05 23:04:11,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736778040] [2020-10-05 23:04:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-05 23:04:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:11,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:04:11,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:04:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:04:11,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:04:11,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:04:11,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287418754] [2020-10-05 23:04:11,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:04:11,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:11,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:04:11,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:04:11,167 INFO L87 Difference]: Start difference. First operand 31960 states and 171209 transitions. Second operand 12 states. [2020-10-05 23:04:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:11,969 INFO L93 Difference]: Finished difference Result 75380 states and 361389 transitions. [2020-10-05 23:04:11,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:04:11,970 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:04:11,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:12,187 INFO L225 Difference]: With dead ends: 75380 [2020-10-05 23:04:12,187 INFO L226 Difference]: Without dead ends: 75344 [2020-10-05 23:04:12,188 INFO L675 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 [2020-10-05 23:04:13,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75344 states. [2020-10-05 23:04:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75344 to 32974. [2020-10-05 23:04:14,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32974 states. [2020-10-05 23:04:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32974 states to 32974 states and 176363 transitions. [2020-10-05 23:04:14,565 INFO L78 Accepts]: Start accepts. Automaton has 32974 states and 176363 transitions. Word has length 23 [2020-10-05 23:04:14,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:14,565 INFO L479 AbstractCegarLoop]: Abstraction has 32974 states and 176363 transitions. [2020-10-05 23:04:14,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:04:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 32974 states and 176363 transitions. [2020-10-05 23:04:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:04:14,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:14,567 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:14,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:04:14,768 INFO L427 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]=== [2020-10-05 23:04:14,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:14,769 INFO L82 PathProgramCache]: Analyzing trace with hash 768040394, now seen corresponding path program 1 times [2020-10-05 23:04:14,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:14,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869131035] [2020-10-05 23:04:14,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:14,811 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:04:14,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869131035] [2020-10-05 23:04:14,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620661074] [2020-10-05 23:04:14,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-05 23:04:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:14,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:04:14,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:04:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:04:14,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:04:14,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:04:14,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223308646] [2020-10-05 23:04:14,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:04:14,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:14,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:04:14,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:04:14,996 INFO L87 Difference]: Start difference. First operand 32974 states and 176363 transitions. Second operand 12 states. [2020-10-05 23:04:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:16,009 INFO L93 Difference]: Finished difference Result 79487 states and 381757 transitions. [2020-10-05 23:04:16,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:04:16,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:04:16,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:16,230 INFO L225 Difference]: With dead ends: 79487 [2020-10-05 23:04:16,230 INFO L226 Difference]: Without dead ends: 79445 [2020-10-05 23:04:16,230 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-10-05 23:04:17,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79445 states. [2020-10-05 23:04:18,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79445 to 33981. [2020-10-05 23:04:18,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33981 states. [2020-10-05 23:04:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33981 states to 33981 states and 181710 transitions. [2020-10-05 23:04:18,674 INFO L78 Accepts]: Start accepts. Automaton has 33981 states and 181710 transitions. Word has length 23 [2020-10-05 23:04:18,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:18,675 INFO L479 AbstractCegarLoop]: Abstraction has 33981 states and 181710 transitions. [2020-10-05 23:04:18,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:04:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 33981 states and 181710 transitions. [2020-10-05 23:04:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:04:18,676 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:18,677 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:18,877 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:04:18,877 INFO L427 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]=== [2020-10-05 23:04:18,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1041867770, now seen corresponding path program 1 times [2020-10-05 23:04:18,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:18,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046233223] [2020-10-05 23:04:18,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:04:18,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046233223] [2020-10-05 23:04:18,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355537209] [2020-10-05 23:04:18,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-05 23:04:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:19,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-05 23:04:19,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:04:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-05 23:04:19,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:04:19,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-10-05 23:04:19,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142121588] [2020-10-05 23:04:19,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:04:19,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:19,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:04:19,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:04:19,063 INFO L87 Difference]: Start difference. First operand 33981 states and 181710 transitions. Second operand 12 states. [2020-10-05 23:04:19,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:19,801 INFO L93 Difference]: Finished difference Result 82728 states and 398553 transitions. [2020-10-05 23:04:19,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:04:19,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 23:04:19,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:20,058 INFO L225 Difference]: With dead ends: 82728 [2020-10-05 23:04:20,059 INFO L226 Difference]: Without dead ends: 82673 [2020-10-05 23:04:20,059 INFO L675 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 [2020-10-05 23:04:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82673 states. [2020-10-05 23:04:22,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82673 to 34821. [2020-10-05 23:04:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34821 states. [2020-10-05 23:04:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 186422 transitions. [2020-10-05 23:04:22,586 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 186422 transitions. Word has length 23 [2020-10-05 23:04:22,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:22,586 INFO L479 AbstractCegarLoop]: Abstraction has 34821 states and 186422 transitions. [2020-10-05 23:04:22,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:04:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 186422 transitions. [2020-10-05 23:04:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:04:22,588 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:22,588 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:22,788 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:04:22,789 INFO L427 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]=== [2020-10-05 23:04:22,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash -284839030, now seen corresponding path program 2 times [2020-10-05 23:04:22,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:22,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244469642] [2020-10-05 23:04:22,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:04:22,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244469642] [2020-10-05 23:04:22,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:04:22,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:04:22,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016798856] [2020-10-05 23:04:22,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:04:22,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:22,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:04:22,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:04:22,842 INFO L87 Difference]: Start difference. First operand 34821 states and 186422 transitions. Second operand 7 states. [2020-10-05 23:04:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:23,535 INFO L93 Difference]: Finished difference Result 83507 states and 402693 transitions. [2020-10-05 23:04:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:04:23,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:04:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:23,770 INFO L225 Difference]: With dead ends: 83507 [2020-10-05 23:04:23,770 INFO L226 Difference]: Without dead ends: 83452 [2020-10-05 23:04:23,770 INFO L675 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 [2020-10-05 23:04:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83452 states. [2020-10-05 23:04:26,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83452 to 35694. [2020-10-05 23:04:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35694 states. [2020-10-05 23:04:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35694 states to 35694 states and 191145 transitions. [2020-10-05 23:04:26,341 INFO L78 Accepts]: Start accepts. Automaton has 35694 states and 191145 transitions. Word has length 23 [2020-10-05 23:04:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:26,341 INFO L479 AbstractCegarLoop]: Abstraction has 35694 states and 191145 transitions. [2020-10-05 23:04:26,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:04:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 35694 states and 191145 transitions. [2020-10-05 23:04:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:04:26,343 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:26,344 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:26,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2020-10-05 23:04:26,344 INFO L427 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]=== [2020-10-05 23:04:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:26,344 INFO L82 PathProgramCache]: Analyzing trace with hash -284850438, now seen corresponding path program 2 times [2020-10-05 23:04:26,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:26,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004104620] [2020-10-05 23:04:26,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:04:26,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004104620] [2020-10-05 23:04:26,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:04:26,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:04:26,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005209240] [2020-10-05 23:04:26,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:04:26,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:26,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:04:26,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:04:26,388 INFO L87 Difference]: Start difference. First operand 35694 states and 191145 transitions. Second operand 7 states. [2020-10-05 23:04:27,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:27,139 INFO L93 Difference]: Finished difference Result 83523 states and 402462 transitions. [2020-10-05 23:04:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:04:27,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:04:27,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:27,380 INFO L225 Difference]: With dead ends: 83523 [2020-10-05 23:04:27,380 INFO L226 Difference]: Without dead ends: 83468 [2020-10-05 23:04:27,380 INFO L675 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 [2020-10-05 23:04:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83468 states. [2020-10-05 23:04:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83468 to 36306. [2020-10-05 23:04:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36306 states. [2020-10-05 23:04:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36306 states to 36306 states and 194552 transitions. [2020-10-05 23:04:29,919 INFO L78 Accepts]: Start accepts. Automaton has 36306 states and 194552 transitions. Word has length 23 [2020-10-05 23:04:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:29,919 INFO L479 AbstractCegarLoop]: Abstraction has 36306 states and 194552 transitions. [2020-10-05 23:04:29,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:04:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 36306 states and 194552 transitions. [2020-10-05 23:04:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:04:29,921 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:29,922 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:29,922 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2020-10-05 23:04:29,922 INFO L427 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]=== [2020-10-05 23:04:29,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:29,922 INFO L82 PathProgramCache]: Analyzing trace with hash -284866837, now seen corresponding path program 2 times [2020-10-05 23:04:29,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:29,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148067800] [2020-10-05 23:04:29,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-10-05 23:04:29,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148067800] [2020-10-05 23:04:29,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:04:29,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:04:29,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840720714] [2020-10-05 23:04:29,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:04:29,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:29,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:04:29,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:04:29,963 INFO L87 Difference]: Start difference. First operand 36306 states and 194552 transitions. Second operand 7 states. [2020-10-05 23:04:30,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:30,651 INFO L93 Difference]: Finished difference Result 83918 states and 404136 transitions. [2020-10-05 23:04:30,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:04:30,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:04:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:30,882 INFO L225 Difference]: With dead ends: 83918 [2020-10-05 23:04:30,882 INFO L226 Difference]: Without dead ends: 83863 [2020-10-05 23:04:30,882 INFO L675 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 [2020-10-05 23:04:31,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83863 states. [2020-10-05 23:04:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83863 to 37062. [2020-10-05 23:04:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37062 states. [2020-10-05 23:04:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37062 states to 37062 states and 198528 transitions. [2020-10-05 23:04:33,413 INFO L78 Accepts]: Start accepts. Automaton has 37062 states and 198528 transitions. Word has length 23 [2020-10-05 23:04:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:33,414 INFO L479 AbstractCegarLoop]: Abstraction has 37062 states and 198528 transitions. [2020-10-05 23:04:33,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:04:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 37062 states and 198528 transitions. [2020-10-05 23:04:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:04:33,416 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:33,416 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:33,417 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2020-10-05 23:04:33,417 INFO L427 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]=== [2020-10-05 23:04:33,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:33,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1146013160, now seen corresponding path program 1 times [2020-10-05 23:04:33,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:33,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577641232] [2020-10-05 23:04:33,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:04:33,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577641232] [2020-10-05 23:04:33,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399484729] [2020-10-05 23:04:33,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-05 23:04:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:33,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:04:33,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:04:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:04:33,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:04:33,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:04:33,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427156632] [2020-10-05 23:04:33,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:04:33,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:33,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:04:33,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:04:33,670 INFO L87 Difference]: Start difference. First operand 37062 states and 198528 transitions. Second operand 16 states. [2020-10-05 23:04:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:35,303 INFO L93 Difference]: Finished difference Result 122892 states and 561130 transitions. [2020-10-05 23:04:35,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:04:35,303 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:04:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:35,633 INFO L225 Difference]: With dead ends: 122892 [2020-10-05 23:04:35,634 INFO L226 Difference]: Without dead ends: 122862 [2020-10-05 23:04:35,634 INFO L675 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 [2020-10-05 23:04:37,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122862 states. [2020-10-05 23:04:38,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122862 to 36727. [2020-10-05 23:04:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36727 states. [2020-10-05 23:04:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36727 states to 36727 states and 196466 transitions. [2020-10-05 23:04:38,763 INFO L78 Accepts]: Start accepts. Automaton has 36727 states and 196466 transitions. Word has length 25 [2020-10-05 23:04:38,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:38,763 INFO L479 AbstractCegarLoop]: Abstraction has 36727 states and 196466 transitions. [2020-10-05 23:04:38,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:04:38,763 INFO L276 IsEmpty]: Start isEmpty. Operand 36727 states and 196466 transitions. [2020-10-05 23:04:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:04:38,766 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:38,766 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:38,966 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2020-10-05 23:04:38,966 INFO L427 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]=== [2020-10-05 23:04:38,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:38,967 INFO L82 PathProgramCache]: Analyzing trace with hash -872185784, now seen corresponding path program 1 times [2020-10-05 23:04:38,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:38,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658507147] [2020-10-05 23:04:38,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:04:39,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658507147] [2020-10-05 23:04:39,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623697431] [2020-10-05 23:04:39,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-05 23:04:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:39,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:04:39,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:04:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-05 23:04:39,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:04:39,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:04:39,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377579549] [2020-10-05 23:04:39,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:04:39,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:39,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:04:39,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:04:39,212 INFO L87 Difference]: Start difference. First operand 36727 states and 196466 transitions. Second operand 16 states. [2020-10-05 23:04:41,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:41,282 INFO L93 Difference]: Finished difference Result 121590 states and 554657 transitions. [2020-10-05 23:04:41,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:04:41,282 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:04:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:41,644 INFO L225 Difference]: With dead ends: 121590 [2020-10-05 23:04:41,644 INFO L226 Difference]: Without dead ends: 121560 [2020-10-05 23:04:41,644 INFO L675 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 [2020-10-05 23:04:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121560 states. [2020-10-05 23:04:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121560 to 36513. [2020-10-05 23:04:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36513 states. [2020-10-05 23:04:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36513 states to 36513 states and 195090 transitions. [2020-10-05 23:04:47,137 INFO L78 Accepts]: Start accepts. Automaton has 36513 states and 195090 transitions. Word has length 25 [2020-10-05 23:04:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:47,137 INFO L479 AbstractCegarLoop]: Abstraction has 36513 states and 195090 transitions. [2020-10-05 23:04:47,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:04:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 36513 states and 195090 transitions. [2020-10-05 23:04:47,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:04:47,141 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:47,141 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:47,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:04:47,348 INFO L427 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]=== [2020-10-05 23:04:47,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:47,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2096074712, now seen corresponding path program 2 times [2020-10-05 23:04:47,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:47,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244153166] [2020-10-05 23:04:47,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:04:47,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244153166] [2020-10-05 23:04:47,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295950825] [2020-10-05 23:04:47,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-05 23:04:47,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:04:47,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:04:47,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:04:47,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:04:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:04:47,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:04:47,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:04:47,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569805852] [2020-10-05 23:04:47,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:04:47,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:47,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:04:47,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:04:47,610 INFO L87 Difference]: Start difference. First operand 36513 states and 195090 transitions. Second operand 16 states. [2020-10-05 23:04:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:49,103 INFO L93 Difference]: Finished difference Result 120395 states and 548664 transitions. [2020-10-05 23:04:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:04:49,104 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:04:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:49,430 INFO L225 Difference]: With dead ends: 120395 [2020-10-05 23:04:49,430 INFO L226 Difference]: Without dead ends: 120362 [2020-10-05 23:04:49,431 INFO L675 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 [2020-10-05 23:04:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120362 states. [2020-10-05 23:04:52,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120362 to 36444. [2020-10-05 23:04:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36444 states. [2020-10-05 23:04:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36444 states to 36444 states and 194571 transitions. [2020-10-05 23:04:52,536 INFO L78 Accepts]: Start accepts. Automaton has 36444 states and 194571 transitions. Word has length 25 [2020-10-05 23:04:52,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:52,536 INFO L479 AbstractCegarLoop]: Abstraction has 36444 states and 194571 transitions. [2020-10-05 23:04:52,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:04:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 36444 states and 194571 transitions. [2020-10-05 23:04:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:04:52,539 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:52,539 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:04:52,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2020-10-05 23:04:52,740 INFO L427 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]=== [2020-10-05 23:04:52,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:04:52,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2096063304, now seen corresponding path program 2 times [2020-10-05 23:04:52,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:04:52,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307479934] [2020-10-05 23:04:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:04:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:04:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:04:52,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307479934] [2020-10-05 23:04:52,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660832041] [2020-10-05 23:04:52,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-10-05 23:04:52,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:04:52,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:04:52,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:04:52,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:04:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-05 23:04:52,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:04:52,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:04:52,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136052869] [2020-10-05 23:04:52,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:04:52,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:04:52,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:04:52,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:04:52,986 INFO L87 Difference]: Start difference. First operand 36444 states and 194571 transitions. Second operand 16 states. [2020-10-05 23:04:56,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:04:56,713 INFO L93 Difference]: Finished difference Result 119346 states and 543724 transitions. [2020-10-05 23:04:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:04:56,714 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:04:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:04:57,093 INFO L225 Difference]: With dead ends: 119346 [2020-10-05 23:04:57,093 INFO L226 Difference]: Without dead ends: 119313 [2020-10-05 23:04:57,093 INFO L675 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 [2020-10-05 23:04:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119313 states. [2020-10-05 23:04:59,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119313 to 36040. [2020-10-05 23:04:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36040 states. [2020-10-05 23:04:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36040 states to 36040 states and 192287 transitions. [2020-10-05 23:04:59,939 INFO L78 Accepts]: Start accepts. Automaton has 36040 states and 192287 transitions. Word has length 25 [2020-10-05 23:04:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:04:59,939 INFO L479 AbstractCegarLoop]: Abstraction has 36040 states and 192287 transitions. [2020-10-05 23:04:59,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:04:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 36040 states and 192287 transitions. [2020-10-05 23:04:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:04:59,942 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:04:59,942 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:05:00,142 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2020-10-05 23:05:00,143 INFO L427 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]=== [2020-10-05 23:05:00,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:05:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash 582269272, now seen corresponding path program 3 times [2020-10-05 23:05:00,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:05:00,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400003878] [2020-10-05 23:05:00,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:05:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:05:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:05:00,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400003878] [2020-10-05 23:05:00,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384509660] [2020-10-05 23:05:00,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:05:00,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-05 23:05:00,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:05:00,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:05:00,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:05:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:05:00,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:05:00,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:05:00,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391567685] [2020-10-05 23:05:00,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:05:00,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:05:00,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:05:00,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:05:00,397 INFO L87 Difference]: Start difference. First operand 36040 states and 192287 transitions. Second operand 16 states. [2020-10-05 23:05:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:05:02,031 INFO L93 Difference]: Finished difference Result 119770 states and 545635 transitions. [2020-10-05 23:05:02,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:05:02,032 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:05:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:05:02,360 INFO L225 Difference]: With dead ends: 119770 [2020-10-05 23:05:02,360 INFO L226 Difference]: Without dead ends: 119740 [2020-10-05 23:05:02,360 INFO L675 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 [2020-10-05 23:05:03,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119740 states. [2020-10-05 23:05:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119740 to 35471. [2020-10-05 23:05:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35471 states. [2020-10-05 23:05:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35471 states to 35471 states and 189238 transitions. [2020-10-05 23:05:07,885 INFO L78 Accepts]: Start accepts. Automaton has 35471 states and 189238 transitions. Word has length 25 [2020-10-05 23:05:07,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:05:07,885 INFO L479 AbstractCegarLoop]: Abstraction has 35471 states and 189238 transitions. [2020-10-05 23:05:07,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:05:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 35471 states and 189238 transitions. [2020-10-05 23:05:07,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:05:07,887 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:05:07,887 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:05:08,088 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2020-10-05 23:05:08,088 INFO L427 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]=== [2020-10-05 23:05:08,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:05:08,089 INFO L82 PathProgramCache]: Analyzing trace with hash 679178599, now seen corresponding path program 1 times [2020-10-05 23:05:08,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:05:08,089 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116817483] [2020-10-05 23:05:08,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:05:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:05:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:05:08,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116817483] [2020-10-05 23:05:08,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217436821] [2020-10-05 23:05:08,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:05:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:05:08,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:05:08,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:05:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-05 23:05:08,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:05:08,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:05:08,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566502662] [2020-10-05 23:05:08,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:05:08,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:05:08,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:05:08,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:05:08,346 INFO L87 Difference]: Start difference. First operand 35471 states and 189238 transitions. Second operand 16 states. [2020-10-05 23:05:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:05:10,576 INFO L93 Difference]: Finished difference Result 121131 states and 553230 transitions. [2020-10-05 23:05:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:05:10,576 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:05:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:05:10,913 INFO L225 Difference]: With dead ends: 121131 [2020-10-05 23:05:10,913 INFO L226 Difference]: Without dead ends: 121101 [2020-10-05 23:05:10,914 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:05:12,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121101 states. [2020-10-05 23:05:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121101 to 35374. [2020-10-05 23:05:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35374 states. [2020-10-05 23:05:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35374 states to 35374 states and 188534 transitions. [2020-10-05 23:05:17,279 INFO L78 Accepts]: Start accepts. Automaton has 35374 states and 188534 transitions. Word has length 25 [2020-10-05 23:05:17,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:05:17,279 INFO L479 AbstractCegarLoop]: Abstraction has 35374 states and 188534 transitions. [2020-10-05 23:05:17,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:05:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 35374 states and 188534 transitions. [2020-10-05 23:05:17,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:05:17,281 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:05:17,281 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:05:17,482 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2020-10-05 23:05:17,482 INFO L427 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]=== [2020-10-05 23:05:17,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:05:17,483 INFO L82 PathProgramCache]: Analyzing trace with hash -647539609, now seen corresponding path program 2 times [2020-10-05 23:05:17,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:05:17,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709208273] [2020-10-05 23:05:17,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:05:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:05:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:05:17,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709208273] [2020-10-05 23:05:17,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185526553] [2020-10-05 23:05:17,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:05:17,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-05 23:05:17,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:05:17,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:05:17,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:05:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:05:17,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:05:17,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:05:17,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259689253] [2020-10-05 23:05:17,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:05:17,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:05:17,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:05:17,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:05:17,730 INFO L87 Difference]: Start difference. First operand 35374 states and 188534 transitions. Second operand 16 states. [2020-10-05 23:05:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:05:19,246 INFO L93 Difference]: Finished difference Result 120194 states and 548412 transitions. [2020-10-05 23:05:19,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:05:19,246 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:05:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:05:19,578 INFO L225 Difference]: With dead ends: 120194 [2020-10-05 23:05:19,578 INFO L226 Difference]: Without dead ends: 120154 [2020-10-05 23:05:19,578 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-10-05 23:05:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120154 states. [2020-10-05 23:05:22,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120154 to 35219. [2020-10-05 23:05:22,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35219 states. [2020-10-05 23:05:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35219 states to 35219 states and 187630 transitions. [2020-10-05 23:05:22,473 INFO L78 Accepts]: Start accepts. Automaton has 35219 states and 187630 transitions. Word has length 25 [2020-10-05 23:05:22,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:05:22,473 INFO L479 AbstractCegarLoop]: Abstraction has 35219 states and 187630 transitions. [2020-10-05 23:05:22,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:05:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 35219 states and 187630 transitions. [2020-10-05 23:05:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:05:22,476 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:05:22,476 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:05:22,676 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:05:22,677 INFO L427 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]=== [2020-10-05 23:05:22,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:05:22,677 INFO L82 PathProgramCache]: Analyzing trace with hash -647556008, now seen corresponding path program 4 times [2020-10-05 23:05:22,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:05:22,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525302485] [2020-10-05 23:05:22,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:05:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:05:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:05:22,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525302485] [2020-10-05 23:05:22,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342846301] [2020-10-05 23:05:22,742 INFO L93 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-05 23:05:22,828 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-05 23:05:22,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-05 23:05:22,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-05 23:05:22,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-05 23:05:22,934 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-10-05 23:05:22,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-05 23:05:22,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-10-05 23:05:22,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034491539] [2020-10-05 23:05:22,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:05:22,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:05:22,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:05:22,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:05:22,936 INFO L87 Difference]: Start difference. First operand 35219 states and 187630 transitions. Second operand 16 states. [2020-10-05 23:05:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:05:24,400 INFO L93 Difference]: Finished difference Result 118559 states and 539905 transitions. [2020-10-05 23:05:24,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-05 23:05:24,401 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-10-05 23:05:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:05:24,723 INFO L225 Difference]: With dead ends: 118559 [2020-10-05 23:05:24,723 INFO L226 Difference]: Without dead ends: 118526 [2020-10-05 23:05:24,724 INFO L675 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 [2020-10-05 23:05:26,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118526 states. Received shutdown request... [2020-10-05 23:05:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118526 to 34815. [2020-10-05 23:05:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34815 states. [2020-10-05 23:05:27,796 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2020-10-05 23:05:27,796 WARN L544 AbstractCegarLoop]: Verification canceled [2020-10-05 23:05:27,801 WARN L228 ceAbstractionStarter]: Timeout [2020-10-05 23:05:27,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:05:27 BasicIcfg [2020-10-05 23:05:27,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:05:27,802 INFO L168 Benchmark]: Toolchain (without parser) took 227210.06 ms. Allocated memory was 138.9 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 100.8 MB in the beginning and 986.6 MB in the end (delta: -885.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2020-10-05 23:05:27,802 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:05:27,803 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.20 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 163.6 MB in the end (delta: -63.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:05:27,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.37 ms. Allocated memory is still 203.4 MB. Free memory was 163.6 MB in the beginning and 161.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:05:27,803 INFO L168 Benchmark]: Boogie Preprocessor took 26.66 ms. Allocated memory is still 203.4 MB. Free memory was 161.6 MB in the beginning and 160.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:05:27,803 INFO L168 Benchmark]: RCFGBuilder took 348.30 ms. Allocated memory is still 203.4 MB. Free memory was 160.2 MB in the beginning and 139.8 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:05:27,804 INFO L168 Benchmark]: TraceAbstraction took 226121.15 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 139.1 MB in the beginning and 986.6 MB in the end (delta: -847.5 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2020-10-05 23:05:27,805 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 667.20 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 163.6 MB in the end (delta: -63.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.37 ms. Allocated memory is still 203.4 MB. Free memory was 163.6 MB in the beginning and 161.6 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 203.4 MB. Free memory was 161.6 MB in the beginning and 160.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 348.30 ms. Allocated memory is still 203.4 MB. Free memory was 160.2 MB in the beginning and 139.8 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 226121.15 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 139.1 MB in the beginning and 986.6 MB in the end (delta: -847.5 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.7s, 61 ProgramPointsBefore, 18 ProgramPointsAfterwards, 58 TransitionsBefore, 12 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 7 FixpointIterations, 21 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 304 VarBasedMoverChecksPositive, 3 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 3 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 486 CheckedPairsTotal, 51 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 80 ProgramPointsBefore, 31 ProgramPointsAfterwards, 74 TransitionsBefore, 21 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 472 VarBasedMoverChecksPositive, 9 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 11 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 942 CheckedPairsTotal, 62 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 99 ProgramPointsBefore, 41 ProgramPointsAfterwards, 90 TransitionsBefore, 27 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 673 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 17 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1426 CheckedPairsTotal, 74 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 118 ProgramPointsBefore, 51 ProgramPointsAfterwards, 106 TransitionsBefore, 33 TransitionsAfterwards, 1756 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 840 VarBasedMoverChecksPositive, 18 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 20 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2033 CheckedPairsTotal, 86 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.2s, 137 ProgramPointsBefore, 61 ProgramPointsAfterwards, 122 TransitionsBefore, 39 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 3 ConcurrentYvCompositions, 7 ChoiceCompositions, 1058 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2999 CheckedPairsTotal, 104 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.4s, 156 ProgramPointsBefore, 71 ProgramPointsAfterwards, 138 TransitionsBefore, 45 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 66 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 8 ChoiceCompositions, 1407 VarBasedMoverChecksPositive, 30 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 34 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3678 CheckedPairsTotal, 113 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 678]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 678). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 55 locations, 1 error locations. Started 6 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 225.7s, OverallIterations: 106, TraceHistogramMax: 6, AutomataDifference: 82.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.7s, HoareTripleCheckerStatistics: 4776 SDtfs, 25434 SDslu, 17346 SDs, 0 SdLazy, 32585 SolverSat, 2268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2850 GetRequests, 712 SyntacticMatches, 0 SemanticMatches, 2138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14654 ImplicationChecksByTransitivity, 23.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37062occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 104.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 2256009 StatesRemovedByMinimization, 93 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 3095 NumberOfCodeBlocks, 3067 NumberOfCodeBlocksAsserted, 181 NumberOfCheckSat, 2858 ConstructedInterpolants, 0 QuantifiedInterpolants, 385140 SizeOfPredicates, 256 NumberOfNonLiveVariables, 5413 ConjunctsInSsa, 400 ConjunctsInUnsatCore, 149 InterpolantComputations, 53 PerfectInterpolantSequences, 912/1688 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown