/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-507b705 [2020-09-11 20:15:56,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-11 20:15:56,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-11 20:15:56,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-11 20:15:56,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-11 20:15:56,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-11 20:15:56,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-11 20:15:56,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-11 20:15:56,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-11 20:15:56,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-11 20:15:56,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-11 20:15:56,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-11 20:15:56,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-11 20:15:56,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-11 20:15:56,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-11 20:15:56,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-11 20:15:56,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-11 20:15:56,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-11 20:15:56,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-11 20:15:56,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-11 20:15:56,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-11 20:15:56,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-11 20:15:56,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-11 20:15:56,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-11 20:15:56,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-11 20:15:56,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-11 20:15:56,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-11 20:15:56,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-11 20:15:56,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-11 20:15:56,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-11 20:15:56,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-11 20:15:56,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-11 20:15:56,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-11 20:15:56,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-11 20:15:56,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-11 20:15:56,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-11 20:15:56,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-11 20:15:56,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-11 20:15:56,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-11 20:15:56,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-11 20:15:56,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-11 20:15:56,712 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-09-11 20:15:56,777 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-11 20:15:56,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-11 20:15:56,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-11 20:15:56,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-11 20:15:56,779 INFO L138 SettingsManager]: * Use SBE=true [2020-09-11 20:15:56,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-11 20:15:56,779 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-11 20:15:56,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-11 20:15:56,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-11 20:15:56,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-11 20:15:56,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-11 20:15:56,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-11 20:15:56,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-11 20:15:56,782 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-11 20:15:56,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-11 20:15:56,782 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-11 20:15:56,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-11 20:15:56,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-11 20:15:56,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-11 20:15:56,784 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-11 20:15:56,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-11 20:15:56,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-11 20:15:56,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-11 20:15:56,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-09-11 20:15:56,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-11 20:15:56,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-11 20:15:56,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-11 20:15:56,786 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-09-11 20:15:56,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-11 20:15:57,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-11 20:15:57,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-11 20:15:57,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-11 20:15:57,284 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-11 20:15:57,285 INFO L275 PluginConnector]: CDTParser initialized [2020-09-11 20:15:57,286 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2020-09-11 20:15:57,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bfade05bd/26ab669a7dc341cb9aa6979d57dd4737/FLAG6af4fbae6 [2020-09-11 20:15:58,010 INFO L306 CDTParser]: Found 1 translation units. [2020-09-11 20:15:58,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2020-09-11 20:15:58,033 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bfade05bd/26ab669a7dc341cb9aa6979d57dd4737/FLAG6af4fbae6 [2020-09-11 20:15:58,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bfade05bd/26ab669a7dc341cb9aa6979d57dd4737 [2020-09-11 20:15:58,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-11 20:15:58,395 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-11 20:15:58,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-11 20:15:58,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-11 20:15:58,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-11 20:15:58,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:15:58" (1/1) ... [2020-09-11 20:15:58,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602cc6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:15:58, skipping insertion in model container [2020-09-11 20:15:58,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:15:58" (1/1) ... [2020-09-11 20:15:58,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-11 20:15:58,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-11 20:15:59,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-11 20:15:59,026 INFO L203 MainTranslator]: Completed pre-run [2020-09-11 20:15:59,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-11 20:15:59,187 INFO L208 MainTranslator]: Completed translation [2020-09-11 20:15:59,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:15:59 WrapperNode [2020-09-11 20:15:59,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-11 20:15:59,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-11 20:15:59,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-11 20:15:59,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-11 20:15:59,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:15:59" (1/1) ... [2020-09-11 20:15:59,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:15:59" (1/1) ... [2020-09-11 20:15:59,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-11 20:15:59,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-11 20:15:59,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-11 20:15:59,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-11 20:15:59,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:15:59" (1/1) ... [2020-09-11 20:15:59,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:15:59" (1/1) ... [2020-09-11 20:15:59,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:15:59" (1/1) ... [2020-09-11 20:15:59,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:15:59" (1/1) ... [2020-09-11 20:15:59,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:15:59" (1/1) ... [2020-09-11 20:15:59,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:15:59" (1/1) ... [2020-09-11 20:15:59,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:15:59" (1/1) ... [2020-09-11 20:15:59,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-11 20:15:59,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-11 20:15:59,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-11 20:15:59,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-11 20:15:59,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:15:59" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:15:59,372 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-09-11 20:15:59,372 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-09-11 20:15:59,373 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-09-11 20:15:59,373 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-09-11 20:15:59,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-11 20:15:59,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-11 20:15:59,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-11 20:15:59,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-11 20:15:59,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-11 20:15:59,376 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-11 20:15:59,744 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-11 20:15:59,744 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-09-11 20:15:59,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:15:59 BoogieIcfgContainer [2020-09-11 20:15:59,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-11 20:15:59,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-11 20:15:59,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-11 20:15:59,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-11 20:15:59,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:15:58" (1/3) ... [2020-09-11 20:15:59,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d9deb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:15:59, skipping insertion in model container [2020-09-11 20:15:59,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:15:59" (2/3) ... [2020-09-11 20:15:59,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d9deb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:15:59, skipping insertion in model container [2020-09-11 20:15:59,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:15:59" (3/3) ... [2020-09-11 20:15:59,760 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-2.i [2020-09-11 20:15:59,781 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-11 20:15:59,782 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-11 20:15:59,794 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-11 20:15:59,795 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-11 20:15:59,827 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,828 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,828 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,828 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,829 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,829 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,829 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,830 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,831 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,831 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,832 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,832 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,833 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,838 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,838 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,840 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,840 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,840 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,849 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,849 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,850 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,850 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:15:59,875 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-09-11 20:15:59,900 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 20:15:59,900 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 20:15:59,900 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-11 20:15:59,901 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 20:15:59,901 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 20:15:59,901 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 20:15:59,901 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 20:15:59,901 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 20:15:59,918 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 58 transitions, 126 flow [2020-09-11 20:15:59,920 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 126 flow [2020-09-11 20:15:59,970 INFO L129 PetriNetUnfolder]: 4/68 cut-off events. [2020-09-11 20:15:59,970 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-09-11 20:15:59,977 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-09-11 20:15:59,981 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 126 flow [2020-09-11 20:16:00,008 INFO L129 PetriNetUnfolder]: 4/68 cut-off events. [2020-09-11 20:16:00,008 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-09-11 20:16:00,010 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-09-11 20:16:00,012 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 592 [2020-09-11 20:16:00,013 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-09-11 20:16:01,420 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2020-09-11 20:16:01,694 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2020-09-11 20:16:01,801 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2020-09-11 20:16:01,975 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2020-09-11 20:16:02,071 INFO L206 etLargeBlockEncoding]: Checked pairs total: 486 [2020-09-11 20:16:02,072 INFO L214 etLargeBlockEncoding]: Total number of compositions: 51 [2020-09-11 20:16:02,077 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-09-11 20:16:02,091 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-09-11 20:16:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-09-11 20:16:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-09-11 20:16:02,102 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:02,103 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-09-11 20:16:02,104 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 20:16:02,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:02,112 INFO L82 PathProgramCache]: Analyzing trace with hash 229686, now seen corresponding path program 1 times [2020-09-11 20:16:02,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:02,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076909054] [2020-09-11 20:16:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:02,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076909054] [2020-09-11 20:16:02,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:02,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-09-11 20:16:02,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572568799] [2020-09-11 20:16:02,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 20:16:02,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:02,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 20:16:02,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 20:16:02,398 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-09-11 20:16:02,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:02,442 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-09-11 20:16:02,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 20:16:02,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-09-11 20:16:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:02,459 INFO L225 Difference]: With dead ends: 35 [2020-09-11 20:16:02,459 INFO L226 Difference]: Without dead ends: 31 [2020-09-11 20:16:02,461 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-09-11 20:16:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-09-11 20:16:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-09-11 20:16:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-09-11 20:16:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-09-11 20:16:02,509 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-09-11 20:16:02,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:02,509 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-09-11 20:16:02,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 20:16:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-09-11 20:16:02,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-09-11 20:16:02,510 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:02,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:02,511 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-11 20:16:02,511 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 20:16:02,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:02,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1647647331, now seen corresponding path program 1 times [2020-09-11 20:16:02,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:02,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488566155] [2020-09-11 20:16:02,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:02,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488566155] [2020-09-11 20:16:02,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:02,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-11 20:16:02,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201819305] [2020-09-11 20:16:02,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-11 20:16:02,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:02,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-11 20:16:02,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-09-11 20:16:02,652 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2020-09-11 20:16:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:02,678 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-09-11 20:16:02,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-11 20:16:02,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-09-11 20:16:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:02,680 INFO L225 Difference]: With dead ends: 26 [2020-09-11 20:16:02,680 INFO L226 Difference]: Without dead ends: 24 [2020-09-11 20:16:02,681 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-09-11 20:16:02,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-09-11 20:16:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-09-11 20:16:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-09-11 20:16:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-09-11 20:16:02,686 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-09-11 20:16:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:02,687 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-09-11 20:16:02,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-11 20:16:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-09-11 20:16:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-09-11 20:16:02,688 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:02,688 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:02,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-11 20:16:02,688 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 20:16:02,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:02,689 INFO L82 PathProgramCache]: Analyzing trace with hash -462538936, now seen corresponding path program 1 times [2020-09-11 20:16:02,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:02,689 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697017422] [2020-09-11 20:16:02,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 20:16:02,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 20:16:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 20:16:02,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 20:16:02,760 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-11 20:16:02,761 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-11 20:16:02,761 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-11 20:16:02,762 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-11 20:16:02,762 WARN L363 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-09-11 20:16:02,763 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-09-11 20:16:02,772 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,773 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,773 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,773 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,773 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,773 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,773 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,774 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,774 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,774 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,774 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,774 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,775 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,775 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,776 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,777 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,780 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,780 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,781 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,781 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,781 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,784 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,784 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,785 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,785 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,785 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,790 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,790 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,791 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,791 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,793 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,793 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,794 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:02,795 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-09-11 20:16:02,795 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 20:16:02,796 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 20:16:02,796 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-11 20:16:02,796 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 20:16:02,796 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 20:16:02,796 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 20:16:02,796 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 20:16:02,797 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 20:16:02,799 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 74 transitions, 172 flow [2020-09-11 20:16:02,799 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 74 transitions, 172 flow [2020-09-11 20:16:02,818 INFO L129 PetriNetUnfolder]: 5/89 cut-off events. [2020-09-11 20:16:02,819 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-09-11 20:16:02,820 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-09-11 20:16:02,822 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 74 transitions, 172 flow [2020-09-11 20:16:02,839 INFO L129 PetriNetUnfolder]: 5/89 cut-off events. [2020-09-11 20:16:02,839 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-09-11 20:16:02,840 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-09-11 20:16:02,842 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 920 [2020-09-11 20:16:02,842 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-09-11 20:16:04,312 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2020-09-11 20:16:04,554 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-09-11 20:16:04,717 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-09-11 20:16:04,723 INFO L206 etLargeBlockEncoding]: Checked pairs total: 942 [2020-09-11 20:16:04,723 INFO L214 etLargeBlockEncoding]: Total number of compositions: 62 [2020-09-11 20:16:04,724 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 21 transitions, 66 flow [2020-09-11 20:16:04,737 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2020-09-11 20:16:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2020-09-11 20:16:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-09-11 20:16:04,738 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:04,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-09-11 20:16:04,738 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:16:04,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash 384194, now seen corresponding path program 1 times [2020-09-11 20:16:04,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:04,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121671433] [2020-09-11 20:16:04,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:04,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121671433] [2020-09-11 20:16:04,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:04,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-09-11 20:16:04,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351403366] [2020-09-11 20:16:04,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 20:16:04,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:04,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 20:16:04,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 20:16:04,804 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2020-09-11 20:16:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:04,850 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2020-09-11 20:16:04,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 20:16:04,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-09-11 20:16:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:04,857 INFO L225 Difference]: With dead ends: 185 [2020-09-11 20:16:04,857 INFO L226 Difference]: Without dead ends: 171 [2020-09-11 20:16:04,857 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-09-11 20:16:04,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-09-11 20:16:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-09-11 20:16:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-09-11 20:16:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 418 transitions. [2020-09-11 20:16:04,884 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 418 transitions. Word has length 3 [2020-09-11 20:16:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:04,885 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 418 transitions. [2020-09-11 20:16:04,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 20:16:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 418 transitions. [2020-09-11 20:16:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-11 20:16:04,886 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:04,886 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:04,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-11 20:16:04,886 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:16:04,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:04,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1694917346, now seen corresponding path program 1 times [2020-09-11 20:16:04,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:04,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060543291] [2020-09-11 20:16:04,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:04,986 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060543291] [2020-09-11 20:16:04,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:04,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:16:04,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090847615] [2020-09-11 20:16:04,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:16:04,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:04,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:16:04,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:16:04,988 INFO L87 Difference]: Start difference. First operand 171 states and 418 transitions. Second operand 5 states. [2020-09-11 20:16:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:05,108 INFO L93 Difference]: Finished difference Result 205 states and 460 transitions. [2020-09-11 20:16:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:16:05,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-09-11 20:16:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:05,114 INFO L225 Difference]: With dead ends: 205 [2020-09-11 20:16:05,115 INFO L226 Difference]: Without dead ends: 201 [2020-09-11 20:16:05,115 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-09-11 20:16:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-09-11 20:16:05,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2020-09-11 20:16:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-09-11 20:16:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2020-09-11 20:16:05,140 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2020-09-11 20:16:05,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:05,140 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2020-09-11 20:16:05,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:16:05,141 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2020-09-11 20:16:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-11 20:16:05,142 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:05,142 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:05,142 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-11 20:16:05,143 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:16:05,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:05,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1027741454, now seen corresponding path program 1 times [2020-09-11 20:16:05,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:05,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131517293] [2020-09-11 20:16:05,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:05,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:05,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131517293] [2020-09-11 20:16:05,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:05,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:16:05,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274197861] [2020-09-11 20:16:05,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:16:05,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:05,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:16:05,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:16:05,217 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2020-09-11 20:16:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:05,299 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2020-09-11 20:16:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:16:05,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-11 20:16:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:05,302 INFO L225 Difference]: With dead ends: 189 [2020-09-11 20:16:05,302 INFO L226 Difference]: Without dead ends: 185 [2020-09-11 20:16:05,302 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-09-11 20:16:05,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-09-11 20:16:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2020-09-11 20:16:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-09-11 20:16:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2020-09-11 20:16:05,315 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2020-09-11 20:16:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:05,316 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2020-09-11 20:16:05,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:16:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2020-09-11 20:16:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-11 20:16:05,318 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:05,318 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:05,318 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-11 20:16:05,319 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:16:05,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:05,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1792799235, now seen corresponding path program 1 times [2020-09-11 20:16:05,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:05,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145632403] [2020-09-11 20:16:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 20:16:05,341 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 20:16:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 20:16:05,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 20:16:05,364 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-11 20:16:05,364 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-11 20:16:05,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-11 20:16:05,365 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-11 20:16:05,365 WARN L363 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-09-11 20:16:05,367 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-09-11 20:16:05,376 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,377 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,377 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,377 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,377 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,377 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,378 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,378 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,378 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,378 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,378 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,379 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,379 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,379 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,379 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,379 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,379 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,380 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,380 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,380 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,380 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,387 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,387 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,387 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,387 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,388 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,391 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,391 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,391 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,392 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,392 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,393 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,393 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,394 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,394 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,394 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,395 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,395 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,396 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,396 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,398 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,398 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,399 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,400 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,400 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,400 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,401 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:05,402 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-09-11 20:16:05,402 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 20:16:05,402 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 20:16:05,402 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-11 20:16:05,403 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 20:16:05,403 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 20:16:05,403 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 20:16:05,403 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 20:16:05,403 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 20:16:05,405 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 90 transitions, 222 flow [2020-09-11 20:16:05,405 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 90 transitions, 222 flow [2020-09-11 20:16:05,426 INFO L129 PetriNetUnfolder]: 6/110 cut-off events. [2020-09-11 20:16:05,426 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-09-11 20:16:05,427 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-09-11 20:16:05,430 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 90 transitions, 222 flow [2020-09-11 20:16:05,446 INFO L129 PetriNetUnfolder]: 6/110 cut-off events. [2020-09-11 20:16:05,447 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-09-11 20:16:05,448 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-09-11 20:16:05,450 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1308 [2020-09-11 20:16:05,450 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-09-11 20:16:07,017 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2020-09-11 20:16:07,343 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-09-11 20:16:07,523 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-09-11 20:16:07,530 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1426 [2020-09-11 20:16:07,530 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2020-09-11 20:16:07,531 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 27 transitions, 96 flow [2020-09-11 20:16:07,560 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2020-09-11 20:16:07,561 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2020-09-11 20:16:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-09-11 20:16:07,561 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:07,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-09-11 20:16:07,562 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:16:07,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:07,562 INFO L82 PathProgramCache]: Analyzing trace with hash 567457, now seen corresponding path program 1 times [2020-09-11 20:16:07,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:07,563 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846626599] [2020-09-11 20:16:07,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:07,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846626599] [2020-09-11 20:16:07,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:07,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-09-11 20:16:07,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595107058] [2020-09-11 20:16:07,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 20:16:07,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:07,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 20:16:07,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 20:16:07,606 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2020-09-11 20:16:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:07,657 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2020-09-11 20:16:07,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 20:16:07,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-09-11 20:16:07,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:07,664 INFO L225 Difference]: With dead ends: 600 [2020-09-11 20:16:07,665 INFO L226 Difference]: Without dead ends: 559 [2020-09-11 20:16:07,665 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-09-11 20:16:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-09-11 20:16:07,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2020-09-11 20:16:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-09-11 20:16:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1737 transitions. [2020-09-11 20:16:07,704 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1737 transitions. Word has length 3 [2020-09-11 20:16:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:07,704 INFO L479 AbstractCegarLoop]: Abstraction has 559 states and 1737 transitions. [2020-09-11 20:16:07,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 20:16:07,704 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1737 transitions. [2020-09-11 20:16:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-11 20:16:07,705 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:07,705 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:07,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-11 20:16:07,706 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:16:07,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:07,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1052273544, now seen corresponding path program 1 times [2020-09-11 20:16:07,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:07,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752307889] [2020-09-11 20:16:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:07,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752307889] [2020-09-11 20:16:07,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:07,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:16:07,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732112277] [2020-09-11 20:16:07,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:16:07,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:07,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:16:07,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:16:07,798 INFO L87 Difference]: Start difference. First operand 559 states and 1737 transitions. Second operand 5 states. [2020-09-11 20:16:07,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:07,926 INFO L93 Difference]: Finished difference Result 817 states and 2317 transitions. [2020-09-11 20:16:07,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:16:07,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-09-11 20:16:07,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:07,935 INFO L225 Difference]: With dead ends: 817 [2020-09-11 20:16:07,935 INFO L226 Difference]: Without dead ends: 812 [2020-09-11 20:16:07,936 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-09-11 20:16:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-09-11 20:16:07,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 585. [2020-09-11 20:16:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2020-09-11 20:16:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1832 transitions. [2020-09-11 20:16:07,967 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1832 transitions. Word has length 9 [2020-09-11 20:16:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:07,967 INFO L479 AbstractCegarLoop]: Abstraction has 585 states and 1832 transitions. [2020-09-11 20:16:07,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:16:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1832 transitions. [2020-09-11 20:16:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-11 20:16:07,973 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:07,974 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:07,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-11 20:16:07,974 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:16:07,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:07,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1096280394, now seen corresponding path program 1 times [2020-09-11 20:16:07,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:07,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037005605] [2020-09-11 20:16:07,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:08,068 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037005605] [2020-09-11 20:16:08,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:08,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:16:08,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293369564] [2020-09-11 20:16:08,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:16:08,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:08,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:16:08,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:16:08,070 INFO L87 Difference]: Start difference. First operand 585 states and 1832 transitions. Second operand 5 states. [2020-09-11 20:16:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:08,178 INFO L93 Difference]: Finished difference Result 843 states and 2406 transitions. [2020-09-11 20:16:08,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:16:08,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-11 20:16:08,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:08,185 INFO L225 Difference]: With dead ends: 843 [2020-09-11 20:16:08,185 INFO L226 Difference]: Without dead ends: 836 [2020-09-11 20:16:08,186 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-09-11 20:16:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-09-11 20:16:08,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 611. [2020-09-11 20:16:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2020-09-11 20:16:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1906 transitions. [2020-09-11 20:16:08,215 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1906 transitions. Word has length 13 [2020-09-11 20:16:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:08,216 INFO L479 AbstractCegarLoop]: Abstraction has 611 states and 1906 transitions. [2020-09-11 20:16:08,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:16:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1906 transitions. [2020-09-11 20:16:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 20:16:08,217 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:08,217 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:08,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-11 20:16:08,217 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:16:08,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:08,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2044985054, now seen corresponding path program 1 times [2020-09-11 20:16:08,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:08,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991359546] [2020-09-11 20:16:08,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:08,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991359546] [2020-09-11 20:16:08,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217641499] [2020-09-11 20:16:08,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:08,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:16:08,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:08,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:08,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:16:08,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659939314] [2020-09-11 20:16:08,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:16:08,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:08,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:16:08,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:16:08,529 INFO L87 Difference]: Start difference. First operand 611 states and 1906 transitions. Second operand 12 states. [2020-09-11 20:16:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:08,887 INFO L93 Difference]: Finished difference Result 1059 states and 2818 transitions. [2020-09-11 20:16:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:08,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-09-11 20:16:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:08,898 INFO L225 Difference]: With dead ends: 1059 [2020-09-11 20:16:08,898 INFO L226 Difference]: Without dead ends: 1052 [2020-09-11 20:16:08,899 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-09-11 20:16:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-09-11 20:16:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 591. [2020-09-11 20:16:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-09-11 20:16:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1840 transitions. [2020-09-11 20:16:08,935 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1840 transitions. Word has length 15 [2020-09-11 20:16:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:08,936 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 1840 transitions. [2020-09-11 20:16:08,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:16:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1840 transitions. [2020-09-11 20:16:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 20:16:08,938 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:08,938 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:09,151 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-09-11 20:16:09,151 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:16:09,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:09,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1258473782, now seen corresponding path program 2 times [2020-09-11 20:16:09,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:09,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759217347] [2020-09-11 20:16:09,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:09,233 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759217347] [2020-09-11 20:16:09,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:09,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:16:09,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798150506] [2020-09-11 20:16:09,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:16:09,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:09,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:16:09,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:16:09,235 INFO L87 Difference]: Start difference. First operand 591 states and 1840 transitions. Second operand 7 states. [2020-09-11 20:16:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:09,565 INFO L93 Difference]: Finished difference Result 1053 states and 2807 transitions. [2020-09-11 20:16:09,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:09,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-09-11 20:16:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:09,575 INFO L225 Difference]: With dead ends: 1053 [2020-09-11 20:16:09,575 INFO L226 Difference]: Without dead ends: 1045 [2020-09-11 20:16:09,576 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-09-11 20:16:09,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-09-11 20:16:09,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2020-09-11 20:16:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-09-11 20:16:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2020-09-11 20:16:09,611 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2020-09-11 20:16:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:09,611 INFO L479 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2020-09-11 20:16:09,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:16:09,612 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2020-09-11 20:16:09,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-11 20:16:09,613 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:09,614 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:09,614 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-11 20:16:09,614 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:16:09,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:09,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1734594488, now seen corresponding path program 1 times [2020-09-11 20:16:09,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:09,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57592765] [2020-09-11 20:16:09,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:16:09,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57592765] [2020-09-11 20:16:09,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:09,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:16:09,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340854779] [2020-09-11 20:16:09,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:16:09,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:09,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:16:09,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:16:09,695 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2020-09-11 20:16:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:09,804 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2020-09-11 20:16:09,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:16:09,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-11 20:16:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:09,811 INFO L225 Difference]: With dead ends: 736 [2020-09-11 20:16:09,811 INFO L226 Difference]: Without dead ends: 728 [2020-09-11 20:16:09,812 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-09-11 20:16:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-09-11 20:16:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2020-09-11 20:16:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-09-11 20:16:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2020-09-11 20:16:09,834 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2020-09-11 20:16:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:09,835 INFO L479 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2020-09-11 20:16:09,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:16:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2020-09-11 20:16:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 20:16:09,836 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:09,837 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:09,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-11 20:16:09,837 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 20:16:09,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:09,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2065233823, now seen corresponding path program 1 times [2020-09-11 20:16:09,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:09,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429239599] [2020-09-11 20:16:09,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 20:16:09,854 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 20:16:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 20:16:09,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 20:16:09,874 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-11 20:16:09,874 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-11 20:16:09,875 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-11 20:16:09,875 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-11 20:16:09,875 WARN L363 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-09-11 20:16:09,876 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-09-11 20:16:09,888 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,889 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,889 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,889 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,889 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,889 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,889 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,890 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,890 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,890 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,890 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,890 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,890 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,891 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,891 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,891 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,891 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,891 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,891 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,892 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,892 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,892 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,892 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,892 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,892 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,893 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,893 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,893 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,893 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,893 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,894 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,894 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,895 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,895 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,896 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,896 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,897 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,897 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,898 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,898 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,899 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,899 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,900 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,900 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,900 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,901 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,901 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,901 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,904 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,904 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,905 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,905 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,905 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,907 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,907 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,907 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,907 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,908 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,909 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,909 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,910 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,910 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,910 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,911 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,912 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,912 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,914 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,914 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,916 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,916 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,917 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:09,920 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-09-11 20:16:09,920 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 20:16:09,920 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 20:16:09,920 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-11 20:16:09,921 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 20:16:09,921 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 20:16:09,921 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 20:16:09,921 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 20:16:09,921 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 20:16:09,923 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 106 transitions, 276 flow [2020-09-11 20:16:09,923 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 106 transitions, 276 flow [2020-09-11 20:16:09,939 INFO L129 PetriNetUnfolder]: 7/131 cut-off events. [2020-09-11 20:16:09,939 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-09-11 20:16:09,941 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-09-11 20:16:09,944 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 106 transitions, 276 flow [2020-09-11 20:16:09,958 INFO L129 PetriNetUnfolder]: 7/131 cut-off events. [2020-09-11 20:16:09,958 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-09-11 20:16:09,960 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-09-11 20:16:09,963 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1756 [2020-09-11 20:16:09,963 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-09-11 20:16:11,830 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-09-11 20:16:11,944 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-09-11 20:16:12,184 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2020-09-11 20:16:12,419 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-09-11 20:16:12,530 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2033 [2020-09-11 20:16:12,531 INFO L214 etLargeBlockEncoding]: Total number of compositions: 86 [2020-09-11 20:16:12,531 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 33 transitions, 130 flow [2020-09-11 20:16:12,656 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2020-09-11 20:16:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2020-09-11 20:16:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-09-11 20:16:12,657 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:12,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-09-11 20:16:12,657 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-09-11 20:16:12,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:12,657 INFO L82 PathProgramCache]: Analyzing trace with hash 779528, now seen corresponding path program 1 times [2020-09-11 20:16:12,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:12,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439565225] [2020-09-11 20:16:12,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:12,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439565225] [2020-09-11 20:16:12,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:12,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-09-11 20:16:12,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005100316] [2020-09-11 20:16:12,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 20:16:12,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:12,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 20:16:12,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 20:16:12,684 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2020-09-11 20:16:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:12,734 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2020-09-11 20:16:12,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 20:16:12,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-09-11 20:16:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:12,752 INFO L225 Difference]: With dead ends: 1889 [2020-09-11 20:16:12,752 INFO L226 Difference]: Without dead ends: 1767 [2020-09-11 20:16:12,753 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-09-11 20:16:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2020-09-11 20:16:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2020-09-11 20:16:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2020-09-11 20:16:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 6690 transitions. [2020-09-11 20:16:12,843 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 6690 transitions. Word has length 3 [2020-09-11 20:16:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:12,843 INFO L479 AbstractCegarLoop]: Abstraction has 1767 states and 6690 transitions. [2020-09-11 20:16:12,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 20:16:12,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 6690 transitions. [2020-09-11 20:16:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-11 20:16:12,844 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:12,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:12,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-11 20:16:12,844 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-09-11 20:16:12,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:12,845 INFO L82 PathProgramCache]: Analyzing trace with hash -666106918, now seen corresponding path program 1 times [2020-09-11 20:16:12,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:12,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240837124] [2020-09-11 20:16:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:12,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240837124] [2020-09-11 20:16:12,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:12,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:16:12,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622654739] [2020-09-11 20:16:12,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:16:12,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:12,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:16:12,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:16:12,894 INFO L87 Difference]: Start difference. First operand 1767 states and 6690 transitions. Second operand 5 states. [2020-09-11 20:16:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:13,023 INFO L93 Difference]: Finished difference Result 2905 states and 10138 transitions. [2020-09-11 20:16:13,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:16:13,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-09-11 20:16:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:13,050 INFO L225 Difference]: With dead ends: 2905 [2020-09-11 20:16:13,051 INFO L226 Difference]: Without dead ends: 2899 [2020-09-11 20:16:13,051 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-09-11 20:16:13,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-09-11 20:16:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1966. [2020-09-11 20:16:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2020-09-11 20:16:13,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 7503 transitions. [2020-09-11 20:16:13,164 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 7503 transitions. Word has length 9 [2020-09-11 20:16:13,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:13,164 INFO L479 AbstractCegarLoop]: Abstraction has 1966 states and 7503 transitions. [2020-09-11 20:16:13,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:16:13,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 7503 transitions. [2020-09-11 20:16:13,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-11 20:16:13,165 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:13,165 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:13,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-11 20:16:13,165 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-09-11 20:16:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1766896000, now seen corresponding path program 1 times [2020-09-11 20:16:13,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:13,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064596308] [2020-09-11 20:16:13,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:13,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064596308] [2020-09-11 20:16:13,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:13,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:16:13,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905448349] [2020-09-11 20:16:13,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:16:13,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:13,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:16:13,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:16:13,221 INFO L87 Difference]: Start difference. First operand 1966 states and 7503 transitions. Second operand 5 states. [2020-09-11 20:16:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:13,349 INFO L93 Difference]: Finished difference Result 3204 states and 11312 transitions. [2020-09-11 20:16:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:16:13,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-11 20:16:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:13,385 INFO L225 Difference]: With dead ends: 3204 [2020-09-11 20:16:13,385 INFO L226 Difference]: Without dead ends: 3194 [2020-09-11 20:16:13,385 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-09-11 20:16:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2020-09-11 20:16:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2200. [2020-09-11 20:16:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2020-09-11 20:16:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 8453 transitions. [2020-09-11 20:16:13,601 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 8453 transitions. Word has length 13 [2020-09-11 20:16:13,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:13,601 INFO L479 AbstractCegarLoop]: Abstraction has 2200 states and 8453 transitions. [2020-09-11 20:16:13,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:16:13,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 8453 transitions. [2020-09-11 20:16:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 20:16:13,602 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:13,602 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:13,603 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-11 20:16:13,603 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-09-11 20:16:13,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:13,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1022394712, now seen corresponding path program 1 times [2020-09-11 20:16:13,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:13,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681032376] [2020-09-11 20:16:13,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:13,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681032376] [2020-09-11 20:16:13,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811124305] [2020-09-11 20:16:13,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:13,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:16:13,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:13,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:13,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:16:13,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582512162] [2020-09-11 20:16:13,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:16:13,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:13,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:16:13,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:16:13,837 INFO L87 Difference]: Start difference. First operand 2200 states and 8453 transitions. Second operand 12 states. [2020-09-11 20:16:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:14,178 INFO L93 Difference]: Finished difference Result 4556 states and 14911 transitions. [2020-09-11 20:16:14,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:14,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-09-11 20:16:14,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:14,204 INFO L225 Difference]: With dead ends: 4556 [2020-09-11 20:16:14,204 INFO L226 Difference]: Without dead ends: 4546 [2020-09-11 20:16:14,205 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-09-11 20:16:14,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2020-09-11 20:16:14,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2157. [2020-09-11 20:16:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2020-09-11 20:16:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 8278 transitions. [2020-09-11 20:16:14,323 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 8278 transitions. Word has length 15 [2020-09-11 20:16:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:14,324 INFO L479 AbstractCegarLoop]: Abstraction has 2157 states and 8278 transitions. [2020-09-11 20:16:14,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:16:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 8278 transitions. [2020-09-11 20:16:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 20:16:14,325 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:14,325 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:14,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-09-11 20:16:14,540 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-09-11 20:16:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:14,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1474969304, now seen corresponding path program 2 times [2020-09-11 20:16:14,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:14,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498238996] [2020-09-11 20:16:14,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:14,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498238996] [2020-09-11 20:16:14,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:14,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:16:14,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028628041] [2020-09-11 20:16:14,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:16:14,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:14,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:16:14,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:16:14,612 INFO L87 Difference]: Start difference. First operand 2157 states and 8278 transitions. Second operand 7 states. [2020-09-11 20:16:14,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:14,883 INFO L93 Difference]: Finished difference Result 4612 states and 15111 transitions. [2020-09-11 20:16:14,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:14,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-09-11 20:16:14,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:14,908 INFO L225 Difference]: With dead ends: 4612 [2020-09-11 20:16:14,908 INFO L226 Difference]: Without dead ends: 4601 [2020-09-11 20:16:14,909 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-09-11 20:16:14,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2020-09-11 20:16:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 2035. [2020-09-11 20:16:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2020-09-11 20:16:15,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 7845 transitions. [2020-09-11 20:16:15,028 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 7845 transitions. Word has length 15 [2020-09-11 20:16:15,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:15,029 INFO L479 AbstractCegarLoop]: Abstraction has 2035 states and 7845 transitions. [2020-09-11 20:16:15,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:16:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 7845 transitions. [2020-09-11 20:16:15,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-11 20:16:15,030 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:15,030 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:15,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-11 20:16:15,030 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-09-11 20:16:15,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1278978660, now seen corresponding path program 1 times [2020-09-11 20:16:15,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:15,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302899103] [2020-09-11 20:16:15,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:16:15,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302899103] [2020-09-11 20:16:15,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:15,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:16:15,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848074344] [2020-09-11 20:16:15,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:16:15,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:15,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:16:15,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:16:15,186 INFO L87 Difference]: Start difference. First operand 2035 states and 7845 transitions. Second operand 5 states. [2020-09-11 20:16:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:15,332 INFO L93 Difference]: Finished difference Result 3265 states and 11681 transitions. [2020-09-11 20:16:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:16:15,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-11 20:16:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:15,346 INFO L225 Difference]: With dead ends: 3265 [2020-09-11 20:16:15,346 INFO L226 Difference]: Without dead ends: 3250 [2020-09-11 20:16:15,346 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-09-11 20:16:15,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-09-11 20:16:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2281. [2020-09-11 20:16:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2020-09-11 20:16:15,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 8755 transitions. [2020-09-11 20:16:15,438 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 8755 transitions. Word has length 17 [2020-09-11 20:16:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:15,439 INFO L479 AbstractCegarLoop]: Abstraction has 2281 states and 8755 transitions. [2020-09-11 20:16:15,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:16:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 8755 transitions. [2020-09-11 20:16:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 20:16:15,440 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:15,440 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:15,440 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-11 20:16:15,440 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-09-11 20:16:15,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:15,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1455436228, now seen corresponding path program 1 times [2020-09-11 20:16:15,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:15,441 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429827337] [2020-09-11 20:16:15,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:16:15,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429827337] [2020-09-11 20:16:15,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905337954] [2020-09-11 20:16:15,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:15,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:16:15,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:16:15,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:15,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:16:15,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748117917] [2020-09-11 20:16:15,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:16:15,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:15,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:16:15,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:16:15,682 INFO L87 Difference]: Start difference. First operand 2281 states and 8755 transitions. Second operand 12 states. [2020-09-11 20:16:16,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:16,187 INFO L93 Difference]: Finished difference Result 4825 states and 15986 transitions. [2020-09-11 20:16:16,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:16,188 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-09-11 20:16:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:16,205 INFO L225 Difference]: With dead ends: 4825 [2020-09-11 20:16:16,205 INFO L226 Difference]: Without dead ends: 4813 [2020-09-11 20:16:16,205 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-09-11 20:16:16,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2020-09-11 20:16:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 2305. [2020-09-11 20:16:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2020-09-11 20:16:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 8815 transitions. [2020-09-11 20:16:16,315 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 8815 transitions. Word has length 19 [2020-09-11 20:16:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:16,316 INFO L479 AbstractCegarLoop]: Abstraction has 2305 states and 8815 transitions. [2020-09-11 20:16:16,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:16:16,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 8815 transitions. [2020-09-11 20:16:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 20:16:16,317 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:16,318 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:16,532 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:16:16,532 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-09-11 20:16:16,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:16,533 INFO L82 PathProgramCache]: Analyzing trace with hash -979473248, now seen corresponding path program 1 times [2020-09-11 20:16:16,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:16,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378364484] [2020-09-11 20:16:16,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:16,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378364484] [2020-09-11 20:16:16,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087399137] [2020-09-11 20:16:16,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:16,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:16:16,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:16,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:16,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:16:16,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216478214] [2020-09-11 20:16:16,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:16:16,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:16,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:16:16,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:16:16,841 INFO L87 Difference]: Start difference. First operand 2305 states and 8815 transitions. Second operand 12 states. [2020-09-11 20:16:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:17,281 INFO L93 Difference]: Finished difference Result 4942 states and 16410 transitions. [2020-09-11 20:16:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:17,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-09-11 20:16:17,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:17,297 INFO L225 Difference]: With dead ends: 4942 [2020-09-11 20:16:17,298 INFO L226 Difference]: Without dead ends: 4925 [2020-09-11 20:16:17,298 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-09-11 20:16:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2020-09-11 20:16:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 2299. [2020-09-11 20:16:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2020-09-11 20:16:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 8782 transitions. [2020-09-11 20:16:17,405 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 8782 transitions. Word has length 19 [2020-09-11 20:16:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:17,405 INFO L479 AbstractCegarLoop]: Abstraction has 2299 states and 8782 transitions. [2020-09-11 20:16:17,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:16:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 8782 transitions. [2020-09-11 20:16:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 20:16:17,407 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:17,407 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:17,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:16:17,623 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-09-11 20:16:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash -737855584, now seen corresponding path program 2 times [2020-09-11 20:16:17,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:17,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056742671] [2020-09-11 20:16:17,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:16:17,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056742671] [2020-09-11 20:16:17,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:17,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:16:17,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706807749] [2020-09-11 20:16:17,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:16:17,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:17,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:16:17,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:16:17,700 INFO L87 Difference]: Start difference. First operand 2299 states and 8782 transitions. Second operand 7 states. [2020-09-11 20:16:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:17,974 INFO L93 Difference]: Finished difference Result 4934 states and 16393 transitions. [2020-09-11 20:16:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:17,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-11 20:16:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:17,983 INFO L225 Difference]: With dead ends: 4934 [2020-09-11 20:16:17,983 INFO L226 Difference]: Without dead ends: 4917 [2020-09-11 20:16:17,984 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-09-11 20:16:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2020-09-11 20:16:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 2216. [2020-09-11 20:16:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2020-09-11 20:16:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 8477 transitions. [2020-09-11 20:16:18,071 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 8477 transitions. Word has length 19 [2020-09-11 20:16:18,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:18,071 INFO L479 AbstractCegarLoop]: Abstraction has 2216 states and 8477 transitions. [2020-09-11 20:16:18,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:16:18,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 8477 transitions. [2020-09-11 20:16:18,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 20:16:18,073 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:18,073 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:18,073 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-11 20:16:18,073 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-09-11 20:16:18,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:18,073 INFO L82 PathProgramCache]: Analyzing trace with hash -737840828, now seen corresponding path program 2 times [2020-09-11 20:16:18,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:18,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530630738] [2020-09-11 20:16:18,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:16:18,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530630738] [2020-09-11 20:16:18,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:18,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:16:18,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882655400] [2020-09-11 20:16:18,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:16:18,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:18,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:16:18,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:16:18,150 INFO L87 Difference]: Start difference. First operand 2216 states and 8477 transitions. Second operand 7 states. [2020-09-11 20:16:18,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:18,465 INFO L93 Difference]: Finished difference Result 4774 states and 15828 transitions. [2020-09-11 20:16:18,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:18,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-11 20:16:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:18,477 INFO L225 Difference]: With dead ends: 4774 [2020-09-11 20:16:18,477 INFO L226 Difference]: Without dead ends: 4757 [2020-09-11 20:16:18,478 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-09-11 20:16:18,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2020-09-11 20:16:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 2150. [2020-09-11 20:16:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2020-09-11 20:16:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 8243 transitions. [2020-09-11 20:16:18,566 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 8243 transitions. Word has length 19 [2020-09-11 20:16:18,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:18,567 INFO L479 AbstractCegarLoop]: Abstraction has 2150 states and 8243 transitions. [2020-09-11 20:16:18,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:16:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 8243 transitions. [2020-09-11 20:16:18,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:16:18,569 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:18,569 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:18,569 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-11 20:16:18,569 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-09-11 20:16:18,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1726751032, now seen corresponding path program 1 times [2020-09-11 20:16:18,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:18,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69101403] [2020-09-11 20:16:18,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:18,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69101403] [2020-09-11 20:16:18,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381126751] [2020-09-11 20:16:18,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:18,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:16:18,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:18,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:18,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:16:18,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364005634] [2020-09-11 20:16:18,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:16:18,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:18,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:16:18,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:16:18,922 INFO L87 Difference]: Start difference. First operand 2150 states and 8243 transitions. Second operand 16 states. [2020-09-11 20:16:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:19,844 INFO L93 Difference]: Finished difference Result 6025 states and 18746 transitions. [2020-09-11 20:16:19,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:16:19,845 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-09-11 20:16:19,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:19,855 INFO L225 Difference]: With dead ends: 6025 [2020-09-11 20:16:19,856 INFO L226 Difference]: Without dead ends: 6017 [2020-09-11 20:16:19,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:16:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-09-11 20:16:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 2117. [2020-09-11 20:16:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2020-09-11 20:16:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 8106 transitions. [2020-09-11 20:16:19,929 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 8106 transitions. Word has length 21 [2020-09-11 20:16:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:19,929 INFO L479 AbstractCegarLoop]: Abstraction has 2117 states and 8106 transitions. [2020-09-11 20:16:19,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:16:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 8106 transitions. [2020-09-11 20:16:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:16:19,931 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:19,931 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:20,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-09-11 20:16:20,138 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-09-11 20:16:20,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:20,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1485133368, now seen corresponding path program 2 times [2020-09-11 20:16:20,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:20,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166850681] [2020-09-11 20:16:20,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:16:20,271 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166850681] [2020-09-11 20:16:20,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775068717] [2020-09-11 20:16:20,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:20,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 20:16:20,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:16:20,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:16:20,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:16:20,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:20,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:16:20,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008675695] [2020-09-11 20:16:20,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:16:20,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:20,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:16:20,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:16:20,490 INFO L87 Difference]: Start difference. First operand 2117 states and 8106 transitions. Second operand 16 states. [2020-09-11 20:16:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:21,423 INFO L93 Difference]: Finished difference Result 5914 states and 18384 transitions. [2020-09-11 20:16:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:16:21,424 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-09-11 20:16:21,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:21,435 INFO L225 Difference]: With dead ends: 5914 [2020-09-11 20:16:21,435 INFO L226 Difference]: Without dead ends: 5903 [2020-09-11 20:16:21,436 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:16:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2020-09-11 20:16:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 2085. [2020-09-11 20:16:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2020-09-11 20:16:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 7975 transitions. [2020-09-11 20:16:21,537 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 7975 transitions. Word has length 21 [2020-09-11 20:16:21,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:21,538 INFO L479 AbstractCegarLoop]: Abstraction has 2085 states and 7975 transitions. [2020-09-11 20:16:21,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:16:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 7975 transitions. [2020-09-11 20:16:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:16:21,540 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:21,540 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:21,754 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:16:21,754 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-09-11 20:16:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash -268549816, now seen corresponding path program 3 times [2020-09-11 20:16:21,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:21,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085427200] [2020-09-11 20:16:21,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:21,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085427200] [2020-09-11 20:16:21,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602326444] [2020-09-11 20:16:21,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:21,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-09-11 20:16:21,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:16:21,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:16:21,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:22,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:22,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:16:22,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672333518] [2020-09-11 20:16:22,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:16:22,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:22,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:16:22,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:16:22,147 INFO L87 Difference]: Start difference. First operand 2085 states and 7975 transitions. Second operand 16 states. [2020-09-11 20:16:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:23,013 INFO L93 Difference]: Finished difference Result 5907 states and 18375 transitions. [2020-09-11 20:16:23,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:16:23,014 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-09-11 20:16:23,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:23,023 INFO L225 Difference]: With dead ends: 5907 [2020-09-11 20:16:23,024 INFO L226 Difference]: Without dead ends: 5899 [2020-09-11 20:16:23,024 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:16:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2020-09-11 20:16:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 2008. [2020-09-11 20:16:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2020-09-11 20:16:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 7698 transitions. [2020-09-11 20:16:23,106 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 7698 transitions. Word has length 21 [2020-09-11 20:16:23,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:23,106 INFO L479 AbstractCegarLoop]: Abstraction has 2008 states and 7698 transitions. [2020-09-11 20:16:23,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:16:23,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 7698 transitions. [2020-09-11 20:16:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:16:23,109 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:23,109 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:23,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-09-11 20:16:23,322 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-09-11 20:16:23,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:23,323 INFO L82 PathProgramCache]: Analyzing trace with hash -675948728, now seen corresponding path program 4 times [2020-09-11 20:16:23,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:23,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145953033] [2020-09-11 20:16:23,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:23,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145953033] [2020-09-11 20:16:23,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364646584] [2020-09-11 20:16:23,414 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:23,543 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-11 20:16:23,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:16:23,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:16:23,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:23,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:23,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:16:23,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802980493] [2020-09-11 20:16:23,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:16:23,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:23,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:16:23,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:16:23,664 INFO L87 Difference]: Start difference. First operand 2008 states and 7698 transitions. Second operand 16 states. [2020-09-11 20:16:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:24,682 INFO L93 Difference]: Finished difference Result 5835 states and 18155 transitions. [2020-09-11 20:16:24,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:16:24,683 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-09-11 20:16:24,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:24,694 INFO L225 Difference]: With dead ends: 5835 [2020-09-11 20:16:24,694 INFO L226 Difference]: Without dead ends: 5824 [2020-09-11 20:16:24,695 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:16:24,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2020-09-11 20:16:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 1976. [2020-09-11 20:16:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2020-09-11 20:16:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 7567 transitions. [2020-09-11 20:16:24,776 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 7567 transitions. Word has length 21 [2020-09-11 20:16:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:24,776 INFO L479 AbstractCegarLoop]: Abstraction has 1976 states and 7567 transitions. [2020-09-11 20:16:24,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:16:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 7567 transitions. [2020-09-11 20:16:24,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:16:24,778 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:24,778 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:24,993 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-09-11 20:16:24,994 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-09-11 20:16:24,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:24,994 INFO L82 PathProgramCache]: Analyzing trace with hash -409607608, now seen corresponding path program 5 times [2020-09-11 20:16:24,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:24,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448555107] [2020-09-11 20:16:24,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:16:25,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448555107] [2020-09-11 20:16:25,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:25,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 20:16:25,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469310593] [2020-09-11 20:16:25,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 20:16:25,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:25,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 20:16:25,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:16:25,094 INFO L87 Difference]: Start difference. First operand 1976 states and 7567 transitions. Second operand 9 states. [2020-09-11 20:16:25,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:25,941 INFO L93 Difference]: Finished difference Result 5820 states and 18126 transitions. [2020-09-11 20:16:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:16:25,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 20:16:25,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:25,952 INFO L225 Difference]: With dead ends: 5820 [2020-09-11 20:16:25,952 INFO L226 Difference]: Without dead ends: 5812 [2020-09-11 20:16:25,953 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-09-11 20:16:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5812 states. [2020-09-11 20:16:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5812 to 1907. [2020-09-11 20:16:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2020-09-11 20:16:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 7310 transitions. [2020-09-11 20:16:26,023 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 7310 transitions. Word has length 21 [2020-09-11 20:16:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:26,023 INFO L479 AbstractCegarLoop]: Abstraction has 1907 states and 7310 transitions. [2020-09-11 20:16:26,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 20:16:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 7310 transitions. [2020-09-11 20:16:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:16:26,025 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:26,025 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:26,026 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-09-11 20:16:26,026 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-09-11 20:16:26,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:26,026 INFO L82 PathProgramCache]: Analyzing trace with hash -395441848, now seen corresponding path program 6 times [2020-09-11 20:16:26,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:26,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063083509] [2020-09-11 20:16:26,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:16:26,129 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063083509] [2020-09-11 20:16:26,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:26,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 20:16:26,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369444155] [2020-09-11 20:16:26,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 20:16:26,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:26,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 20:16:26,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:16:26,131 INFO L87 Difference]: Start difference. First operand 1907 states and 7310 transitions. Second operand 9 states. [2020-09-11 20:16:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:26,998 INFO L93 Difference]: Finished difference Result 5717 states and 17784 transitions. [2020-09-11 20:16:26,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:16:26,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 20:16:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:27,007 INFO L225 Difference]: With dead ends: 5717 [2020-09-11 20:16:27,008 INFO L226 Difference]: Without dead ends: 5705 [2020-09-11 20:16:27,008 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 20:16:27,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2020-09-11 20:16:27,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 1800. [2020-09-11 20:16:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2020-09-11 20:16:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 6961 transitions. [2020-09-11 20:16:27,089 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 6961 transitions. Word has length 21 [2020-09-11 20:16:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:27,090 INFO L479 AbstractCegarLoop]: Abstraction has 1800 states and 6961 transitions. [2020-09-11 20:16:27,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 20:16:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 6961 transitions. [2020-09-11 20:16:27,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:16:27,092 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:27,092 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:27,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-09-11 20:16:27,092 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-09-11 20:16:27,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:27,092 INFO L82 PathProgramCache]: Analyzing trace with hash -334654421, now seen corresponding path program 1 times [2020-09-11 20:16:27,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:27,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677077812] [2020-09-11 20:16:27,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:16:27,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677077812] [2020-09-11 20:16:27,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:27,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:16:27,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163365961] [2020-09-11 20:16:27,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:16:27,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:27,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:16:27,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:16:27,149 INFO L87 Difference]: Start difference. First operand 1800 states and 6961 transitions. Second operand 5 states. [2020-09-11 20:16:27,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:27,263 INFO L93 Difference]: Finished difference Result 2762 states and 9976 transitions. [2020-09-11 20:16:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:16:27,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-09-11 20:16:27,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:27,269 INFO L225 Difference]: With dead ends: 2762 [2020-09-11 20:16:27,269 INFO L226 Difference]: Without dead ends: 2746 [2020-09-11 20:16:27,269 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-09-11 20:16:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2020-09-11 20:16:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 1965. [2020-09-11 20:16:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2020-09-11 20:16:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2020-09-11 20:16:27,326 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2020-09-11 20:16:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:27,327 INFO L479 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2020-09-11 20:16:27,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:16:27,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2020-09-11 20:16:27,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 20:16:27,329 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:27,329 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:27,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-09-11 20:16:27,330 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-09-11 20:16:27,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:27,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1788555247, now seen corresponding path program 1 times [2020-09-11 20:16:27,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:27,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039715112] [2020-09-11 20:16:27,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 20:16:27,345 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 20:16:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 20:16:27,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 20:16:27,364 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-11 20:16:27,365 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-11 20:16:27,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-09-11 20:16:27,365 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-11 20:16:27,366 WARN L363 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-09-11 20:16:27,366 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-09-11 20:16:27,381 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,381 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,381 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,381 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,381 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,381 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,382 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,382 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,382 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,382 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,382 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,382 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,382 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,383 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,383 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,383 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,383 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,383 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,383 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,384 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,384 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,384 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,384 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,384 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,384 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,385 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,385 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,385 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,385 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,385 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,385 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,386 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,386 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,386 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,386 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,386 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,386 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,387 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,387 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,388 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,389 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,389 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,390 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,390 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,391 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,391 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,392 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,392 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,393 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,393 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,394 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,394 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,394 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,394 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,395 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,395 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,396 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,396 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,396 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,397 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,397 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,398 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,398 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,398 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,399 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,399 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,400 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,400 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,400 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,400 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,401 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,402 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,402 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,402 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,402 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,402 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,404 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,404 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,405 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,406 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,406 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,407 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,408 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,408 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,409 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,409 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,410 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,410 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,411 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,411 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,412 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:16:27,413 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-09-11 20:16:27,413 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 20:16:27,413 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 20:16:27,413 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-11 20:16:27,413 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 20:16:27,414 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 20:16:27,414 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 20:16:27,414 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 20:16:27,414 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 20:16:27,415 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 122 transitions, 334 flow [2020-09-11 20:16:27,415 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 122 transitions, 334 flow [2020-09-11 20:16:27,430 INFO L129 PetriNetUnfolder]: 8/152 cut-off events. [2020-09-11 20:16:27,430 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-09-11 20:16:27,431 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-09-11 20:16:27,435 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 122 transitions, 334 flow [2020-09-11 20:16:27,450 INFO L129 PetriNetUnfolder]: 8/152 cut-off events. [2020-09-11 20:16:27,451 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-09-11 20:16:27,452 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-09-11 20:16:27,455 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2264 [2020-09-11 20:16:27,456 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-09-11 20:16:29,319 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-09-11 20:16:29,431 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-09-11 20:16:29,717 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2020-09-11 20:16:29,955 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2020-09-11 20:16:30,046 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2999 [2020-09-11 20:16:30,046 INFO L214 etLargeBlockEncoding]: Total number of compositions: 104 [2020-09-11 20:16:30,046 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 39 transitions, 168 flow [2020-09-11 20:16:30,401 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2020-09-11 20:16:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2020-09-11 20:16:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-09-11 20:16:30,402 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:30,402 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-09-11 20:16:30,402 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-09-11 20:16:30,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:30,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1026170, now seen corresponding path program 1 times [2020-09-11 20:16:30,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:30,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805123098] [2020-09-11 20:16:30,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:30,430 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805123098] [2020-09-11 20:16:30,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:30,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-09-11 20:16:30,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945109629] [2020-09-11 20:16:30,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 20:16:30,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:30,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 20:16:30,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 20:16:30,431 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2020-09-11 20:16:30,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:30,506 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2020-09-11 20:16:30,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 20:16:30,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-09-11 20:16:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:30,521 INFO L225 Difference]: With dead ends: 5844 [2020-09-11 20:16:30,521 INFO L226 Difference]: Without dead ends: 5479 [2020-09-11 20:16:30,521 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-09-11 20:16:30,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-09-11 20:16:30,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-09-11 20:16:30,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-09-11 20:16:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 24493 transitions. [2020-09-11 20:16:30,671 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 24493 transitions. Word has length 3 [2020-09-11 20:16:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:30,671 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 24493 transitions. [2020-09-11 20:16:30,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 20:16:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 24493 transitions. [2020-09-11 20:16:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-11 20:16:30,672 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:30,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:30,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-09-11 20:16:30,672 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-09-11 20:16:30,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:30,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1344335463, now seen corresponding path program 1 times [2020-09-11 20:16:30,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:30,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311418696] [2020-09-11 20:16:30,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:30,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311418696] [2020-09-11 20:16:30,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:30,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:16:30,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247691840] [2020-09-11 20:16:30,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:16:30,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:30,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:16:30,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:16:30,725 INFO L87 Difference]: Start difference. First operand 5479 states and 24493 transitions. Second operand 5 states. [2020-09-11 20:16:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:30,887 INFO L93 Difference]: Finished difference Result 9673 states and 40333 transitions. [2020-09-11 20:16:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:16:30,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-09-11 20:16:30,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:30,910 INFO L225 Difference]: With dead ends: 9673 [2020-09-11 20:16:30,911 INFO L226 Difference]: Without dead ends: 9666 [2020-09-11 20:16:30,911 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-09-11 20:16:31,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2020-09-11 20:16:31,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 6331. [2020-09-11 20:16:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6331 states. [2020-09-11 20:16:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 28544 transitions. [2020-09-11 20:16:31,710 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 28544 transitions. Word has length 9 [2020-09-11 20:16:31,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:31,710 INFO L479 AbstractCegarLoop]: Abstraction has 6331 states and 28544 transitions. [2020-09-11 20:16:31,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:16:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 28544 transitions. [2020-09-11 20:16:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-11 20:16:31,711 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:31,711 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:31,711 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-09-11 20:16:31,711 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-09-11 20:16:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:31,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1513378118, now seen corresponding path program 1 times [2020-09-11 20:16:31,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:31,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867130747] [2020-09-11 20:16:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:31,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867130747] [2020-09-11 20:16:31,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:31,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:16:31,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509349917] [2020-09-11 20:16:31,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:16:31,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:31,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:16:31,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:16:31,759 INFO L87 Difference]: Start difference. First operand 6331 states and 28544 transitions. Second operand 5 states. [2020-09-11 20:16:31,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:31,960 INFO L93 Difference]: Finished difference Result 11081 states and 46826 transitions. [2020-09-11 20:16:31,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:16:31,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-11 20:16:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:32,011 INFO L225 Difference]: With dead ends: 11081 [2020-09-11 20:16:32,012 INFO L226 Difference]: Without dead ends: 11068 [2020-09-11 20:16:32,013 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-09-11 20:16:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11068 states. [2020-09-11 20:16:32,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11068 to 7391. [2020-09-11 20:16:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7391 states. [2020-09-11 20:16:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 33694 transitions. [2020-09-11 20:16:32,472 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 33694 transitions. Word has length 13 [2020-09-11 20:16:32,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:32,473 INFO L479 AbstractCegarLoop]: Abstraction has 7391 states and 33694 transitions. [2020-09-11 20:16:32,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:16:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 33694 transitions. [2020-09-11 20:16:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 20:16:32,474 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:32,474 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:32,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-09-11 20:16:32,475 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-09-11 20:16:32,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:32,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1678648171, now seen corresponding path program 1 times [2020-09-11 20:16:32,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:32,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617427672] [2020-09-11 20:16:32,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:32,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617427672] [2020-09-11 20:16:32,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632436355] [2020-09-11 20:16:32,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:32,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:16:32,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:32,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:32,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:16:32,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76790934] [2020-09-11 20:16:32,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:16:32,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:32,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:16:32,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:16:32,793 INFO L87 Difference]: Start difference. First operand 7391 states and 33694 transitions. Second operand 12 states. [2020-09-11 20:16:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:33,198 INFO L93 Difference]: Finished difference Result 16749 states and 66010 transitions. [2020-09-11 20:16:33,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:33,199 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-09-11 20:16:33,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:33,247 INFO L225 Difference]: With dead ends: 16749 [2020-09-11 20:16:33,247 INFO L226 Difference]: Without dead ends: 16736 [2020-09-11 20:16:33,247 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-09-11 20:16:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16736 states. [2020-09-11 20:16:33,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16736 to 7303. [2020-09-11 20:16:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2020-09-11 20:16:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 33260 transitions. [2020-09-11 20:16:33,703 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 33260 transitions. Word has length 15 [2020-09-11 20:16:33,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:33,703 INFO L479 AbstractCegarLoop]: Abstraction has 7303 states and 33260 transitions. [2020-09-11 20:16:33,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:16:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 33260 transitions. [2020-09-11 20:16:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 20:16:33,704 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:33,704 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:33,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:16:33,910 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-09-11 20:16:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1637555113, now seen corresponding path program 2 times [2020-09-11 20:16:33,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:33,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69610083] [2020-09-11 20:16:33,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:33,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69610083] [2020-09-11 20:16:33,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:33,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:16:33,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347364103] [2020-09-11 20:16:33,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:16:33,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:16:33,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:16:33,982 INFO L87 Difference]: Start difference. First operand 7303 states and 33260 transitions. Second operand 7 states. [2020-09-11 20:16:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:34,410 INFO L93 Difference]: Finished difference Result 17085 states and 67393 transitions. [2020-09-11 20:16:34,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:34,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-09-11 20:16:34,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:34,455 INFO L225 Difference]: With dead ends: 17085 [2020-09-11 20:16:34,455 INFO L226 Difference]: Without dead ends: 17071 [2020-09-11 20:16:34,456 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-09-11 20:16:34,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2020-09-11 20:16:34,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 7048. [2020-09-11 20:16:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2020-09-11 20:16:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 32136 transitions. [2020-09-11 20:16:34,759 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 32136 transitions. Word has length 15 [2020-09-11 20:16:34,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:34,759 INFO L479 AbstractCegarLoop]: Abstraction has 7048 states and 32136 transitions. [2020-09-11 20:16:34,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:16:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 32136 transitions. [2020-09-11 20:16:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-11 20:16:34,760 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:34,760 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:34,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-09-11 20:16:34,760 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-09-11 20:16:34,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:34,760 INFO L82 PathProgramCache]: Analyzing trace with hash -288445665, now seen corresponding path program 1 times [2020-09-11 20:16:34,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:34,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507952694] [2020-09-11 20:16:34,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:16:34,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507952694] [2020-09-11 20:16:34,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:34,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:16:34,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494326235] [2020-09-11 20:16:34,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:16:34,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:34,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:16:34,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:16:34,819 INFO L87 Difference]: Start difference. First operand 7048 states and 32136 transitions. Second operand 5 states. [2020-09-11 20:16:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:34,994 INFO L93 Difference]: Finished difference Result 12234 states and 52488 transitions. [2020-09-11 20:16:34,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:16:34,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-11 20:16:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:35,240 INFO L225 Difference]: With dead ends: 12234 [2020-09-11 20:16:35,240 INFO L226 Difference]: Without dead ends: 12212 [2020-09-11 20:16:35,241 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-09-11 20:16:35,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2020-09-11 20:16:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 8342. [2020-09-11 20:16:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8342 states. [2020-09-11 20:16:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 38278 transitions. [2020-09-11 20:16:35,496 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 38278 transitions. Word has length 17 [2020-09-11 20:16:35,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:35,496 INFO L479 AbstractCegarLoop]: Abstraction has 8342 states and 38278 transitions. [2020-09-11 20:16:35,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:16:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 38278 transitions. [2020-09-11 20:16:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 20:16:35,497 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:35,497 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:35,497 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-09-11 20:16:35,497 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-09-11 20:16:35,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1255672082, now seen corresponding path program 1 times [2020-09-11 20:16:35,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:35,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132548865] [2020-09-11 20:16:35,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 20:16:35,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132548865] [2020-09-11 20:16:35,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769252492] [2020-09-11 20:16:35,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:35,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:16:35,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 20:16:35,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:35,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:16:35,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828811206] [2020-09-11 20:16:35,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:16:35,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:35,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:16:35,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:16:35,768 INFO L87 Difference]: Start difference. First operand 8342 states and 38278 transitions. Second operand 12 states. [2020-09-11 20:16:36,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:36,249 INFO L93 Difference]: Finished difference Result 19016 states and 76191 transitions. [2020-09-11 20:16:36,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:36,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-09-11 20:16:36,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:36,318 INFO L225 Difference]: With dead ends: 19016 [2020-09-11 20:16:36,318 INFO L226 Difference]: Without dead ends: 18998 [2020-09-11 20:16:36,319 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 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-09-11 20:16:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2020-09-11 20:16:36,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 8452. [2020-09-11 20:16:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8452 states. [2020-09-11 20:16:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8452 states to 8452 states and 38704 transitions. [2020-09-11 20:16:36,666 INFO L78 Accepts]: Start accepts. Automaton has 8452 states and 38704 transitions. Word has length 19 [2020-09-11 20:16:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:36,666 INFO L479 AbstractCegarLoop]: Abstraction has 8452 states and 38704 transitions. [2020-09-11 20:16:36,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:16:36,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8452 states and 38704 transitions. [2020-09-11 20:16:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 20:16:36,668 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:36,668 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:36,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-09-11 20:16:36,869 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-09-11 20:16:36,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:36,870 INFO L82 PathProgramCache]: Analyzing trace with hash 402059005, now seen corresponding path program 1 times [2020-09-11 20:16:36,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:36,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910286081] [2020-09-11 20:16:36,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:36,941 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910286081] [2020-09-11 20:16:36,941 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428855431] [2020-09-11 20:16:36,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:37,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:16:37,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:37,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:37,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:16:37,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98492347] [2020-09-11 20:16:37,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:16:37,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:37,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:16:37,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:16:37,103 INFO L87 Difference]: Start difference. First operand 8452 states and 38704 transitions. Second operand 12 states. [2020-09-11 20:16:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:38,161 INFO L93 Difference]: Finished difference Result 19670 states and 79028 transitions. [2020-09-11 20:16:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:38,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-09-11 20:16:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:38,216 INFO L225 Difference]: With dead ends: 19670 [2020-09-11 20:16:38,216 INFO L226 Difference]: Without dead ends: 19645 [2020-09-11 20:16:38,216 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 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-09-11 20:16:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19645 states. [2020-09-11 20:16:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19645 to 8480. [2020-09-11 20:16:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8480 states. [2020-09-11 20:16:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 38825 transitions. [2020-09-11 20:16:38,563 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 38825 transitions. Word has length 19 [2020-09-11 20:16:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:38,563 INFO L479 AbstractCegarLoop]: Abstraction has 8480 states and 38825 transitions. [2020-09-11 20:16:38,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:16:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 38825 transitions. [2020-09-11 20:16:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 20:16:38,564 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:38,564 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:38,765 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-09-11 20:16:38,765 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-09-11 20:16:38,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:38,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1976597437, now seen corresponding path program 2 times [2020-09-11 20:16:38,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:38,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32168955] [2020-09-11 20:16:38,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:16:38,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32168955] [2020-09-11 20:16:38,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:38,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:16:38,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566217527] [2020-09-11 20:16:38,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:16:38,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:38,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:16:38,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:16:38,847 INFO L87 Difference]: Start difference. First operand 8480 states and 38825 transitions. Second operand 7 states. [2020-09-11 20:16:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:39,301 INFO L93 Difference]: Finished difference Result 19852 states and 79846 transitions. [2020-09-11 20:16:39,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:39,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-11 20:16:39,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:39,353 INFO L225 Difference]: With dead ends: 19852 [2020-09-11 20:16:39,353 INFO L226 Difference]: Without dead ends: 19827 [2020-09-11 20:16:39,353 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-09-11 20:16:39,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19827 states. [2020-09-11 20:16:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19827 to 8379. [2020-09-11 20:16:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8379 states. [2020-09-11 20:16:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8379 states to 8379 states and 38406 transitions. [2020-09-11 20:16:39,711 INFO L78 Accepts]: Start accepts. Automaton has 8379 states and 38406 transitions. Word has length 19 [2020-09-11 20:16:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:39,711 INFO L479 AbstractCegarLoop]: Abstraction has 8379 states and 38406 transitions. [2020-09-11 20:16:39,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:16:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 8379 states and 38406 transitions. [2020-09-11 20:16:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 20:16:39,713 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:39,713 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:39,713 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-09-11 20:16:39,713 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-09-11 20:16:39,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:39,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1976577008, now seen corresponding path program 2 times [2020-09-11 20:16:39,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:39,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7802288] [2020-09-11 20:16:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:16:39,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7802288] [2020-09-11 20:16:39,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:39,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:16:39,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581893851] [2020-09-11 20:16:39,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:16:39,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:39,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:16:39,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:16:39,798 INFO L87 Difference]: Start difference. First operand 8379 states and 38406 transitions. Second operand 7 states. [2020-09-11 20:16:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:40,399 INFO L93 Difference]: Finished difference Result 19555 states and 78564 transitions. [2020-09-11 20:16:40,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:40,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-11 20:16:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:40,449 INFO L225 Difference]: With dead ends: 19555 [2020-09-11 20:16:40,449 INFO L226 Difference]: Without dead ends: 19530 [2020-09-11 20:16:40,449 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-09-11 20:16:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2020-09-11 20:16:40,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 8317. [2020-09-11 20:16:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8317 states. [2020-09-11 20:16:40,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 38184 transitions. [2020-09-11 20:16:40,802 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 38184 transitions. Word has length 19 [2020-09-11 20:16:40,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:40,802 INFO L479 AbstractCegarLoop]: Abstraction has 8317 states and 38184 transitions. [2020-09-11 20:16:40,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:16:40,802 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 38184 transitions. [2020-09-11 20:16:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:16:40,804 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:40,804 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:40,805 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-09-11 20:16:40,805 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-09-11 20:16:40,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:40,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1389591796, now seen corresponding path program 1 times [2020-09-11 20:16:40,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:40,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360046769] [2020-09-11 20:16:40,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:40,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360046769] [2020-09-11 20:16:40,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339161864] [2020-09-11 20:16:40,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:40,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:16:40,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:16:41,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:41,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:16:41,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662329794] [2020-09-11 20:16:41,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:16:41,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:41,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:16:41,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:16:41,135 INFO L87 Difference]: Start difference. First operand 8317 states and 38184 transitions. Second operand 16 states. [2020-09-11 20:16:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:42,327 INFO L93 Difference]: Finished difference Result 26969 states and 101544 transitions. [2020-09-11 20:16:42,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:16:42,328 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-09-11 20:16:42,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:42,389 INFO L225 Difference]: With dead ends: 26969 [2020-09-11 20:16:42,390 INFO L226 Difference]: Without dead ends: 26957 [2020-09-11 20:16:42,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:16:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2020-09-11 20:16:42,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 8204. [2020-09-11 20:16:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2020-09-11 20:16:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 37628 transitions. [2020-09-11 20:16:42,960 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 37628 transitions. Word has length 21 [2020-09-11 20:16:42,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:42,960 INFO L479 AbstractCegarLoop]: Abstraction has 8204 states and 37628 transitions. [2020-09-11 20:16:42,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:16:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 37628 transitions. [2020-09-11 20:16:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:16:42,961 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:42,961 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:43,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:16:43,162 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-09-11 20:16:43,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:43,163 INFO L82 PathProgramCache]: Analyzing trace with hash 184946636, now seen corresponding path program 2 times [2020-09-11 20:16:43,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:43,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073666524] [2020-09-11 20:16:43,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 20:16:43,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073666524] [2020-09-11 20:16:43,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091224529] [2020-09-11 20:16:43,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:43,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 20:16:43,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:16:43,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:16:43,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 20:16:43,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:43,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:16:43,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358906915] [2020-09-11 20:16:43,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:16:43,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:43,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:16:43,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:16:43,505 INFO L87 Difference]: Start difference. First operand 8204 states and 37628 transitions. Second operand 16 states. [2020-09-11 20:16:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:44,608 INFO L93 Difference]: Finished difference Result 26661 states and 100277 transitions. [2020-09-11 20:16:44,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:16:44,608 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-09-11 20:16:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:44,669 INFO L225 Difference]: With dead ends: 26661 [2020-09-11 20:16:44,669 INFO L226 Difference]: Without dead ends: 26645 [2020-09-11 20:16:44,670 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:16:44,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26645 states. [2020-09-11 20:16:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26645 to 8091. [2020-09-11 20:16:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8091 states. [2020-09-11 20:16:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 37076 transitions. [2020-09-11 20:16:45,070 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 37076 transitions. Word has length 21 [2020-09-11 20:16:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:45,070 INFO L479 AbstractCegarLoop]: Abstraction has 8091 states and 37076 transitions. [2020-09-11 20:16:45,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:16:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 37076 transitions. [2020-09-11 20:16:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:16:45,072 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:45,072 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:45,287 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2020-09-11 20:16:45,288 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-09-11 20:16:45,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:45,288 INFO L82 PathProgramCache]: Analyzing trace with hash -231570740, now seen corresponding path program 3 times [2020-09-11 20:16:45,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:45,289 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467143435] [2020-09-11 20:16:45,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:45,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467143435] [2020-09-11 20:16:45,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059032303] [2020-09-11 20:16:45,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:45,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-09-11 20:16:45,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:16:45,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:16:45,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:45,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:45,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:16:45,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640231313] [2020-09-11 20:16:45,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:16:45,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:45,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:16:45,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:16:45,604 INFO L87 Difference]: Start difference. First operand 8091 states and 37076 transitions. Second operand 16 states. [2020-09-11 20:16:46,563 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-09-11 20:16:46,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:46,836 INFO L93 Difference]: Finished difference Result 26686 states and 100402 transitions. [2020-09-11 20:16:46,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:16:46,837 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-09-11 20:16:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:46,903 INFO L225 Difference]: With dead ends: 26686 [2020-09-11 20:16:46,904 INFO L226 Difference]: Without dead ends: 26674 [2020-09-11 20:16:46,904 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-09-11 20:16:47,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26674 states. [2020-09-11 20:16:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26674 to 7861. [2020-09-11 20:16:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2020-09-11 20:16:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 36066 transitions. [2020-09-11 20:16:47,294 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 36066 transitions. Word has length 21 [2020-09-11 20:16:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:47,294 INFO L479 AbstractCegarLoop]: Abstraction has 7861 states and 36066 transitions. [2020-09-11 20:16:47,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:16:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 36066 transitions. [2020-09-11 20:16:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:16:47,295 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:47,295 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:47,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:16:47,503 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-09-11 20:16:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash -168366002, now seen corresponding path program 4 times [2020-09-11 20:16:47,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:47,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21533385] [2020-09-11 20:16:47,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:47,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21533385] [2020-09-11 20:16:47,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501815674] [2020-09-11 20:16:47,607 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:47,707 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-11 20:16:47,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:16:47,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:16:47,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:16:47,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:47,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:16:47,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828453999] [2020-09-11 20:16:47,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:16:47,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:47,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:16:47,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:16:47,842 INFO L87 Difference]: Start difference. First operand 7861 states and 36066 transitions. Second operand 16 states. [2020-09-11 20:16:49,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:49,090 INFO L93 Difference]: Finished difference Result 26489 states and 99650 transitions. [2020-09-11 20:16:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:16:49,091 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-09-11 20:16:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:49,160 INFO L225 Difference]: With dead ends: 26489 [2020-09-11 20:16:49,160 INFO L226 Difference]: Without dead ends: 26473 [2020-09-11 20:16:49,161 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:16:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26473 states. [2020-09-11 20:16:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26473 to 7748. [2020-09-11 20:16:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7748 states. [2020-09-11 20:16:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7748 states to 7748 states and 35514 transitions. [2020-09-11 20:16:49,558 INFO L78 Accepts]: Start accepts. Automaton has 7748 states and 35514 transitions. Word has length 21 [2020-09-11 20:16:49,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:49,558 INFO L479 AbstractCegarLoop]: Abstraction has 7748 states and 35514 transitions. [2020-09-11 20:16:49,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:16:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 7748 states and 35514 transitions. [2020-09-11 20:16:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:16:49,560 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:49,560 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:49,766 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-09-11 20:16:49,767 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-09-11 20:16:49,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:49,768 INFO L82 PathProgramCache]: Analyzing trace with hash 210203517, now seen corresponding path program 1 times [2020-09-11 20:16:49,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:49,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225050399] [2020-09-11 20:16:49,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:16:49,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225050399] [2020-09-11 20:16:49,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:49,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:16:49,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048113065] [2020-09-11 20:16:49,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:16:49,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:49,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:16:49,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:16:49,837 INFO L87 Difference]: Start difference. First operand 7748 states and 35514 transitions. Second operand 5 states. [2020-09-11 20:16:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:50,170 INFO L93 Difference]: Finished difference Result 13251 states and 57501 transitions. [2020-09-11 20:16:50,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:16:50,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-09-11 20:16:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:50,221 INFO L225 Difference]: With dead ends: 13251 [2020-09-11 20:16:50,222 INFO L226 Difference]: Without dead ends: 13220 [2020-09-11 20:16:50,222 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-09-11 20:16:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13220 states. [2020-09-11 20:16:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13220 to 9255. [2020-09-11 20:16:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9255 states. [2020-09-11 20:16:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9255 states to 9255 states and 42368 transitions. [2020-09-11 20:16:50,541 INFO L78 Accepts]: Start accepts. Automaton has 9255 states and 42368 transitions. Word has length 21 [2020-09-11 20:16:50,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:50,541 INFO L479 AbstractCegarLoop]: Abstraction has 9255 states and 42368 transitions. [2020-09-11 20:16:50,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:16:50,542 INFO L276 IsEmpty]: Start isEmpty. Operand 9255 states and 42368 transitions. [2020-09-11 20:16:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:16:50,543 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:50,543 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:50,544 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-09-11 20:16:50,544 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-09-11 20:16:50,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:50,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1134578958, now seen corresponding path program 5 times [2020-09-11 20:16:50,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:50,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936530082] [2020-09-11 20:16:50,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:16:50,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936530082] [2020-09-11 20:16:50,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:50,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 20:16:50,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352597902] [2020-09-11 20:16:50,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 20:16:50,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:50,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 20:16:50,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:16:50,645 INFO L87 Difference]: Start difference. First operand 9255 states and 42368 transitions. Second operand 9 states. [2020-09-11 20:16:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:51,664 INFO L93 Difference]: Finished difference Result 29788 states and 113841 transitions. [2020-09-11 20:16:51,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:16:51,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 20:16:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:51,737 INFO L225 Difference]: With dead ends: 29788 [2020-09-11 20:16:51,737 INFO L226 Difference]: Without dead ends: 29770 [2020-09-11 20:16:51,737 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 20:16:51,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2020-09-11 20:16:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 8964. [2020-09-11 20:16:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2020-09-11 20:16:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 41031 transitions. [2020-09-11 20:16:52,195 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 41031 transitions. Word has length 21 [2020-09-11 20:16:52,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:52,195 INFO L479 AbstractCegarLoop]: Abstraction has 8964 states and 41031 transitions. [2020-09-11 20:16:52,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 20:16:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 41031 transitions. [2020-09-11 20:16:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:16:52,197 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:52,197 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:52,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-09-11 20:16:52,197 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-09-11 20:16:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1114967118, now seen corresponding path program 6 times [2020-09-11 20:16:52,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:52,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581934793] [2020-09-11 20:16:52,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:16:52,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581934793] [2020-09-11 20:16:52,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:52,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 20:16:52,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167648718] [2020-09-11 20:16:52,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 20:16:52,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:52,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 20:16:52,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:16:52,301 INFO L87 Difference]: Start difference. First operand 8964 states and 41031 transitions. Second operand 9 states. [2020-09-11 20:16:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:53,390 INFO L93 Difference]: Finished difference Result 29379 states and 112099 transitions. [2020-09-11 20:16:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:16:53,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 20:16:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:53,678 INFO L225 Difference]: With dead ends: 29379 [2020-09-11 20:16:53,678 INFO L226 Difference]: Without dead ends: 29356 [2020-09-11 20:16:53,679 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 20:16:53,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29356 states. [2020-09-11 20:16:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29356 to 8573. [2020-09-11 20:16:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8573 states. [2020-09-11 20:16:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8573 states to 8573 states and 39353 transitions. [2020-09-11 20:16:54,116 INFO L78 Accepts]: Start accepts. Automaton has 8573 states and 39353 transitions. Word has length 21 [2020-09-11 20:16:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:54,116 INFO L479 AbstractCegarLoop]: Abstraction has 8573 states and 39353 transitions. [2020-09-11 20:16:54,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 20:16:54,117 INFO L276 IsEmpty]: Start isEmpty. Operand 8573 states and 39353 transitions. [2020-09-11 20:16:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 20:16:54,119 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:54,119 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:54,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-09-11 20:16:54,119 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-09-11 20:16:54,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:54,120 INFO L82 PathProgramCache]: Analyzing trace with hash 715669452, now seen corresponding path program 1 times [2020-09-11 20:16:54,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:54,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029680405] [2020-09-11 20:16:54,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:16:54,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029680405] [2020-09-11 20:16:54,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817144131] [2020-09-11 20:16:54,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:54,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:16:54,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:16:54,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:54,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:16:54,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375076009] [2020-09-11 20:16:54,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:16:54,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:54,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:16:54,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:16:54,392 INFO L87 Difference]: Start difference. First operand 8573 states and 39353 transitions. Second operand 12 states. [2020-09-11 20:16:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:54,899 INFO L93 Difference]: Finished difference Result 19727 states and 80274 transitions. [2020-09-11 20:16:54,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:54,900 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-09-11 20:16:54,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:54,944 INFO L225 Difference]: With dead ends: 19727 [2020-09-11 20:16:54,944 INFO L226 Difference]: Without dead ends: 19703 [2020-09-11 20:16:54,945 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-09-11 20:16:55,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19703 states. [2020-09-11 20:16:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19703 to 8847. [2020-09-11 20:16:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2020-09-11 20:16:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40495 transitions. [2020-09-11 20:16:55,269 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40495 transitions. Word has length 23 [2020-09-11 20:16:55,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:55,270 INFO L479 AbstractCegarLoop]: Abstraction has 8847 states and 40495 transitions. [2020-09-11 20:16:55,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:16:55,271 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40495 transitions. [2020-09-11 20:16:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 20:16:55,272 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:55,272 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:55,473 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-09-11 20:16:55,473 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-09-11 20:16:55,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:55,474 INFO L82 PathProgramCache]: Analyzing trace with hash 504272987, now seen corresponding path program 1 times [2020-09-11 20:16:55,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:55,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071622841] [2020-09-11 20:16:55,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 20:16:55,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071622841] [2020-09-11 20:16:55,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614734524] [2020-09-11 20:16:55,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:55,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:16:55,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 20:16:55,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:55,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:16:55,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026569158] [2020-09-11 20:16:55,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:16:55,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:55,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:16:55,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:16:55,739 INFO L87 Difference]: Start difference. First operand 8847 states and 40495 transitions. Second operand 12 states. [2020-09-11 20:16:56,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:56,162 INFO L93 Difference]: Finished difference Result 20694 states and 84261 transitions. [2020-09-11 20:16:56,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:56,163 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-09-11 20:16:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:56,217 INFO L225 Difference]: With dead ends: 20694 [2020-09-11 20:16:56,217 INFO L226 Difference]: Without dead ends: 20666 [2020-09-11 20:16:56,218 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-09-11 20:16:56,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20666 states. [2020-09-11 20:16:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20666 to 9115. [2020-09-11 20:16:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9115 states. [2020-09-11 20:16:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 41679 transitions. [2020-09-11 20:16:56,605 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 41679 transitions. Word has length 23 [2020-09-11 20:16:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:56,606 INFO L479 AbstractCegarLoop]: Abstraction has 9115 states and 41679 transitions. [2020-09-11 20:16:56,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:16:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 41679 transitions. [2020-09-11 20:16:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 20:16:56,609 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:56,609 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:56,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:16:56,823 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-09-11 20:16:56,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:56,823 INFO L82 PathProgramCache]: Analyzing trace with hash 591685125, now seen corresponding path program 1 times [2020-09-11 20:16:56,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:56,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093181005] [2020-09-11 20:16:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:57,055 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-09-11 20:16:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:16:57,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093181005] [2020-09-11 20:16:57,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102078151] [2020-09-11 20:16:57,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:16:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:57,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:16:57,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:16:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:16:57,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:16:57,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:16:57,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049272191] [2020-09-11 20:16:57,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:16:57,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:57,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:16:57,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:16:57,260 INFO L87 Difference]: Start difference. First operand 9115 states and 41679 transitions. Second operand 12 states. [2020-09-11 20:16:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:57,786 INFO L93 Difference]: Finished difference Result 21396 states and 87360 transitions. [2020-09-11 20:16:57,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:57,787 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-09-11 20:16:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:57,839 INFO L225 Difference]: With dead ends: 21396 [2020-09-11 20:16:57,840 INFO L226 Difference]: Without dead ends: 21359 [2020-09-11 20:16:57,840 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-09-11 20:16:57,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21359 states. [2020-09-11 20:16:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21359 to 9320. [2020-09-11 20:16:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9320 states. [2020-09-11 20:16:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9320 states to 9320 states and 42648 transitions. [2020-09-11 20:16:58,203 INFO L78 Accepts]: Start accepts. Automaton has 9320 states and 42648 transitions. Word has length 23 [2020-09-11 20:16:58,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:58,203 INFO L479 AbstractCegarLoop]: Abstraction has 9320 states and 42648 transitions. [2020-09-11 20:16:58,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:16:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 9320 states and 42648 transitions. [2020-09-11 20:16:58,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 20:16:58,205 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:58,205 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:58,406 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2020-09-11 20:16:58,406 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-09-11 20:16:58,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:58,407 INFO L82 PathProgramCache]: Analyzing trace with hash 142124187, now seen corresponding path program 2 times [2020-09-11 20:16:58,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:58,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471392451] [2020-09-11 20:16:58,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:16:58,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471392451] [2020-09-11 20:16:58,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:58,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:16:58,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500139813] [2020-09-11 20:16:58,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:16:58,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:58,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:16:58,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:16:58,489 INFO L87 Difference]: Start difference. First operand 9320 states and 42648 transitions. Second operand 7 states. [2020-09-11 20:16:58,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:58,950 INFO L93 Difference]: Finished difference Result 21489 states and 87752 transitions. [2020-09-11 20:16:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:58,951 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-11 20:16:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:16:59,009 INFO L225 Difference]: With dead ends: 21489 [2020-09-11 20:16:59,009 INFO L226 Difference]: Without dead ends: 21452 [2020-09-11 20:16:59,009 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-09-11 20:16:59,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2020-09-11 20:16:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 9401. [2020-09-11 20:16:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9401 states. [2020-09-11 20:16:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9401 states to 9401 states and 43010 transitions. [2020-09-11 20:16:59,397 INFO L78 Accepts]: Start accepts. Automaton has 9401 states and 43010 transitions. Word has length 23 [2020-09-11 20:16:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:16:59,397 INFO L479 AbstractCegarLoop]: Abstraction has 9401 states and 43010 transitions. [2020-09-11 20:16:59,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:16:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 9401 states and 43010 transitions. [2020-09-11 20:16:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 20:16:59,399 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:16:59,400 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:16:59,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-09-11 20:16:59,400 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-09-11 20:16:59,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:16:59,400 INFO L82 PathProgramCache]: Analyzing trace with hash 142117429, now seen corresponding path program 2 times [2020-09-11 20:16:59,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:16:59,400 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108739562] [2020-09-11 20:16:59,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:16:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:16:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:16:59,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108739562] [2020-09-11 20:16:59,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:16:59,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:16:59,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787039824] [2020-09-11 20:16:59,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:16:59,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:16:59,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:16:59,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:16:59,496 INFO L87 Difference]: Start difference. First operand 9401 states and 43010 transitions. Second operand 7 states. [2020-09-11 20:16:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:16:59,975 INFO L93 Difference]: Finished difference Result 21198 states and 86437 transitions. [2020-09-11 20:16:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:16:59,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-11 20:16:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:00,031 INFO L225 Difference]: With dead ends: 21198 [2020-09-11 20:17:00,031 INFO L226 Difference]: Without dead ends: 21161 [2020-09-11 20:17:00,032 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-09-11 20:17:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21161 states. [2020-09-11 20:17:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21161 to 9396. [2020-09-11 20:17:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9396 states. [2020-09-11 20:17:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9396 states to 9396 states and 42985 transitions. [2020-09-11 20:17:00,621 INFO L78 Accepts]: Start accepts. Automaton has 9396 states and 42985 transitions. Word has length 23 [2020-09-11 20:17:00,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:00,621 INFO L479 AbstractCegarLoop]: Abstraction has 9396 states and 42985 transitions. [2020-09-11 20:17:00,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:17:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand 9396 states and 42985 transitions. [2020-09-11 20:17:00,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 20:17:00,623 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:00,623 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:00,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-09-11 20:17:00,624 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-09-11 20:17:00,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:00,624 INFO L82 PathProgramCache]: Analyzing trace with hash 142103758, now seen corresponding path program 2 times [2020-09-11 20:17:00,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:00,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193021298] [2020-09-11 20:17:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:00,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:17:00,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193021298] [2020-09-11 20:17:00,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:17:00,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:17:00,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846046402] [2020-09-11 20:17:00,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:17:00,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:00,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:17:00,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:17:00,706 INFO L87 Difference]: Start difference. First operand 9396 states and 42985 transitions. Second operand 7 states. [2020-09-11 20:17:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:01,155 INFO L93 Difference]: Finished difference Result 21067 states and 85734 transitions. [2020-09-11 20:17:01,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:17:01,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-11 20:17:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:01,205 INFO L225 Difference]: With dead ends: 21067 [2020-09-11 20:17:01,205 INFO L226 Difference]: Without dead ends: 21030 [2020-09-11 20:17:01,205 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-09-11 20:17:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21030 states. [2020-09-11 20:17:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21030 to 9426. [2020-09-11 20:17:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9426 states. [2020-09-11 20:17:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 43057 transitions. [2020-09-11 20:17:01,553 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 43057 transitions. Word has length 23 [2020-09-11 20:17:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:01,554 INFO L479 AbstractCegarLoop]: Abstraction has 9426 states and 43057 transitions. [2020-09-11 20:17:01,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:17:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 43057 transitions. [2020-09-11 20:17:01,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:01,557 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:01,557 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:01,557 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-09-11 20:17:01,557 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-09-11 20:17:01,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:01,557 INFO L82 PathProgramCache]: Analyzing trace with hash 925732074, now seen corresponding path program 1 times [2020-09-11 20:17:01,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:01,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838345716] [2020-09-11 20:17:01,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:17:01,662 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838345716] [2020-09-11 20:17:01,662 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752152318] [2020-09-11 20:17:01,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:17:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:01,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:17:01,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:17:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:17:01,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:17:01,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:17:01,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111796562] [2020-09-11 20:17:01,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:17:01,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:01,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:17:01,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:17:01,873 INFO L87 Difference]: Start difference. First operand 9426 states and 43057 transitions. Second operand 16 states. [2020-09-11 20:17:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:03,234 INFO L93 Difference]: Finished difference Result 30145 states and 115754 transitions. [2020-09-11 20:17:03,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:03,235 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:17:03,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:03,303 INFO L225 Difference]: With dead ends: 30145 [2020-09-11 20:17:03,304 INFO L226 Difference]: Without dead ends: 30125 [2020-09-11 20:17:03,304 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:17:03,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30125 states. [2020-09-11 20:17:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30125 to 9338. [2020-09-11 20:17:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9338 states. [2020-09-11 20:17:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9338 states to 9338 states and 42582 transitions. [2020-09-11 20:17:03,751 INFO L78 Accepts]: Start accepts. Automaton has 9338 states and 42582 transitions. Word has length 25 [2020-09-11 20:17:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:03,751 INFO L479 AbstractCegarLoop]: Abstraction has 9338 states and 42582 transitions. [2020-09-11 20:17:03,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:17:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 9338 states and 42582 transitions. [2020-09-11 20:17:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:03,754 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:03,755 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:03,955 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-09-11 20:17:03,956 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-09-11 20:17:03,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:03,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1013144212, now seen corresponding path program 1 times [2020-09-11 20:17:03,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:03,957 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125314866] [2020-09-11 20:17:03,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:17:04,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125314866] [2020-09-11 20:17:04,061 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963272611] [2020-09-11 20:17:04,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:17:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:04,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:17:04,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:17:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:17:04,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:17:04,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:17:04,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946747327] [2020-09-11 20:17:04,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:17:04,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:04,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:17:04,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:17:04,295 INFO L87 Difference]: Start difference. First operand 9338 states and 42582 transitions. Second operand 16 states. [2020-09-11 20:17:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:05,486 INFO L93 Difference]: Finished difference Result 29696 states and 113916 transitions. [2020-09-11 20:17:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:05,487 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:17:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:05,708 INFO L225 Difference]: With dead ends: 29696 [2020-09-11 20:17:05,708 INFO L226 Difference]: Without dead ends: 29676 [2020-09-11 20:17:05,709 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:17:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29676 states. [2020-09-11 20:17:06,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29676 to 9291. [2020-09-11 20:17:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9291 states. [2020-09-11 20:17:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 42295 transitions. [2020-09-11 20:17:06,131 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 42295 transitions. Word has length 25 [2020-09-11 20:17:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:06,131 INFO L479 AbstractCegarLoop]: Abstraction has 9291 states and 42295 transitions. [2020-09-11 20:17:06,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:17:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 42295 transitions. [2020-09-11 20:17:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:06,134 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:06,134 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:06,335 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2020-09-11 20:17:06,335 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-09-11 20:17:06,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:06,336 INFO L82 PathProgramCache]: Analyzing trace with hash 563583274, now seen corresponding path program 2 times [2020-09-11 20:17:06,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:06,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981989035] [2020-09-11 20:17:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:17:06,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981989035] [2020-09-11 20:17:06,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750835144] [2020-09-11 20:17:06,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:17:06,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 20:17:06,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:17:06,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:17:06,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:17:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:17:06,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:17:06,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:17:06,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886856771] [2020-09-11 20:17:06,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:17:06,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:06,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:17:06,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:17:06,686 INFO L87 Difference]: Start difference. First operand 9291 states and 42295 transitions. Second operand 16 states. [2020-09-11 20:17:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:07,880 INFO L93 Difference]: Finished difference Result 29267 states and 112142 transitions. [2020-09-11 20:17:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:07,881 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:17:07,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:07,952 INFO L225 Difference]: With dead ends: 29267 [2020-09-11 20:17:07,952 INFO L226 Difference]: Without dead ends: 29245 [2020-09-11 20:17:07,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:17:08,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2020-09-11 20:17:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 9288. [2020-09-11 20:17:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9288 states. [2020-09-11 20:17:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 42242 transitions. [2020-09-11 20:17:08,427 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 42242 transitions. Word has length 25 [2020-09-11 20:17:08,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:08,427 INFO L479 AbstractCegarLoop]: Abstraction has 9288 states and 42242 transitions. [2020-09-11 20:17:08,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:17:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 42242 transitions. [2020-09-11 20:17:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:08,430 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:08,430 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:08,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2020-09-11 20:17:08,631 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-09-11 20:17:08,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:08,632 INFO L82 PathProgramCache]: Analyzing trace with hash 563576516, now seen corresponding path program 2 times [2020-09-11 20:17:08,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:08,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638372647] [2020-09-11 20:17:08,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:17:08,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638372647] [2020-09-11 20:17:08,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351744367] [2020-09-11 20:17:08,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:17:08,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 20:17:08,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:17:08,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:17:08,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:17:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:17:08,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:17:08,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:17:08,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554341727] [2020-09-11 20:17:08,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:17:08,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:08,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:17:08,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:17:08,971 INFO L87 Difference]: Start difference. First operand 9288 states and 42242 transitions. Second operand 16 states. [2020-09-11 20:17:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:10,360 INFO L93 Difference]: Finished difference Result 28920 states and 110796 transitions. [2020-09-11 20:17:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:10,360 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:17:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:10,428 INFO L225 Difference]: With dead ends: 28920 [2020-09-11 20:17:10,428 INFO L226 Difference]: Without dead ends: 28898 [2020-09-11 20:17:10,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:17:10,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28898 states. [2020-09-11 20:17:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28898 to 9176. [2020-09-11 20:17:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2020-09-11 20:17:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 41695 transitions. [2020-09-11 20:17:11,055 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 41695 transitions. Word has length 25 [2020-09-11 20:17:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:11,056 INFO L479 AbstractCegarLoop]: Abstraction has 9176 states and 41695 transitions. [2020-09-11 20:17:11,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:17:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 41695 transitions. [2020-09-11 20:17:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:11,059 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:11,059 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:11,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:17:11,260 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-09-11 20:17:11,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:11,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2052215638, now seen corresponding path program 3 times [2020-09-11 20:17:11,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:11,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928066074] [2020-09-11 20:17:11,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-11 20:17:11,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928066074] [2020-09-11 20:17:11,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808611208] [2020-09-11 20:17:11,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:17:11,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-09-11 20:17:11,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:17:11,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:17:11,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:17:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-11 20:17:11,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:17:11,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:17:11,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098065695] [2020-09-11 20:17:11,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:17:11,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:11,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:17:11,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:17:11,600 INFO L87 Difference]: Start difference. First operand 9176 states and 41695 transitions. Second operand 16 states. [2020-09-11 20:17:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:12,774 INFO L93 Difference]: Finished difference Result 29038 states and 111216 transitions. [2020-09-11 20:17:12,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:12,775 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:17:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:12,860 INFO L225 Difference]: With dead ends: 29038 [2020-09-11 20:17:12,860 INFO L226 Difference]: Without dead ends: 29018 [2020-09-11 20:17:12,861 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:17:13,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29018 states. [2020-09-11 20:17:13,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29018 to 9000. [2020-09-11 20:17:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9000 states. [2020-09-11 20:17:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9000 states to 9000 states and 40897 transitions. [2020-09-11 20:17:13,348 INFO L78 Accepts]: Start accepts. Automaton has 9000 states and 40897 transitions. Word has length 25 [2020-09-11 20:17:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:13,348 INFO L479 AbstractCegarLoop]: Abstraction has 9000 states and 40897 transitions. [2020-09-11 20:17:13,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:17:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 9000 states and 40897 transitions. [2020-09-11 20:17:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:13,351 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:13,351 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:13,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-09-11 20:17:13,552 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-09-11 20:17:13,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:13,553 INFO L82 PathProgramCache]: Analyzing trace with hash -275395741, now seen corresponding path program 1 times [2020-09-11 20:17:13,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:13,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718262511] [2020-09-11 20:17:13,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 20:17:13,662 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718262511] [2020-09-11 20:17:13,662 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844683960] [2020-09-11 20:17:13,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:17:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:13,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:17:13,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:17:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 20:17:13,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:17:13,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:17:13,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486282746] [2020-09-11 20:17:13,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:17:13,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:13,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:17:13,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:17:13,895 INFO L87 Difference]: Start difference. First operand 9000 states and 40897 transitions. Second operand 16 states. [2020-09-11 20:17:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:15,233 INFO L93 Difference]: Finished difference Result 29417 states and 113034 transitions. [2020-09-11 20:17:15,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:15,234 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:17:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:15,297 INFO L225 Difference]: With dead ends: 29417 [2020-09-11 20:17:15,297 INFO L226 Difference]: Without dead ends: 29397 [2020-09-11 20:17:15,297 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-09-11 20:17:15,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29397 states. [2020-09-11 20:17:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29397 to 8990. [2020-09-11 20:17:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8990 states. [2020-09-11 20:17:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8990 states to 8990 states and 40786 transitions. [2020-09-11 20:17:15,723 INFO L78 Accepts]: Start accepts. Automaton has 8990 states and 40786 transitions. Word has length 25 [2020-09-11 20:17:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:15,724 INFO L479 AbstractCegarLoop]: Abstraction has 8990 states and 40786 transitions. [2020-09-11 20:17:15,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:17:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 8990 states and 40786 transitions. [2020-09-11 20:17:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:15,727 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:15,727 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:15,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:17:15,928 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-09-11 20:17:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:15,929 INFO L82 PathProgramCache]: Analyzing trace with hash -724963437, now seen corresponding path program 2 times [2020-09-11 20:17:15,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:15,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872488230] [2020-09-11 20:17:15,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 20:17:16,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872488230] [2020-09-11 20:17:16,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42268495] [2020-09-11 20:17:16,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:17:16,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 20:17:16,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:17:16,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:17:16,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:17:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 20:17:16,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:17:16,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:17:16,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513490293] [2020-09-11 20:17:16,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:17:16,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:16,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:17:16,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:17:16,260 INFO L87 Difference]: Start difference. First operand 8990 states and 40786 transitions. Second operand 16 states. [2020-09-11 20:17:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:17,862 INFO L93 Difference]: Finished difference Result 29064 states and 111552 transitions. [2020-09-11 20:17:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:17,863 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:17:17,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:17,981 INFO L225 Difference]: With dead ends: 29064 [2020-09-11 20:17:17,981 INFO L226 Difference]: Without dead ends: 29037 [2020-09-11 20:17:17,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:17:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29037 states. [2020-09-11 20:17:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29037 to 8953. [2020-09-11 20:17:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8953 states. [2020-09-11 20:17:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8953 states to 8953 states and 40609 transitions. [2020-09-11 20:17:18,588 INFO L78 Accepts]: Start accepts. Automaton has 8953 states and 40609 transitions. Word has length 25 [2020-09-11 20:17:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:18,588 INFO L479 AbstractCegarLoop]: Abstraction has 8953 states and 40609 transitions. [2020-09-11 20:17:18,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:17:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 8953 states and 40609 transitions. [2020-09-11 20:17:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:18,592 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:18,592 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:18,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2020-09-11 20:17:18,793 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-09-11 20:17:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:18,794 INFO L82 PathProgramCache]: Analyzing trace with hash -724977108, now seen corresponding path program 4 times [2020-09-11 20:17:18,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:18,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951513182] [2020-09-11 20:17:18,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 20:17:18,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951513182] [2020-09-11 20:17:18,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58539921] [2020-09-11 20:17:18,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:17:19,003 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-11 20:17:19,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:17:19,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:17:19,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:17:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 20:17:19,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:17:19,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:17:19,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37818361] [2020-09-11 20:17:19,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:17:19,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:19,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:17:19,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:17:19,141 INFO L87 Difference]: Start difference. First operand 8953 states and 40609 transitions. Second operand 16 states. [2020-09-11 20:17:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:20,292 INFO L93 Difference]: Finished difference Result 28523 states and 109227 transitions. [2020-09-11 20:17:20,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:20,293 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:17:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:20,356 INFO L225 Difference]: With dead ends: 28523 [2020-09-11 20:17:20,356 INFO L226 Difference]: Without dead ends: 28501 [2020-09-11 20:17:20,357 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:17:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28501 states. [2020-09-11 20:17:20,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28501 to 8841. [2020-09-11 20:17:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8841 states. [2020-09-11 20:17:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 40062 transitions. [2020-09-11 20:17:20,783 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 40062 transitions. Word has length 25 [2020-09-11 20:17:20,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:20,784 INFO L479 AbstractCegarLoop]: Abstraction has 8841 states and 40062 transitions. [2020-09-11 20:17:20,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:17:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 40062 transitions. [2020-09-11 20:17:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:20,788 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:20,788 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:20,989 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:17:20,989 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-09-11 20:17:20,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:20,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1969402905, now seen corresponding path program 3 times [2020-09-11 20:17:20,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:20,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156902881] [2020-09-11 20:17:20,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:17:21,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156902881] [2020-09-11 20:17:21,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050656405] [2020-09-11 20:17:21,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:17:21,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-09-11 20:17:21,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:17:21,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:17:21,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:17:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:17:21,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:17:21,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:17:21,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136902124] [2020-09-11 20:17:21,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:17:21,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:21,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:17:21,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:17:21,273 INFO L87 Difference]: Start difference. First operand 8841 states and 40062 transitions. Second operand 16 states. [2020-09-11 20:17:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:22,285 INFO L93 Difference]: Finished difference Result 28636 states and 109852 transitions. [2020-09-11 20:17:22,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:22,286 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:17:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:22,354 INFO L225 Difference]: With dead ends: 28636 [2020-09-11 20:17:22,354 INFO L226 Difference]: Without dead ends: 28616 [2020-09-11 20:17:22,354 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-09-11 20:17:22,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28616 states. [2020-09-11 20:17:22,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28616 to 8702. [2020-09-11 20:17:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8702 states. [2020-09-11 20:17:22,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8702 states to 8702 states and 39438 transitions. [2020-09-11 20:17:22,769 INFO L78 Accepts]: Start accepts. Automaton has 8702 states and 39438 transitions. Word has length 25 [2020-09-11 20:17:22,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:22,769 INFO L479 AbstractCegarLoop]: Abstraction has 8702 states and 39438 transitions. [2020-09-11 20:17:22,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:17:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 8702 states and 39438 transitions. [2020-09-11 20:17:22,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:22,773 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:22,773 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:22,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2020-09-11 20:17:22,981 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-09-11 20:17:22,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:22,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1576190868, now seen corresponding path program 3 times [2020-09-11 20:17:22,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:22,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980204377] [2020-09-11 20:17:22,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:17:23,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980204377] [2020-09-11 20:17:23,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139857283] [2020-09-11 20:17:23,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:17:23,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-09-11 20:17:23,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:17:23,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:17:23,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:17:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:17:23,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:17:23,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:17:23,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916350884] [2020-09-11 20:17:23,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:17:23,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:23,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:17:23,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:17:23,453 INFO L87 Difference]: Start difference. First operand 8702 states and 39438 transitions. Second operand 16 states. [2020-09-11 20:17:24,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:24,578 INFO L93 Difference]: Finished difference Result 28297 states and 108461 transitions. [2020-09-11 20:17:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:24,578 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:17:24,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:24,648 INFO L225 Difference]: With dead ends: 28297 [2020-09-11 20:17:24,648 INFO L226 Difference]: Without dead ends: 28277 [2020-09-11 20:17:24,649 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:17:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28277 states. [2020-09-11 20:17:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28277 to 8596. [2020-09-11 20:17:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8596 states. [2020-09-11 20:17:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 38978 transitions. [2020-09-11 20:17:25,071 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 38978 transitions. Word has length 25 [2020-09-11 20:17:25,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:25,071 INFO L479 AbstractCegarLoop]: Abstraction has 8596 states and 38978 transitions. [2020-09-11 20:17:25,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:17:25,071 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 38978 transitions. [2020-09-11 20:17:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:25,074 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:25,074 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:25,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:17:25,277 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-09-11 20:17:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:25,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1673729315, now seen corresponding path program 4 times [2020-09-11 20:17:25,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:25,278 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117092718] [2020-09-11 20:17:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:17:25,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117092718] [2020-09-11 20:17:25,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755847158] [2020-09-11 20:17:25,382 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:17:25,512 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-11 20:17:25,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:17:25,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:17:25,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:17:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:17:25,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:17:25,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:17:25,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491824589] [2020-09-11 20:17:25,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:17:25,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:25,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:17:25,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:17:25,669 INFO L87 Difference]: Start difference. First operand 8596 states and 38978 transitions. Second operand 16 states. [2020-09-11 20:17:27,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:27,075 INFO L93 Difference]: Finished difference Result 28565 states and 109596 transitions. [2020-09-11 20:17:27,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:27,075 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:17:27,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:27,148 INFO L225 Difference]: With dead ends: 28565 [2020-09-11 20:17:27,148 INFO L226 Difference]: Without dead ends: 28538 [2020-09-11 20:17:27,149 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:17:27,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2020-09-11 20:17:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8563. [2020-09-11 20:17:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8563 states. [2020-09-11 20:17:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 38809 transitions. [2020-09-11 20:17:27,587 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 38809 transitions. Word has length 25 [2020-09-11 20:17:27,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:27,587 INFO L479 AbstractCegarLoop]: Abstraction has 8563 states and 38809 transitions. [2020-09-11 20:17:27,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:17:27,588 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 38809 transitions. [2020-09-11 20:17:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:27,591 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:27,592 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:27,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2020-09-11 20:17:27,793 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-09-11 20:17:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:27,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1673708886, now seen corresponding path program 4 times [2020-09-11 20:17:27,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:27,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287252294] [2020-09-11 20:17:27,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:17:27,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287252294] [2020-09-11 20:17:27,893 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749481713] [2020-09-11 20:17:27,893 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:17:27,990 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-11 20:17:27,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:17:27,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:17:27,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:17:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 20:17:28,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:17:28,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:17:28,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870072226] [2020-09-11 20:17:28,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:17:28,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:28,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:17:28,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:17:28,143 INFO L87 Difference]: Start difference. First operand 8563 states and 38809 transitions. Second operand 16 states. [2020-09-11 20:17:29,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:29,445 INFO L93 Difference]: Finished difference Result 28213 states and 108237 transitions. [2020-09-11 20:17:29,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:29,446 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:17:29,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:29,508 INFO L225 Difference]: With dead ends: 28213 [2020-09-11 20:17:29,508 INFO L226 Difference]: Without dead ends: 28186 [2020-09-11 20:17:29,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:17:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28186 states. [2020-09-11 20:17:29,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28186 to 8421. [2020-09-11 20:17:29,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8421 states. [2020-09-11 20:17:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8421 states to 8421 states and 38146 transitions. [2020-09-11 20:17:29,915 INFO L78 Accepts]: Start accepts. Automaton has 8421 states and 38146 transitions. Word has length 25 [2020-09-11 20:17:29,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:29,915 INFO L479 AbstractCegarLoop]: Abstraction has 8421 states and 38146 transitions. [2020-09-11 20:17:29,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:17:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 8421 states and 38146 transitions. [2020-09-11 20:17:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:29,918 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:29,919 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:30,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:17:30,119 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-09-11 20:17:30,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:30,120 INFO L82 PathProgramCache]: Analyzing trace with hash -857609261, now seen corresponding path program 5 times [2020-09-11 20:17:30,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:30,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140321776] [2020-09-11 20:17:30,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:17:30,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140321776] [2020-09-11 20:17:30,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:17:30,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 20:17:30,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776710097] [2020-09-11 20:17:30,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 20:17:30,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:30,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 20:17:30,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:17:30,240 INFO L87 Difference]: Start difference. First operand 8421 states and 38146 transitions. Second operand 9 states. [2020-09-11 20:17:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:31,436 INFO L93 Difference]: Finished difference Result 28226 states and 108274 transitions. [2020-09-11 20:17:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:31,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-09-11 20:17:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:31,500 INFO L225 Difference]: With dead ends: 28226 [2020-09-11 20:17:31,500 INFO L226 Difference]: Without dead ends: 28206 [2020-09-11 20:17:31,500 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 20:17:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28206 states. [2020-09-11 20:17:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28206 to 8277. [2020-09-11 20:17:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8277 states. [2020-09-11 20:17:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 37487 transitions. [2020-09-11 20:17:31,891 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 37487 transitions. Word has length 25 [2020-09-11 20:17:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:31,892 INFO L479 AbstractCegarLoop]: Abstraction has 8277 states and 37487 transitions. [2020-09-11 20:17:31,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 20:17:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 37487 transitions. [2020-09-11 20:17:31,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:31,896 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:31,896 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:31,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-09-11 20:17:31,896 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-09-11 20:17:31,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:31,896 INFO L82 PathProgramCache]: Analyzing trace with hash -857622932, now seen corresponding path program 5 times [2020-09-11 20:17:31,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:31,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225930428] [2020-09-11 20:17:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:17:32,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225930428] [2020-09-11 20:17:32,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:17:32,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 20:17:32,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511780] [2020-09-11 20:17:32,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 20:17:32,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:32,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 20:17:32,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:17:32,004 INFO L87 Difference]: Start difference. First operand 8277 states and 37487 transitions. Second operand 9 states. [2020-09-11 20:17:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:33,024 INFO L93 Difference]: Finished difference Result 27801 states and 106552 transitions. [2020-09-11 20:17:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:33,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-09-11 20:17:33,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:33,093 INFO L225 Difference]: With dead ends: 27801 [2020-09-11 20:17:33,093 INFO L226 Difference]: Without dead ends: 27781 [2020-09-11 20:17:33,093 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 20:17:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27781 states. [2020-09-11 20:17:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27781 to 8127. [2020-09-11 20:17:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8127 states. [2020-09-11 20:17:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8127 states to 8127 states and 36806 transitions. [2020-09-11 20:17:33,495 INFO L78 Accepts]: Start accepts. Automaton has 8127 states and 36806 transitions. Word has length 25 [2020-09-11 20:17:33,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:33,495 INFO L479 AbstractCegarLoop]: Abstraction has 8127 states and 36806 transitions. [2020-09-11 20:17:33,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 20:17:33,495 INFO L276 IsEmpty]: Start isEmpty. Operand 8127 states and 36806 transitions. [2020-09-11 20:17:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:33,498 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:33,498 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:33,498 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-09-11 20:17:33,499 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-09-11 20:17:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:33,499 INFO L82 PathProgramCache]: Analyzing trace with hash -864096941, now seen corresponding path program 6 times [2020-09-11 20:17:33,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:33,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441755608] [2020-09-11 20:17:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:17:33,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441755608] [2020-09-11 20:17:33,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:17:33,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 20:17:33,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107758543] [2020-09-11 20:17:33,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 20:17:33,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:33,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 20:17:33,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:17:33,600 INFO L87 Difference]: Start difference. First operand 8127 states and 36806 transitions. Second operand 9 states. [2020-09-11 20:17:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:34,644 INFO L93 Difference]: Finished difference Result 27548 states and 105447 transitions. [2020-09-11 20:17:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:34,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-09-11 20:17:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:34,753 INFO L225 Difference]: With dead ends: 27548 [2020-09-11 20:17:34,754 INFO L226 Difference]: Without dead ends: 27521 [2020-09-11 20:17:34,754 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-09-11 20:17:34,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27521 states. [2020-09-11 20:17:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27521 to 7841. [2020-09-11 20:17:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7841 states. [2020-09-11 20:17:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7841 states to 7841 states and 35578 transitions. [2020-09-11 20:17:35,350 INFO L78 Accepts]: Start accepts. Automaton has 7841 states and 35578 transitions. Word has length 25 [2020-09-11 20:17:35,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:35,350 INFO L479 AbstractCegarLoop]: Abstraction has 7841 states and 35578 transitions. [2020-09-11 20:17:35,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 20:17:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 7841 states and 35578 transitions. [2020-09-11 20:17:35,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:35,353 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:35,353 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:35,353 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-09-11 20:17:35,353 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-09-11 20:17:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash -864117370, now seen corresponding path program 5 times [2020-09-11 20:17:35,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:35,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558927024] [2020-09-11 20:17:35,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:17:35,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558927024] [2020-09-11 20:17:35,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:17:35,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 20:17:35,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134381243] [2020-09-11 20:17:35,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 20:17:35,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:35,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 20:17:35,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:17:35,461 INFO L87 Difference]: Start difference. First operand 7841 states and 35578 transitions. Second operand 9 states. [2020-09-11 20:17:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:36,555 INFO L93 Difference]: Finished difference Result 27167 states and 103966 transitions. [2020-09-11 20:17:36,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:36,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-09-11 20:17:36,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:36,623 INFO L225 Difference]: With dead ends: 27167 [2020-09-11 20:17:36,624 INFO L226 Difference]: Without dead ends: 27147 [2020-09-11 20:17:36,624 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 20:17:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27147 states. [2020-09-11 20:17:37,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27147 to 7743. [2020-09-11 20:17:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7743 states. [2020-09-11 20:17:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7743 states to 7743 states and 35142 transitions. [2020-09-11 20:17:37,133 INFO L78 Accepts]: Start accepts. Automaton has 7743 states and 35142 transitions. Word has length 25 [2020-09-11 20:17:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:37,133 INFO L479 AbstractCegarLoop]: Abstraction has 7743 states and 35142 transitions. [2020-09-11 20:17:37,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 20:17:37,133 INFO L276 IsEmpty]: Start isEmpty. Operand 7743 states and 35142 transitions. [2020-09-11 20:17:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:37,136 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:37,136 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:37,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-09-11 20:17:37,136 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-09-11 20:17:37,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:37,137 INFO L82 PathProgramCache]: Analyzing trace with hash -877234772, now seen corresponding path program 6 times [2020-09-11 20:17:37,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:37,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963318346] [2020-09-11 20:17:37,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:17:37,244 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963318346] [2020-09-11 20:17:37,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:17:37,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 20:17:37,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158818907] [2020-09-11 20:17:37,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 20:17:37,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:37,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 20:17:37,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:17:37,245 INFO L87 Difference]: Start difference. First operand 7743 states and 35142 transitions. Second operand 9 states. [2020-09-11 20:17:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:38,344 INFO L93 Difference]: Finished difference Result 26955 states and 103085 transitions. [2020-09-11 20:17:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:38,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-09-11 20:17:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:38,411 INFO L225 Difference]: With dead ends: 26955 [2020-09-11 20:17:38,411 INFO L226 Difference]: Without dead ends: 26928 [2020-09-11 20:17:38,412 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 20:17:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26928 states. [2020-09-11 20:17:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26928 to 7532. [2020-09-11 20:17:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7532 states. [2020-09-11 20:17:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7532 states to 7532 states and 34256 transitions. [2020-09-11 20:17:38,806 INFO L78 Accepts]: Start accepts. Automaton has 7532 states and 34256 transitions. Word has length 25 [2020-09-11 20:17:38,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:38,806 INFO L479 AbstractCegarLoop]: Abstraction has 7532 states and 34256 transitions. [2020-09-11 20:17:38,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 20:17:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 7532 states and 34256 transitions. [2020-09-11 20:17:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:38,809 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:38,809 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:38,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-09-11 20:17:38,810 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-09-11 20:17:38,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:38,810 INFO L82 PathProgramCache]: Analyzing trace with hash -877241530, now seen corresponding path program 6 times [2020-09-11 20:17:38,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:38,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348747646] [2020-09-11 20:17:38,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:17:38,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348747646] [2020-09-11 20:17:38,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:17:38,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 20:17:38,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288295744] [2020-09-11 20:17:38,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 20:17:38,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:38,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 20:17:38,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:17:38,911 INFO L87 Difference]: Start difference. First operand 7532 states and 34256 transitions. Second operand 9 states. [2020-09-11 20:17:40,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:40,128 INFO L93 Difference]: Finished difference Result 26632 states and 101828 transitions. [2020-09-11 20:17:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:17:40,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-09-11 20:17:40,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:40,188 INFO L225 Difference]: With dead ends: 26632 [2020-09-11 20:17:40,189 INFO L226 Difference]: Without dead ends: 26605 [2020-09-11 20:17:40,189 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-09-11 20:17:40,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26605 states. [2020-09-11 20:17:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26605 to 7269. [2020-09-11 20:17:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7269 states. [2020-09-11 20:17:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7269 states to 7269 states and 33154 transitions. [2020-09-11 20:17:40,567 INFO L78 Accepts]: Start accepts. Automaton has 7269 states and 33154 transitions. Word has length 25 [2020-09-11 20:17:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:40,568 INFO L479 AbstractCegarLoop]: Abstraction has 7269 states and 33154 transitions. [2020-09-11 20:17:40,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 20:17:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 7269 states and 33154 transitions. [2020-09-11 20:17:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:17:40,571 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:40,571 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:40,572 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-09-11 20:17:40,572 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-09-11 20:17:40,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:40,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1311164244, now seen corresponding path program 1 times [2020-09-11 20:17:40,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:40,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052951055] [2020-09-11 20:17:40,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-09-11 20:17:40,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052951055] [2020-09-11 20:17:40,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:17:40,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:17:40,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804770042] [2020-09-11 20:17:40,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:17:40,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:40,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:17:40,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:17:40,632 INFO L87 Difference]: Start difference. First operand 7269 states and 33154 transitions. Second operand 5 states. [2020-09-11 20:17:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:40,813 INFO L93 Difference]: Finished difference Result 11919 states and 51979 transitions. [2020-09-11 20:17:40,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:17:40,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-09-11 20:17:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:40,845 INFO L225 Difference]: With dead ends: 11919 [2020-09-11 20:17:40,845 INFO L226 Difference]: Without dead ends: 11887 [2020-09-11 20:17:40,845 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-09-11 20:17:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-09-11 20:17:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 8560. [2020-09-11 20:17:41,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8560 states. [2020-09-11 20:17:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 38495 transitions. [2020-09-11 20:17:41,102 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 38495 transitions. Word has length 25 [2020-09-11 20:17:41,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:41,102 INFO L479 AbstractCegarLoop]: Abstraction has 8560 states and 38495 transitions. [2020-09-11 20:17:41,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:17:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 38495 transitions. [2020-09-11 20:17:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-11 20:17:41,106 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:41,106 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:41,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-09-11 20:17:41,106 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-09-11 20:17:41,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:41,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1986416772, now seen corresponding path program 1 times [2020-09-11 20:17:41,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:41,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085189092] [2020-09-11 20:17:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 20:17:41,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 20:17:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 20:17:41,128 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 20:17:41,138 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-11 20:17:41,139 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-11 20:17:41,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-09-11 20:17:41,139 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-11 20:17:41,140 WARN L363 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-09-11 20:17:41,140 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-09-11 20:17:41,160 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,160 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,160 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,160 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,161 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,161 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,161 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,161 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,161 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,161 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,162 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,162 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,162 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,162 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,162 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,163 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,163 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,163 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,163 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,163 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,163 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,163 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,164 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,164 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,164 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,164 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,164 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,164 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,164 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,164 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,164 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,164 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,165 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,165 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,165 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,165 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,165 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,165 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,165 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,166 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,166 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,166 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,166 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,166 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,173 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,173 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,173 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,174 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,174 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,174 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,174 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,174 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,175 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,175 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,175 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,175 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,175 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,178 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,179 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,179 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,179 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,179 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,180 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,180 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,181 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,181 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,181 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,183 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,184 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,184 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,184 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,184 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,185 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,185 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,185 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,186 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,186 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,187 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,187 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,187 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,187 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,188 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,189 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,189 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,190 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,190 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,191 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,191 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,192 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,192 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,193 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,194 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,194 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,195 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,195 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,196 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,196 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,197 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,197 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,198 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,198 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 20:17:41,200 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-09-11 20:17:41,200 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 20:17:41,200 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 20:17:41,200 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-11 20:17:41,200 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 20:17:41,200 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 20:17:41,201 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 20:17:41,201 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 20:17:41,201 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 20:17:41,202 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 138 transitions, 396 flow [2020-09-11 20:17:41,203 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 156 places, 138 transitions, 396 flow [2020-09-11 20:17:41,223 INFO L129 PetriNetUnfolder]: 9/173 cut-off events. [2020-09-11 20:17:41,223 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-09-11 20:17:41,225 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-09-11 20:17:41,230 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 156 places, 138 transitions, 396 flow [2020-09-11 20:17:41,248 INFO L129 PetriNetUnfolder]: 9/173 cut-off events. [2020-09-11 20:17:41,249 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-09-11 20:17:41,250 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-09-11 20:17:41,255 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2020-09-11 20:17:41,256 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-09-11 20:17:43,735 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-09-11 20:17:44,115 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2020-09-11 20:17:44,314 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2020-09-11 20:17:44,320 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3678 [2020-09-11 20:17:44,320 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2020-09-11 20:17:44,320 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 45 transitions, 210 flow [2020-09-11 20:17:46,031 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2020-09-11 20:17:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2020-09-11 20:17:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-09-11 20:17:46,032 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:46,032 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-09-11 20:17:46,032 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-09-11 20:17:46,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:46,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1298891, now seen corresponding path program 1 times [2020-09-11 20:17:46,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:46,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350796194] [2020-09-11 20:17:46,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:17:46,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350796194] [2020-09-11 20:17:46,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:17:46,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-09-11 20:17:46,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997795214] [2020-09-11 20:17:46,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 20:17:46,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:46,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 20:17:46,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 20:17:46,049 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2020-09-11 20:17:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:46,193 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2020-09-11 20:17:46,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 20:17:46,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-09-11 20:17:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:46,242 INFO L225 Difference]: With dead ends: 17885 [2020-09-11 20:17:46,242 INFO L226 Difference]: Without dead ends: 16791 [2020-09-11 20:17:46,243 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-09-11 20:17:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2020-09-11 20:17:46,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16791. [2020-09-11 20:17:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16791 states. [2020-09-11 20:17:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16791 states to 16791 states and 86558 transitions. [2020-09-11 20:17:47,005 INFO L78 Accepts]: Start accepts. Automaton has 16791 states and 86558 transitions. Word has length 3 [2020-09-11 20:17:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:47,005 INFO L479 AbstractCegarLoop]: Abstraction has 16791 states and 86558 transitions. [2020-09-11 20:17:47,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 20:17:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 16791 states and 86558 transitions. [2020-09-11 20:17:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-11 20:17:47,005 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:47,005 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:47,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-09-11 20:17:47,005 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-09-11 20:17:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1091574945, now seen corresponding path program 1 times [2020-09-11 20:17:47,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:47,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95952654] [2020-09-11 20:17:47,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:17:47,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95952654] [2020-09-11 20:17:47,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:17:47,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:17:47,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955884614] [2020-09-11 20:17:47,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:17:47,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:47,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:17:47,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:17:47,041 INFO L87 Difference]: Start difference. First operand 16791 states and 86558 transitions. Second operand 5 states. [2020-09-11 20:17:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:47,323 INFO L93 Difference]: Finished difference Result 30985 states and 150574 transitions. [2020-09-11 20:17:47,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:17:47,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-09-11 20:17:47,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:47,409 INFO L225 Difference]: With dead ends: 30985 [2020-09-11 20:17:47,409 INFO L226 Difference]: Without dead ends: 30977 [2020-09-11 20:17:47,409 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-09-11 20:17:47,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30977 states. [2020-09-11 20:17:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30977 to 19868. [2020-09-11 20:17:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19868 states. [2020-09-11 20:17:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19868 states to 19868 states and 103363 transitions. [2020-09-11 20:17:48,416 INFO L78 Accepts]: Start accepts. Automaton has 19868 states and 103363 transitions. Word has length 9 [2020-09-11 20:17:48,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:48,417 INFO L479 AbstractCegarLoop]: Abstraction has 19868 states and 103363 transitions. [2020-09-11 20:17:48,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:17:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 19868 states and 103363 transitions. [2020-09-11 20:17:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-11 20:17:48,417 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:48,417 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:48,417 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-09-11 20:17:48,417 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-09-11 20:17:48,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:48,418 INFO L82 PathProgramCache]: Analyzing trace with hash -231509072, now seen corresponding path program 1 times [2020-09-11 20:17:48,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:48,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371421032] [2020-09-11 20:17:48,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:17:48,456 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371421032] [2020-09-11 20:17:48,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:17:48,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:17:48,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734772707] [2020-09-11 20:17:48,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:17:48,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:48,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:17:48,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:17:48,458 INFO L87 Difference]: Start difference. First operand 19868 states and 103363 transitions. Second operand 5 states. [2020-09-11 20:17:49,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:49,985 INFO L93 Difference]: Finished difference Result 36296 states and 178836 transitions. [2020-09-11 20:17:49,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:17:49,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-11 20:17:49,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:50,090 INFO L225 Difference]: With dead ends: 36296 [2020-09-11 20:17:50,090 INFO L226 Difference]: Without dead ends: 36280 [2020-09-11 20:17:50,090 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-09-11 20:17:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36280 states. [2020-09-11 20:17:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36280 to 23806. [2020-09-11 20:17:51,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23806 states. [2020-09-11 20:17:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 125455 transitions. [2020-09-11 20:17:51,261 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 125455 transitions. Word has length 13 [2020-09-11 20:17:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:51,261 INFO L479 AbstractCegarLoop]: Abstraction has 23806 states and 125455 transitions. [2020-09-11 20:17:51,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:17:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 125455 transitions. [2020-09-11 20:17:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 20:17:51,262 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:51,262 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:51,262 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-09-11 20:17:51,262 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-09-11 20:17:51,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:51,263 INFO L82 PathProgramCache]: Analyzing trace with hash -588793474, now seen corresponding path program 1 times [2020-09-11 20:17:51,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:51,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860156133] [2020-09-11 20:17:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:17:51,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860156133] [2020-09-11 20:17:51,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744281950] [2020-09-11 20:17:51,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:17:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:51,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:17:51,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:17:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:17:51,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:17:51,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:17:51,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590909624] [2020-09-11 20:17:51,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:17:51,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:51,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:17:51,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:17:51,525 INFO L87 Difference]: Start difference. First operand 23806 states and 125455 transitions. Second operand 12 states. [2020-09-11 20:17:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:52,284 INFO L93 Difference]: Finished difference Result 56720 states and 262685 transitions. [2020-09-11 20:17:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:17:52,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-09-11 20:17:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:52,453 INFO L225 Difference]: With dead ends: 56720 [2020-09-11 20:17:52,453 INFO L226 Difference]: Without dead ends: 56704 [2020-09-11 20:17:52,453 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-09-11 20:17:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56704 states. [2020-09-11 20:17:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56704 to 23629. [2020-09-11 20:17:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23629 states. [2020-09-11 20:17:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23629 states to 23629 states and 124418 transitions. [2020-09-11 20:17:56,202 INFO L78 Accepts]: Start accepts. Automaton has 23629 states and 124418 transitions. Word has length 15 [2020-09-11 20:17:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:56,202 INFO L479 AbstractCegarLoop]: Abstraction has 23629 states and 124418 transitions. [2020-09-11 20:17:56,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:17:56,202 INFO L276 IsEmpty]: Start isEmpty. Operand 23629 states and 124418 transitions. [2020-09-11 20:17:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 20:17:56,203 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:56,203 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:56,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-09-11 20:17:56,404 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-09-11 20:17:56,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:56,404 INFO L82 PathProgramCache]: Analyzing trace with hash 858081470, now seen corresponding path program 2 times [2020-09-11 20:17:56,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:56,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308204364] [2020-09-11 20:17:56,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:17:56,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308204364] [2020-09-11 20:17:56,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:17:56,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:17:56,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136915961] [2020-09-11 20:17:56,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:17:56,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:56,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:17:56,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:17:56,468 INFO L87 Difference]: Start difference. First operand 23629 states and 124418 transitions. Second operand 7 states. [2020-09-11 20:17:57,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:57,177 INFO L93 Difference]: Finished difference Result 58078 states and 269185 transitions. [2020-09-11 20:17:57,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:17:57,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-09-11 20:17:57,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:57,358 INFO L225 Difference]: With dead ends: 58078 [2020-09-11 20:17:57,358 INFO L226 Difference]: Without dead ends: 58061 [2020-09-11 20:17:57,359 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-09-11 20:17:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58061 states. [2020-09-11 20:17:58,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58061 to 23109. [2020-09-11 20:17:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23109 states. [2020-09-11 20:17:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 121651 transitions. [2020-09-11 20:17:58,849 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 121651 transitions. Word has length 15 [2020-09-11 20:17:58,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:17:58,849 INFO L479 AbstractCegarLoop]: Abstraction has 23109 states and 121651 transitions. [2020-09-11 20:17:58,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:17:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 121651 transitions. [2020-09-11 20:17:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-11 20:17:58,849 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:17:58,850 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:17:58,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-09-11 20:17:58,850 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-09-11 20:17:58,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:17:58,850 INFO L82 PathProgramCache]: Analyzing trace with hash 704376303, now seen corresponding path program 1 times [2020-09-11 20:17:58,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:17:58,850 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072063601] [2020-09-11 20:17:58,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:17:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:17:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:17:58,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072063601] [2020-09-11 20:17:58,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:17:58,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:17:58,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645486112] [2020-09-11 20:17:58,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:17:58,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:17:58,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:17:58,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:17:58,897 INFO L87 Difference]: Start difference. First operand 23109 states and 121651 transitions. Second operand 5 states. [2020-09-11 20:17:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:17:59,278 INFO L93 Difference]: Finished difference Result 41885 states and 209629 transitions. [2020-09-11 20:17:59,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:17:59,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-11 20:17:59,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:17:59,409 INFO L225 Difference]: With dead ends: 41885 [2020-09-11 20:17:59,409 INFO L226 Difference]: Without dead ends: 41856 [2020-09-11 20:17:59,409 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-09-11 20:18:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41856 states. [2020-09-11 20:18:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41856 to 28237. [2020-09-11 20:18:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28237 states. [2020-09-11 20:18:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28237 states to 28237 states and 150261 transitions. [2020-09-11 20:18:01,407 INFO L78 Accepts]: Start accepts. Automaton has 28237 states and 150261 transitions. Word has length 17 [2020-09-11 20:18:01,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:18:01,407 INFO L479 AbstractCegarLoop]: Abstraction has 28237 states and 150261 transitions. [2020-09-11 20:18:01,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:18:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 28237 states and 150261 transitions. [2020-09-11 20:18:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 20:18:01,408 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:18:01,408 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:18:01,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-09-11 20:18:01,408 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-09-11 20:18:01,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:18:01,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1918672061, now seen corresponding path program 1 times [2020-09-11 20:18:01,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:18:01,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012088501] [2020-09-11 20:18:01,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:18:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:18:01,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012088501] [2020-09-11 20:18:01,476 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551061502] [2020-09-11 20:18:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:18:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:01,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:18:01,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:18:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:18:01,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:18:01,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:18:01,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7003669] [2020-09-11 20:18:01,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:18:01,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:18:01,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:18:01,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:18:01,678 INFO L87 Difference]: Start difference. First operand 28237 states and 150261 transitions. Second operand 12 states. [2020-09-11 20:18:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:18:02,451 INFO L93 Difference]: Finished difference Result 66831 states and 314874 transitions. [2020-09-11 20:18:02,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:18:02,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-09-11 20:18:02,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:18:02,643 INFO L225 Difference]: With dead ends: 66831 [2020-09-11 20:18:02,643 INFO L226 Difference]: Without dead ends: 66807 [2020-09-11 20:18:02,643 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-09-11 20:18:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66807 states. [2020-09-11 20:18:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66807 to 28673. [2020-09-11 20:18:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28673 states. [2020-09-11 20:18:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28673 states to 28673 states and 152375 transitions. [2020-09-11 20:18:04,329 INFO L78 Accepts]: Start accepts. Automaton has 28673 states and 152375 transitions. Word has length 19 [2020-09-11 20:18:04,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:18:04,329 INFO L479 AbstractCegarLoop]: Abstraction has 28673 states and 152375 transitions. [2020-09-11 20:18:04,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:18:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 28673 states and 152375 transitions. [2020-09-11 20:18:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 20:18:04,330 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:18:04,330 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:18:04,544 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2020-09-11 20:18:04,544 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-09-11 20:18:04,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:18:04,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1064014108, now seen corresponding path program 1 times [2020-09-11 20:18:04,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:18:04,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697946644] [2020-09-11 20:18:04,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:18:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:18:04,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697946644] [2020-09-11 20:18:04,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783189551] [2020-09-11 20:18:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:18:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:04,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:18:04,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:18:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:18:04,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:18:04,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:18:04,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569087058] [2020-09-11 20:18:04,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:18:04,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:18:04,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:18:04,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:18:04,804 INFO L87 Difference]: Start difference. First operand 28673 states and 152375 transitions. Second operand 12 states. [2020-09-11 20:18:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:18:06,839 INFO L93 Difference]: Finished difference Result 69484 states and 328264 transitions. [2020-09-11 20:18:06,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:18:06,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-09-11 20:18:06,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:18:07,047 INFO L225 Difference]: With dead ends: 69484 [2020-09-11 20:18:07,047 INFO L226 Difference]: Without dead ends: 69451 [2020-09-11 20:18:07,048 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-09-11 20:18:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69451 states. [2020-09-11 20:18:08,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69451 to 28873. [2020-09-11 20:18:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28873 states. [2020-09-11 20:18:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28873 states to 28873 states and 153454 transitions. [2020-09-11 20:18:08,782 INFO L78 Accepts]: Start accepts. Automaton has 28873 states and 153454 transitions. Word has length 19 [2020-09-11 20:18:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:18:08,782 INFO L479 AbstractCegarLoop]: Abstraction has 28873 states and 153454 transitions. [2020-09-11 20:18:08,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:18:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 28873 states and 153454 transitions. [2020-09-11 20:18:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 20:18:08,783 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:18:08,783 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:18:08,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:18:08,984 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-09-11 20:18:08,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:18:08,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1699177508, now seen corresponding path program 2 times [2020-09-11 20:18:08,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:18:08,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001635723] [2020-09-11 20:18:08,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:18:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:18:09,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001635723] [2020-09-11 20:18:09,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:18:09,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:18:09,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939034399] [2020-09-11 20:18:09,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:18:09,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:18:09,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:18:09,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:18:09,050 INFO L87 Difference]: Start difference. First operand 28873 states and 153454 transitions. Second operand 7 states. [2020-09-11 20:18:09,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:18:09,769 INFO L93 Difference]: Finished difference Result 70510 states and 333491 transitions. [2020-09-11 20:18:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:18:09,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-11 20:18:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:18:09,974 INFO L225 Difference]: With dead ends: 70510 [2020-09-11 20:18:09,974 INFO L226 Difference]: Without dead ends: 70477 [2020-09-11 20:18:09,974 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-09-11 20:18:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70477 states. [2020-09-11 20:18:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70477 to 28942. [2020-09-11 20:18:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28942 states. [2020-09-11 20:18:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28942 states to 28942 states and 153921 transitions. [2020-09-11 20:18:12,498 INFO L78 Accepts]: Start accepts. Automaton has 28942 states and 153921 transitions. Word has length 19 [2020-09-11 20:18:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:18:12,498 INFO L479 AbstractCegarLoop]: Abstraction has 28942 states and 153921 transitions. [2020-09-11 20:18:12,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:18:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 28942 states and 153921 transitions. [2020-09-11 20:18:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 20:18:12,499 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:18:12,499 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:18:12,499 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-09-11 20:18:12,499 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-09-11 20:18:12,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:18:12,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1699205315, now seen corresponding path program 2 times [2020-09-11 20:18:12,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:18:12,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024439585] [2020-09-11 20:18:12,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:18:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:18:12,564 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024439585] [2020-09-11 20:18:12,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:18:12,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:18:12,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115205952] [2020-09-11 20:18:12,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:18:12,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:18:12,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:18:12,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:18:12,566 INFO L87 Difference]: Start difference. First operand 28942 states and 153921 transitions. Second operand 7 states. [2020-09-11 20:18:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:18:13,283 INFO L93 Difference]: Finished difference Result 70096 states and 331298 transitions. [2020-09-11 20:18:13,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:18:13,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-11 20:18:13,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:18:13,490 INFO L225 Difference]: With dead ends: 70096 [2020-09-11 20:18:13,490 INFO L226 Difference]: Without dead ends: 70063 [2020-09-11 20:18:13,490 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-09-11 20:18:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70063 states. [2020-09-11 20:18:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70063 to 29094. [2020-09-11 20:18:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29094 states. [2020-09-11 20:18:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 154883 transitions. [2020-09-11 20:18:17,740 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 154883 transitions. Word has length 19 [2020-09-11 20:18:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:18:17,740 INFO L479 AbstractCegarLoop]: Abstraction has 29094 states and 154883 transitions. [2020-09-11 20:18:17,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:18:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 154883 transitions. [2020-09-11 20:18:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:18:17,742 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:18:17,742 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:18:17,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-09-11 20:18:17,742 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-09-11 20:18:17,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:18:17,743 INFO L82 PathProgramCache]: Analyzing trace with hash -228866966, now seen corresponding path program 1 times [2020-09-11 20:18:17,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:18:17,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516255362] [2020-09-11 20:18:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:18:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:18:17,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516255362] [2020-09-11 20:18:17,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976072978] [2020-09-11 20:18:17,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:18:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:17,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:18:17,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:18:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 20:18:18,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:18:18,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:18:18,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105217151] [2020-09-11 20:18:18,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:18:18,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:18:18,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:18:18,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:18:18,073 INFO L87 Difference]: Start difference. First operand 29094 states and 154883 transitions. Second operand 16 states. [2020-09-11 20:18:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:18:19,755 INFO L93 Difference]: Finished difference Result 100731 states and 448596 transitions. [2020-09-11 20:18:19,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:18:19,756 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-09-11 20:18:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:18:20,043 INFO L225 Difference]: With dead ends: 100731 [2020-09-11 20:18:20,043 INFO L226 Difference]: Without dead ends: 100715 [2020-09-11 20:18:20,043 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:18:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100715 states. [2020-09-11 20:18:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100715 to 28719. [2020-09-11 20:18:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28719 states. [2020-09-11 20:18:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28719 states to 28719 states and 152760 transitions. [2020-09-11 20:18:22,845 INFO L78 Accepts]: Start accepts. Automaton has 28719 states and 152760 transitions. Word has length 21 [2020-09-11 20:18:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:18:22,845 INFO L479 AbstractCegarLoop]: Abstraction has 28719 states and 152760 transitions. [2020-09-11 20:18:22,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:18:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 28719 states and 152760 transitions. [2020-09-11 20:18:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:18:22,846 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:18:22,846 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:18:23,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2020-09-11 20:18:23,047 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-09-11 20:18:23,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:18:23,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1302908714, now seen corresponding path program 2 times [2020-09-11 20:18:23,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:18:23,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421977062] [2020-09-11 20:18:23,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:18:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:18:23,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421977062] [2020-09-11 20:18:23,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173856727] [2020-09-11 20:18:23,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:18:23,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 20:18:23,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:18:23,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:18:23,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:18:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:18:23,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:18:23,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:18:23,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334314310] [2020-09-11 20:18:23,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:18:23,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:18:23,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:18:23,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:18:23,397 INFO L87 Difference]: Start difference. First operand 28719 states and 152760 transitions. Second operand 16 states. [2020-09-11 20:18:25,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:18:25,072 INFO L93 Difference]: Finished difference Result 99876 states and 444348 transitions. [2020-09-11 20:18:25,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:18:25,072 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-09-11 20:18:25,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:18:25,349 INFO L225 Difference]: With dead ends: 99876 [2020-09-11 20:18:25,349 INFO L226 Difference]: Without dead ends: 99855 [2020-09-11 20:18:25,349 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:18:26,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99855 states. [2020-09-11 20:18:28,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99855 to 28343. [2020-09-11 20:18:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28343 states. [2020-09-11 20:18:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28343 states to 28343 states and 150639 transitions. [2020-09-11 20:18:28,235 INFO L78 Accepts]: Start accepts. Automaton has 28343 states and 150639 transitions. Word has length 21 [2020-09-11 20:18:28,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:18:28,235 INFO L479 AbstractCegarLoop]: Abstraction has 28343 states and 150639 transitions. [2020-09-11 20:18:28,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:18:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 28343 states and 150639 transitions. [2020-09-11 20:18:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:18:28,237 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:18:28,237 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:18:28,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:18:28,438 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-09-11 20:18:28,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:18:28,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1149181014, now seen corresponding path program 3 times [2020-09-11 20:18:28,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:18:28,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959808856] [2020-09-11 20:18:28,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:18:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:18:28,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959808856] [2020-09-11 20:18:28,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323289202] [2020-09-11 20:18:28,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:18:28,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-09-11 20:18:28,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:18:28,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:18:28,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:18:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:18:28,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:18:28,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:18:28,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493094878] [2020-09-11 20:18:28,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:18:28,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:18:28,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:18:28,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:18:28,766 INFO L87 Difference]: Start difference. First operand 28343 states and 150639 transitions. Second operand 16 states. [2020-09-11 20:18:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:18:30,521 INFO L93 Difference]: Finished difference Result 100071 states and 445291 transitions. [2020-09-11 20:18:30,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:18:30,522 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-09-11 20:18:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:18:30,801 INFO L225 Difference]: With dead ends: 100071 [2020-09-11 20:18:30,802 INFO L226 Difference]: Without dead ends: 100055 [2020-09-11 20:18:30,802 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:18:32,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100055 states. [2020-09-11 20:18:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100055 to 27654. [2020-09-11 20:18:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27654 states. [2020-09-11 20:18:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27654 states to 27654 states and 147080 transitions. [2020-09-11 20:18:33,395 INFO L78 Accepts]: Start accepts. Automaton has 27654 states and 147080 transitions. Word has length 21 [2020-09-11 20:18:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:18:33,395 INFO L479 AbstractCegarLoop]: Abstraction has 27654 states and 147080 transitions. [2020-09-11 20:18:33,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:18:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 27654 states and 147080 transitions. [2020-09-11 20:18:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:18:33,396 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:18:33,396 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:18:33,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2020-09-11 20:18:33,597 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-09-11 20:18:33,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:18:33,598 INFO L82 PathProgramCache]: Analyzing trace with hash 315341610, now seen corresponding path program 4 times [2020-09-11 20:18:33,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:18:33,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584240825] [2020-09-11 20:18:33,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:18:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:18:33,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584240825] [2020-09-11 20:18:33,691 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822026967] [2020-09-11 20:18:33,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:18:33,812 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-11 20:18:33,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:18:33,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:18:33,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:18:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 20:18:33,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:18:33,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:18:33,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251520588] [2020-09-11 20:18:33,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:18:33,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:18:33,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:18:33,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:18:33,958 INFO L87 Difference]: Start difference. First operand 27654 states and 147080 transitions. Second operand 16 states. [2020-09-11 20:18:35,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:18:35,456 INFO L93 Difference]: Finished difference Result 99523 states and 442763 transitions. [2020-09-11 20:18:35,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:18:35,456 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-09-11 20:18:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:18:35,738 INFO L225 Difference]: With dead ends: 99523 [2020-09-11 20:18:35,739 INFO L226 Difference]: Without dead ends: 99502 [2020-09-11 20:18:35,739 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:18:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99502 states. [2020-09-11 20:18:38,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99502 to 27278. [2020-09-11 20:18:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27278 states. [2020-09-11 20:18:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27278 states to 27278 states and 144959 transitions. [2020-09-11 20:18:38,309 INFO L78 Accepts]: Start accepts. Automaton has 27278 states and 144959 transitions. Word has length 21 [2020-09-11 20:18:38,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:18:38,309 INFO L479 AbstractCegarLoop]: Abstraction has 27278 states and 144959 transitions. [2020-09-11 20:18:38,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:18:38,309 INFO L276 IsEmpty]: Start isEmpty. Operand 27278 states and 144959 transitions. [2020-09-11 20:18:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:18:38,311 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:18:38,311 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:18:38,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2020-09-11 20:18:38,524 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-09-11 20:18:38,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:18:38,525 INFO L82 PathProgramCache]: Analyzing trace with hash -822012438, now seen corresponding path program 5 times [2020-09-11 20:18:38,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:18:38,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160223507] [2020-09-11 20:18:38,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:18:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:18:38,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160223507] [2020-09-11 20:18:38,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:18:38,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 20:18:38,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92720973] [2020-09-11 20:18:38,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 20:18:38,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:18:38,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 20:18:38,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:18:38,617 INFO L87 Difference]: Start difference. First operand 27278 states and 144959 transitions. Second operand 9 states. [2020-09-11 20:18:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:18:40,584 INFO L93 Difference]: Finished difference Result 99710 states and 443686 transitions. [2020-09-11 20:18:40,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:18:40,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 20:18:40,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:18:40,887 INFO L225 Difference]: With dead ends: 99710 [2020-09-11 20:18:40,887 INFO L226 Difference]: Without dead ends: 99694 [2020-09-11 20:18:40,887 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 20:18:41,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99694 states. [2020-09-11 20:18:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99694 to 26597. [2020-09-11 20:18:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26597 states. [2020-09-11 20:18:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26597 states to 26597 states and 141420 transitions. [2020-09-11 20:18:42,994 INFO L78 Accepts]: Start accepts. Automaton has 26597 states and 141420 transitions. Word has length 21 [2020-09-11 20:18:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:18:42,994 INFO L479 AbstractCegarLoop]: Abstraction has 26597 states and 141420 transitions. [2020-09-11 20:18:42,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 20:18:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 26597 states and 141420 transitions. [2020-09-11 20:18:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:18:42,995 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:18:42,995 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:18:42,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2020-09-11 20:18:42,995 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-09-11 20:18:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:18:42,995 INFO L82 PathProgramCache]: Analyzing trace with hash -848707158, now seen corresponding path program 6 times [2020-09-11 20:18:42,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:18:42,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197279206] [2020-09-11 20:18:42,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:18:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:18:43,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197279206] [2020-09-11 20:18:43,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:18:43,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 20:18:43,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492629329] [2020-09-11 20:18:43,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 20:18:43,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:18:43,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 20:18:43,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 20:18:43,089 INFO L87 Difference]: Start difference. First operand 26597 states and 141420 transitions. Second operand 9 states. [2020-09-11 20:18:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:18:44,831 INFO L93 Difference]: Finished difference Result 98863 states and 439458 transitions. [2020-09-11 20:18:44,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:18:44,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 20:18:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:18:45,102 INFO L225 Difference]: With dead ends: 98863 [2020-09-11 20:18:45,102 INFO L226 Difference]: Without dead ends: 98841 [2020-09-11 20:18:45,103 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 20:18:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98841 states. [2020-09-11 20:18:47,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98841 to 25744. [2020-09-11 20:18:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25744 states. [2020-09-11 20:18:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25744 states to 25744 states and 137181 transitions. [2020-09-11 20:18:50,178 INFO L78 Accepts]: Start accepts. Automaton has 25744 states and 137181 transitions. Word has length 21 [2020-09-11 20:18:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:18:50,178 INFO L479 AbstractCegarLoop]: Abstraction has 25744 states and 137181 transitions. [2020-09-11 20:18:50,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 20:18:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25744 states and 137181 transitions. [2020-09-11 20:18:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 20:18:50,180 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:18:50,180 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:18:50,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-09-11 20:18:50,180 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-09-11 20:18:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:18:50,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1818695965, now seen corresponding path program 1 times [2020-09-11 20:18:50,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:18:50,181 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116105677] [2020-09-11 20:18:50,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:18:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:18:50,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116105677] [2020-09-11 20:18:50,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:18:50,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 20:18:50,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017700143] [2020-09-11 20:18:50,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 20:18:50,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:18:50,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 20:18:50,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 20:18:50,231 INFO L87 Difference]: Start difference. First operand 25744 states and 137181 transitions. Second operand 5 states. [2020-09-11 20:18:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:18:50,607 INFO L93 Difference]: Finished difference Result 46463 states and 236107 transitions. [2020-09-11 20:18:50,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 20:18:50,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-09-11 20:18:50,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:18:50,744 INFO L225 Difference]: With dead ends: 46463 [2020-09-11 20:18:50,745 INFO L226 Difference]: Without dead ends: 46417 [2020-09-11 20:18:50,745 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-09-11 20:18:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46417 states. [2020-09-11 20:18:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46417 to 31960. [2020-09-11 20:18:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31960 states. [2020-09-11 20:18:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31960 states to 31960 states and 171209 transitions. [2020-09-11 20:18:52,169 INFO L78 Accepts]: Start accepts. Automaton has 31960 states and 171209 transitions. Word has length 21 [2020-09-11 20:18:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:18:52,169 INFO L479 AbstractCegarLoop]: Abstraction has 31960 states and 171209 transitions. [2020-09-11 20:18:52,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 20:18:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 31960 states and 171209 transitions. [2020-09-11 20:18:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 20:18:52,171 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:18:52,171 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:18:52,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-09-11 20:18:52,171 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-09-11 20:18:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:18:52,171 INFO L82 PathProgramCache]: Analyzing trace with hash 605532395, now seen corresponding path program 1 times [2020-09-11 20:18:52,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:18:52,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75857255] [2020-09-11 20:18:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:18:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 20:18:52,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75857255] [2020-09-11 20:18:52,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597279606] [2020-09-11 20:18:52,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:18:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:52,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:18:52,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:18:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 20:18:52,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:18:52,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:18:52,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866852793] [2020-09-11 20:18:52,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:18:52,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:18:52,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:18:52,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:18:52,433 INFO L87 Difference]: Start difference. First operand 31960 states and 171209 transitions. Second operand 12 states. [2020-09-11 20:18:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:18:53,875 INFO L93 Difference]: Finished difference Result 75380 states and 361389 transitions. [2020-09-11 20:18:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:18:53,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-09-11 20:18:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:18:54,103 INFO L225 Difference]: With dead ends: 75380 [2020-09-11 20:18:54,104 INFO L226 Difference]: Without dead ends: 75344 [2020-09-11 20:18:54,104 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-09-11 20:18:54,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75344 states. [2020-09-11 20:18:55,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75344 to 32974. [2020-09-11 20:18:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32974 states. [2020-09-11 20:18:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32974 states to 32974 states and 176363 transitions. [2020-09-11 20:18:55,959 INFO L78 Accepts]: Start accepts. Automaton has 32974 states and 176363 transitions. Word has length 23 [2020-09-11 20:18:55,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:18:55,959 INFO L479 AbstractCegarLoop]: Abstraction has 32974 states and 176363 transitions. [2020-09-11 20:18:55,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:18:55,959 INFO L276 IsEmpty]: Start isEmpty. Operand 32974 states and 176363 transitions. [2020-09-11 20:18:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 20:18:55,961 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:18:55,961 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:18:56,161 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:18:56,162 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-09-11 20:18:56,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:18:56,162 INFO L82 PathProgramCache]: Analyzing trace with hash 768040394, now seen corresponding path program 1 times [2020-09-11 20:18:56,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:18:56,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987908684] [2020-09-11 20:18:56,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:18:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 20:18:56,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987908684] [2020-09-11 20:18:56,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021204099] [2020-09-11 20:18:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:18:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:18:56,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:18:56,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:18:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 20:18:56,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:18:56,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:18:56,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107542790] [2020-09-11 20:18:56,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:18:56,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:18:56,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:18:56,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:18:56,440 INFO L87 Difference]: Start difference. First operand 32974 states and 176363 transitions. Second operand 12 states. [2020-09-11 20:18:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:18:57,298 INFO L93 Difference]: Finished difference Result 79487 states and 381757 transitions. [2020-09-11 20:18:57,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:18:57,846 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-09-11 20:18:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:18:58,099 INFO L225 Difference]: With dead ends: 79487 [2020-09-11 20:18:58,100 INFO L226 Difference]: Without dead ends: 79445 [2020-09-11 20:18:58,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-09-11 20:18:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79445 states. [2020-09-11 20:18:59,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79445 to 33981. [2020-09-11 20:18:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33981 states. [2020-09-11 20:19:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33981 states to 33981 states and 181710 transitions. [2020-09-11 20:19:00,002 INFO L78 Accepts]: Start accepts. Automaton has 33981 states and 181710 transitions. Word has length 23 [2020-09-11 20:19:00,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:19:00,002 INFO L479 AbstractCegarLoop]: Abstraction has 33981 states and 181710 transitions. [2020-09-11 20:19:00,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:19:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 33981 states and 181710 transitions. [2020-09-11 20:19:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 20:19:00,004 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:19:00,004 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:19:00,204 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:19:00,205 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-09-11 20:19:00,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:19:00,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1041867770, now seen corresponding path program 1 times [2020-09-11 20:19:00,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:19:00,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570754123] [2020-09-11 20:19:00,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:19:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:19:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:19:00,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570754123] [2020-09-11 20:19:00,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622091656] [2020-09-11 20:19:00,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:19:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:19:00,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2020-09-11 20:19:00,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:19:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 20:19:00,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:19:00,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-09-11 20:19:00,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918758015] [2020-09-11 20:19:00,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 20:19:00,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:19:00,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 20:19:00,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-09-11 20:19:00,470 INFO L87 Difference]: Start difference. First operand 33981 states and 181710 transitions. Second operand 12 states. [2020-09-11 20:19:01,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:19:01,335 INFO L93 Difference]: Finished difference Result 82728 states and 398553 transitions. [2020-09-11 20:19:01,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:19:01,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-09-11 20:19:01,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:19:02,124 INFO L225 Difference]: With dead ends: 82728 [2020-09-11 20:19:02,124 INFO L226 Difference]: Without dead ends: 82673 [2020-09-11 20:19:02,124 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-09-11 20:19:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82673 states. [2020-09-11 20:19:03,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82673 to 34821. [2020-09-11 20:19:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34821 states. [2020-09-11 20:19:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 186422 transitions. [2020-09-11 20:19:04,129 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 186422 transitions. Word has length 23 [2020-09-11 20:19:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:19:04,129 INFO L479 AbstractCegarLoop]: Abstraction has 34821 states and 186422 transitions. [2020-09-11 20:19:04,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 20:19:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 186422 transitions. [2020-09-11 20:19:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 20:19:04,131 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:19:04,131 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:19:04,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:19:04,332 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-09-11 20:19:04,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:19:04,332 INFO L82 PathProgramCache]: Analyzing trace with hash -284839030, now seen corresponding path program 2 times [2020-09-11 20:19:04,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:19:04,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121145897] [2020-09-11 20:19:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:19:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:19:04,400 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:19:04,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121145897] [2020-09-11 20:19:04,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:19:04,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:19:04,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183057390] [2020-09-11 20:19:04,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:19:04,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:19:04,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:19:04,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:19:04,402 INFO L87 Difference]: Start difference. First operand 34821 states and 186422 transitions. Second operand 7 states. [2020-09-11 20:19:05,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:19:05,196 INFO L93 Difference]: Finished difference Result 83507 states and 402693 transitions. [2020-09-11 20:19:05,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:19:05,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-11 20:19:05,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:19:06,013 INFO L225 Difference]: With dead ends: 83507 [2020-09-11 20:19:06,013 INFO L226 Difference]: Without dead ends: 83452 [2020-09-11 20:19:06,013 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-09-11 20:19:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83452 states. [2020-09-11 20:19:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83452 to 35694. [2020-09-11 20:19:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35694 states. [2020-09-11 20:19:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35694 states to 35694 states and 191145 transitions. [2020-09-11 20:19:08,034 INFO L78 Accepts]: Start accepts. Automaton has 35694 states and 191145 transitions. Word has length 23 [2020-09-11 20:19:08,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:19:08,034 INFO L479 AbstractCegarLoop]: Abstraction has 35694 states and 191145 transitions. [2020-09-11 20:19:08,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:19:08,035 INFO L276 IsEmpty]: Start isEmpty. Operand 35694 states and 191145 transitions. [2020-09-11 20:19:08,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 20:19:08,036 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:19:08,037 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:19:08,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2020-09-11 20:19:08,037 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-09-11 20:19:08,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:19:08,037 INFO L82 PathProgramCache]: Analyzing trace with hash -284850438, now seen corresponding path program 2 times [2020-09-11 20:19:08,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:19:08,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447459323] [2020-09-11 20:19:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:19:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:19:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:19:08,105 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447459323] [2020-09-11 20:19:08,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:19:08,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:19:08,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850850928] [2020-09-11 20:19:08,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:19:08,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:19:08,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:19:08,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:19:08,107 INFO L87 Difference]: Start difference. First operand 35694 states and 191145 transitions. Second operand 7 states. [2020-09-11 20:19:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:19:08,972 INFO L93 Difference]: Finished difference Result 83523 states and 402462 transitions. [2020-09-11 20:19:08,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:19:08,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-11 20:19:08,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:19:09,814 INFO L225 Difference]: With dead ends: 83523 [2020-09-11 20:19:09,815 INFO L226 Difference]: Without dead ends: 83468 [2020-09-11 20:19:09,815 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-09-11 20:19:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83468 states. [2020-09-11 20:19:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83468 to 36306. [2020-09-11 20:19:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36306 states. [2020-09-11 20:19:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36306 states to 36306 states and 194552 transitions. [2020-09-11 20:19:11,783 INFO L78 Accepts]: Start accepts. Automaton has 36306 states and 194552 transitions. Word has length 23 [2020-09-11 20:19:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:19:11,783 INFO L479 AbstractCegarLoop]: Abstraction has 36306 states and 194552 transitions. [2020-09-11 20:19:11,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:19:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 36306 states and 194552 transitions. [2020-09-11 20:19:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 20:19:11,786 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:19:11,786 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:19:11,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2020-09-11 20:19:11,786 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-09-11 20:19:11,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:19:11,786 INFO L82 PathProgramCache]: Analyzing trace with hash -284866837, now seen corresponding path program 2 times [2020-09-11 20:19:11,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:19:11,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093514027] [2020-09-11 20:19:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:19:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:19:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 20:19:11,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093514027] [2020-09-11 20:19:11,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 20:19:11,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 20:19:11,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59292894] [2020-09-11 20:19:11,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 20:19:11,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:19:11,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 20:19:11,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 20:19:11,857 INFO L87 Difference]: Start difference. First operand 36306 states and 194552 transitions. Second operand 7 states. [2020-09-11 20:19:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:19:12,667 INFO L93 Difference]: Finished difference Result 83918 states and 404136 transitions. [2020-09-11 20:19:12,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 20:19:12,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-11 20:19:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:19:13,592 INFO L225 Difference]: With dead ends: 83918 [2020-09-11 20:19:13,592 INFO L226 Difference]: Without dead ends: 83863 [2020-09-11 20:19:13,592 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-09-11 20:19:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83863 states. [2020-09-11 20:19:15,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83863 to 37062. [2020-09-11 20:19:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37062 states. [2020-09-11 20:19:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37062 states to 37062 states and 198528 transitions. [2020-09-11 20:19:15,594 INFO L78 Accepts]: Start accepts. Automaton has 37062 states and 198528 transitions. Word has length 23 [2020-09-11 20:19:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:19:15,595 INFO L479 AbstractCegarLoop]: Abstraction has 37062 states and 198528 transitions. [2020-09-11 20:19:15,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 20:19:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 37062 states and 198528 transitions. [2020-09-11 20:19:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:19:15,598 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:19:15,598 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:19:15,598 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2020-09-11 20:19:15,598 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-09-11 20:19:15,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:19:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1146013160, now seen corresponding path program 1 times [2020-09-11 20:19:15,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:19:15,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017395818] [2020-09-11 20:19:15,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:19:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:19:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:19:15,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017395818] [2020-09-11 20:19:15,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570029452] [2020-09-11 20:19:15,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:19:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:19:15,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:19:15,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:19:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:19:15,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:19:15,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:19:15,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182601727] [2020-09-11 20:19:15,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:19:15,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:19:15,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:19:15,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:19:15,936 INFO L87 Difference]: Start difference. First operand 37062 states and 198528 transitions. Second operand 16 states. [2020-09-11 20:19:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:19:18,447 INFO L93 Difference]: Finished difference Result 122892 states and 561130 transitions. [2020-09-11 20:19:18,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:19:18,448 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:19:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:19:18,811 INFO L225 Difference]: With dead ends: 122892 [2020-09-11 20:19:18,812 INFO L226 Difference]: Without dead ends: 122862 [2020-09-11 20:19:18,812 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:19:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122862 states. [2020-09-11 20:19:24,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122862 to 36727. [2020-09-11 20:19:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36727 states. [2020-09-11 20:19:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36727 states to 36727 states and 196466 transitions. [2020-09-11 20:19:25,132 INFO L78 Accepts]: Start accepts. Automaton has 36727 states and 196466 transitions. Word has length 25 [2020-09-11 20:19:25,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:19:25,132 INFO L479 AbstractCegarLoop]: Abstraction has 36727 states and 196466 transitions. [2020-09-11 20:19:25,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:19:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 36727 states and 196466 transitions. [2020-09-11 20:19:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:19:25,135 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:19:25,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-09-11 20:19:25,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2020-09-11 20:19:25,336 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-09-11 20:19:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:19:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash -872185784, now seen corresponding path program 1 times [2020-09-11 20:19:25,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:19:25,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265757461] [2020-09-11 20:19:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:19:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:19:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:19:25,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265757461] [2020-09-11 20:19:25,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607993002] [2020-09-11 20:19:25,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:19:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:19:25,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:19:25,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:19:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 20:19:25,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:19:25,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:19:25,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676299274] [2020-09-11 20:19:25,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:19:25,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:19:25,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:19:25,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:19:25,631 INFO L87 Difference]: Start difference. First operand 36727 states and 196466 transitions. Second operand 16 states. [2020-09-11 20:19:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:19:27,637 INFO L93 Difference]: Finished difference Result 121590 states and 554657 transitions. [2020-09-11 20:19:27,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:19:27,638 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:19:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:19:27,996 INFO L225 Difference]: With dead ends: 121590 [2020-09-11 20:19:27,996 INFO L226 Difference]: Without dead ends: 121560 [2020-09-11 20:19:27,997 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:19:29,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121560 states. [2020-09-11 20:19:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121560 to 36513. [2020-09-11 20:19:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36513 states. [2020-09-11 20:19:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36513 states to 36513 states and 195090 transitions. [2020-09-11 20:19:31,222 INFO L78 Accepts]: Start accepts. Automaton has 36513 states and 195090 transitions. Word has length 25 [2020-09-11 20:19:31,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:19:31,222 INFO L479 AbstractCegarLoop]: Abstraction has 36513 states and 195090 transitions. [2020-09-11 20:19:31,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:19:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 36513 states and 195090 transitions. [2020-09-11 20:19:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:19:31,226 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:19:31,226 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:19:31,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 20:19:31,432 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-09-11 20:19:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:19:31,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2096074712, now seen corresponding path program 2 times [2020-09-11 20:19:31,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:19:31,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953651253] [2020-09-11 20:19:31,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:19:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:19:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 20:19:31,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953651253] [2020-09-11 20:19:31,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892281865] [2020-09-11 20:19:31,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:19:31,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 20:19:31,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:19:31,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:19:31,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:19:31,776 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 20:19:31,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:19:31,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:19:31,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848810719] [2020-09-11 20:19:31,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:19:31,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:19:31,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:19:31,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:19:31,778 INFO L87 Difference]: Start difference. First operand 36513 states and 195090 transitions. Second operand 16 states. [2020-09-11 20:19:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:19:33,658 INFO L93 Difference]: Finished difference Result 120395 states and 548664 transitions. [2020-09-11 20:19:33,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:19:33,658 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:19:33,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:19:34,010 INFO L225 Difference]: With dead ends: 120395 [2020-09-11 20:19:34,010 INFO L226 Difference]: Without dead ends: 120362 [2020-09-11 20:19:34,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:19:35,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120362 states. [2020-09-11 20:19:37,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120362 to 36444. [2020-09-11 20:19:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36444 states. [2020-09-11 20:19:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36444 states to 36444 states and 194571 transitions. [2020-09-11 20:19:37,287 INFO L78 Accepts]: Start accepts. Automaton has 36444 states and 194571 transitions. Word has length 25 [2020-09-11 20:19:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 20:19:37,287 INFO L479 AbstractCegarLoop]: Abstraction has 36444 states and 194571 transitions. [2020-09-11 20:19:37,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-11 20:19:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 36444 states and 194571 transitions. [2020-09-11 20:19:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 20:19:37,290 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 20:19:37,290 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 20:19:37,490 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2020-09-11 20:19:37,491 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-09-11 20:19:37,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 20:19:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash 2096063304, now seen corresponding path program 2 times [2020-09-11 20:19:37,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 20:19:37,492 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958919088] [2020-09-11 20:19:37,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 20:19:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 20:19:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 20:19:37,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958919088] [2020-09-11 20:19:37,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128475079] [2020-09-11 20:19:37,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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-09-11 20:19:37,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 20:19:37,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 20:19:37,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-09-11 20:19:37,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 20:19:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 20:19:37,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 20:19:37,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2020-09-11 20:19:37,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154844288] [2020-09-11 20:19:37,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-11 20:19:37,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 20:19:37,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-11 20:19:37,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-09-11 20:19:37,834 INFO L87 Difference]: Start difference. First operand 36444 states and 194571 transitions. Second operand 16 states. [2020-09-11 20:19:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 20:19:40,074 INFO L93 Difference]: Finished difference Result 119346 states and 543724 transitions. [2020-09-11 20:19:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 20:19:40,075 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-09-11 20:19:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 20:19:40,466 INFO L225 Difference]: With dead ends: 119346 [2020-09-11 20:19:40,466 INFO L226 Difference]: Without dead ends: 119313 [2020-09-11 20:19:40,466 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2020-09-11 20:19:41,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119313 states. Received shutdown request... [2020-09-11 20:19:45,719 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2020-09-11 20:19:45,720 WARN L544 AbstractCegarLoop]: Verification canceled [2020-09-11 20:19:45,725 WARN L228 ceAbstractionStarter]: Timeout [2020-09-11 20:19:45,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:19:45 BasicIcfg [2020-09-11 20:19:45,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-11 20:19:45,727 INFO L168 Benchmark]: Toolchain (without parser) took 227335.36 ms. Allocated memory was 138.4 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 98.8 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2020-09-11 20:19:45,727 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-11 20:19:45,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.93 ms. Allocated memory was 138.4 MB in the beginning and 199.2 MB in the end (delta: 60.8 MB). Free memory was 98.1 MB in the beginning and 158.2 MB in the end (delta: -60.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2020-09-11 20:19:45,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.55 ms. Allocated memory is still 199.2 MB. Free memory was 158.2 MB in the beginning and 156.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-09-11 20:19:45,728 INFO L168 Benchmark]: Boogie Preprocessor took 34.34 ms. Allocated memory is still 199.2 MB. Free memory was 156.3 MB in the beginning and 155.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-09-11 20:19:45,728 INFO L168 Benchmark]: RCFGBuilder took 462.11 ms. Allocated memory is still 199.2 MB. Free memory was 154.3 MB in the beginning and 134.3 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2020-09-11 20:19:45,729 INFO L168 Benchmark]: TraceAbstraction took 225973.85 ms. Allocated memory was 199.2 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 133.6 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2020-09-11 20:19:45,731 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.25 ms. Allocated memory is still 138.4 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.93 ms. Allocated memory was 138.4 MB in the beginning and 199.2 MB in the end (delta: 60.8 MB). Free memory was 98.1 MB in the beginning and 158.2 MB in the end (delta: -60.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.55 ms. Allocated memory is still 199.2 MB. Free memory was 158.2 MB in the beginning and 156.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.34 ms. Allocated memory is still 199.2 MB. Free memory was 156.3 MB in the beginning and 155.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 462.11 ms. Allocated memory is still 199.2 MB. Free memory was 154.3 MB in the beginning and 134.3 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225973.85 ms. Allocated memory was 199.2 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 133.6 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.1s, 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, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 486 CheckedPairsTotal, 51 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 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, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 942 CheckedPairsTotal, 62 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.1s, 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, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1426 CheckedPairsTotal, 74 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 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, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2033 CheckedPairsTotal, 86 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 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, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2999 CheckedPairsTotal, 104 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 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, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3678 CheckedPairsTotal, 113 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 678]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 678). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 55 locations, 1 error locations. Started 6 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 225.5s, OverallIterations: 102, TraceHistogramMax: 6, AutomataDifference: 91.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.8s, HoareTripleCheckerStatistics: 4465 SDtfs, 23841 SDslu, 15812 SDs, 0 SdLazy, 29918 SolverSat, 2118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2634 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 1990 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13581 ImplicationChecksByTransitivity, 26.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: 89.1s AutomataMinimizationTime, 97 MinimizatonAttempts, 1917805 StatesRemovedByMinimization, 89 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 2895 NumberOfCodeBlocks, 2867 NumberOfCodeBlocksAsserted, 168 NumberOfCheckSat, 2666 ConstructedInterpolants, 0 QuantifiedInterpolants, 338548 SizeOfPredicates, 232 NumberOfNonLiveVariables, 4921 ConjunctsInSsa, 364 ConjunctsInUnsatCore, 141 InterpolantComputations, 53 PerfectInterpolantSequences, 872/1544 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