/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-12 00:19:21,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-12 00:19:21,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-12 00:19:21,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-12 00:19:21,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-12 00:19:21,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-12 00:19:21,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-12 00:19:21,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-12 00:19:21,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-12 00:19:21,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-12 00:19:21,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-12 00:19:21,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-12 00:19:21,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-12 00:19:21,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-12 00:19:21,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-12 00:19:21,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-12 00:19:21,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-12 00:19:21,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-12 00:19:21,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-12 00:19:21,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-12 00:19:21,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-12 00:19:21,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-12 00:19:21,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-12 00:19:21,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-12 00:19:21,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-12 00:19:21,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-12 00:19:21,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-12 00:19:21,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-12 00:19:21,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-12 00:19:21,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-12 00:19:21,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-12 00:19:21,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-12 00:19:21,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-12 00:19:21,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-12 00:19:21,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-12 00:19:21,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-12 00:19:21,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-12 00:19:21,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-12 00:19:21,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-12 00:19:21,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-12 00:19:21,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-12 00:19:21,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-11-12 00:19:21,838 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-12 00:19:21,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-12 00:19:21,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-12 00:19:21,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-12 00:19:21,842 INFO L138 SettingsManager]: * Use SBE=true [2020-11-12 00:19:21,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-12 00:19:21,843 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-12 00:19:21,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-12 00:19:21,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-12 00:19:21,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-12 00:19:21,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-12 00:19:21,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-12 00:19:21,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-12 00:19:21,845 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-12 00:19:21,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-12 00:19:21,846 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-12 00:19:21,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-12 00:19:21,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-12 00:19:21,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-12 00:19:21,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-12 00:19:21,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-12 00:19:21,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-12 00:19:21,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-12 00:19:21,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-12 00:19:21,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-12 00:19:21,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-12 00:19:21,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-12 00:19:21,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-12 00:19:21,849 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-12 00:19:22,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-12 00:19:22,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-12 00:19:22,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-12 00:19:22,298 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-12 00:19:22,299 INFO L275 PluginConnector]: CDTParser initialized [2020-11-12 00:19:22,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2020-11-12 00:19:22,378 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d237d44/f0cc02e8b5ce49c0a786cbfde0ccde99/FLAG273b3c990 [2020-11-12 00:19:23,091 INFO L306 CDTParser]: Found 1 translation units. [2020-11-12 00:19:23,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2020-11-12 00:19:23,111 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d237d44/f0cc02e8b5ce49c0a786cbfde0ccde99/FLAG273b3c990 [2020-11-12 00:19:23,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d237d44/f0cc02e8b5ce49c0a786cbfde0ccde99 [2020-11-12 00:19:23,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-12 00:19:23,303 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-12 00:19:23,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-12 00:19:23,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-12 00:19:23,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-12 00:19:23,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:19:23" (1/1) ... [2020-11-12 00:19:23,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345e29df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:19:23, skipping insertion in model container [2020-11-12 00:19:23,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:19:23" (1/1) ... [2020-11-12 00:19:23,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-12 00:19:23,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-12 00:19:23,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 00:19:23,807 INFO L203 MainTranslator]: Completed pre-run [2020-11-12 00:19:23,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 00:19:23,936 INFO L208 MainTranslator]: Completed translation [2020-11-12 00:19:23,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:19:23 WrapperNode [2020-11-12 00:19:23,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-12 00:19:23,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-12 00:19:23,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-12 00:19:23,938 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-12 00:19:23,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:19:23" (1/1) ... [2020-11-12 00:19:23,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:19:23" (1/1) ... [2020-11-12 00:19:24,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-12 00:19:24,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-12 00:19:24,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-12 00:19:24,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-12 00:19:24,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:19:23" (1/1) ... [2020-11-12 00:19:24,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:19:23" (1/1) ... [2020-11-12 00:19:24,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:19:23" (1/1) ... [2020-11-12 00:19:24,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:19:23" (1/1) ... [2020-11-12 00:19:24,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:19:23" (1/1) ... [2020-11-12 00:19:24,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:19:23" (1/1) ... [2020-11-12 00:19:24,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:19:23" (1/1) ... [2020-11-12 00:19:24,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-12 00:19:24,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-12 00:19:24,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-12 00:19:24,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-12 00:19:24,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:19:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-12 00:19:24,154 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-11-12 00:19:24,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-11-12 00:19:24,154 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-11-12 00:19:24,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-11-12 00:19:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-12 00:19:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-12 00:19:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-12 00:19:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-12 00:19:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-12 00:19:24,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-12 00:19:24,157 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-12 00:19:24,469 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-12 00:19:24,469 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-11-12 00:19:24,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:19:24 BoogieIcfgContainer [2020-11-12 00:19:24,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-12 00:19:24,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-12 00:19:24,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-12 00:19:24,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-12 00:19:24,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:19:23" (1/3) ... [2020-11-12 00:19:24,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305e53a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:19:24, skipping insertion in model container [2020-11-12 00:19:24,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:19:23" (2/3) ... [2020-11-12 00:19:24,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305e53a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:19:24, skipping insertion in model container [2020-11-12 00:19:24,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:19:24" (3/3) ... [2020-11-12 00:19:24,480 INFO L111 eAbstractionObserver]: Analyzing ICFG fkp2013-1.i [2020-11-12 00:19:24,496 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-12 00:19:24,496 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-12 00:19:24,499 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-12 00:19:24,500 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-12 00:19:24,529 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,529 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,530 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,530 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,530 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,530 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,530 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,531 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,531 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,531 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,531 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,532 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,532 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,532 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,532 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,532 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,533 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,533 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,534 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,534 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,535 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,535 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,536 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,536 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,537 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,537 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,538 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,538 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,539 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,540 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,543 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,543 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,544 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,544 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,553 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,553 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,553 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,553 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,554 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:24,556 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-12 00:19:24,566 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-11-12 00:19:24,589 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 00:19:24,590 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 00:19:24,590 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 00:19:24,590 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 00:19:24,590 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 00:19:24,590 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 00:19:24,590 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 00:19:24,590 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 00:19:24,602 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-12 00:19:24,604 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 60 transitions, 130 flow [2020-11-12 00:19:24,608 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 60 transitions, 130 flow [2020-11-12 00:19:24,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 60 transitions, 130 flow [2020-11-12 00:19:24,655 INFO L129 PetriNetUnfolder]: 4/70 cut-off events. [2020-11-12 00:19:24,656 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-12 00:19:24,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 70 events. 4/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 119 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2020-11-12 00:19:24,665 INFO L116 LiptonReduction]: Number of co-enabled transitions 942 [2020-11-12 00:19:26,877 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-11-12 00:19:26,983 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-12 00:19:27,220 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-11-12 00:19:27,582 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2020-11-12 00:19:27,710 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-12 00:19:27,997 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2020-11-12 00:19:28,123 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-12 00:19:28,126 INFO L131 LiptonReduction]: Checked pairs total: 836 [2020-11-12 00:19:28,127 INFO L133 LiptonReduction]: Total number of compositions: 56 [2020-11-12 00:19:28,135 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-11-12 00:19:28,145 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 44 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 43 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 43 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:28,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-12 00:19:28,151 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:28,152 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-12 00:19:28,152 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-11-12 00:19:28,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash 243469, now seen corresponding path program 1 times [2020-11-12 00:19:28,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:28,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021283484] [2020-11-12 00:19:28,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:19:28,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021283484] [2020-11-12 00:19:28,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:28,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-12 00:19:28,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525619603] [2020-11-12 00:19:28,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:19:28,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:28,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:19:28,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:19:28,379 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 43 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:28,414 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-11-12 00:19:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:19:28,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2020-11-12 00:19:28,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:28,426 INFO L225 Difference]: With dead ends: 35 [2020-11-12 00:19:28,426 INFO L226 Difference]: Without dead ends: 31 [2020-11-12 00:19:28,427 INFO L749 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-11-12 00:19:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-11-12 00:19:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-11-12 00:19:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-11-12 00:19:28,466 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-11-12 00:19:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:28,467 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-11-12 00:19:28,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-11-12 00:19:28,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-12 00:19:28,468 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:28,468 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:28,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-12 00:19:28,468 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-11-12 00:19:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:28,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1481967218, now seen corresponding path program 1 times [2020-11-12 00:19:28,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:28,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133607564] [2020-11-12 00:19:28,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:19:28,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133607564] [2020-11-12 00:19:28,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:28,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-12 00:19:28,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874112564] [2020-11-12 00:19:28,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-12 00:19:28,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:28,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-12 00:19:28,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-12 00:19:28,582 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:28,609 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-11-12 00:19:28,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-12 00:19:28,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2020-11-12 00:19:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:28,611 INFO L225 Difference]: With dead ends: 26 [2020-11-12 00:19:28,611 INFO L226 Difference]: Without dead ends: 24 [2020-11-12 00:19:28,612 INFO L749 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-11-12 00:19:28,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-11-12 00:19:28,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-11-12 00:19:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-11-12 00:19:28,620 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-11-12 00:19:28,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:28,621 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-11-12 00:19:28,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:28,622 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-11-12 00:19:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-12 00:19:28,623 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:28,623 INFO L494 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:28,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-12 00:19:28,624 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-11-12 00:19:28,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:28,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1303671559, now seen corresponding path program 1 times [2020-11-12 00:19:28,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:28,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511083555] [2020-11-12 00:19:28,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 00:19:28,695 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 00:19:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 00:19:28,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 00:19:28,749 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-12 00:19:28,750 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-12 00:19:28,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-12 00:19:28,750 WARN L386 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-11-12 00:19:28,751 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-11-12 00:19:28,760 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,760 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,761 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,761 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,761 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,762 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,763 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,763 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,763 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,763 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,763 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,763 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,764 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,764 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,764 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,764 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,764 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,764 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,764 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,765 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,765 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,765 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,765 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,765 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,765 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,765 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,766 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,766 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,767 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,767 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,768 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,768 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,769 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,769 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,770 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,770 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,771 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,772 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,772 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,773 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,773 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,774 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,774 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,775 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,775 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,776 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,777 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,778 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,778 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,779 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,779 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,780 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,781 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,781 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,782 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,783 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,783 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,783 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,783 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,784 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,785 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,785 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,785 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,785 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,785 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:28,786 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-12 00:19:28,787 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-12 00:19:28,788 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 00:19:28,788 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 00:19:28,788 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 00:19:28,788 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 00:19:28,788 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 00:19:28,788 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 00:19:28,789 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 00:19:28,789 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 00:19:28,791 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-12 00:19:28,791 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 83 transitions, 190 flow [2020-11-12 00:19:28,792 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 83 transitions, 190 flow [2020-11-12 00:19:28,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 83 transitions, 190 flow [2020-11-12 00:19:28,814 INFO L129 PetriNetUnfolder]: 5/92 cut-off events. [2020-11-12 00:19:28,814 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-11-12 00:19:28,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 92 events. 5/92 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 166 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 101. Up to 6 conditions per place. [2020-11-12 00:19:28,825 INFO L116 LiptonReduction]: Number of co-enabled transitions 1428 [2020-11-12 00:19:32,418 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2020-11-12 00:19:32,552 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-12 00:19:32,852 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2020-11-12 00:19:32,976 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-12 00:19:33,020 INFO L131 LiptonReduction]: Checked pairs total: 1892 [2020-11-12 00:19:33,020 INFO L133 LiptonReduction]: Total number of compositions: 87 [2020-11-12 00:19:33,021 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 21 transitions, 66 flow [2020-11-12 00:19:33,037 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 224 states, 216 states have (on average 2.736111111111111) internal successors, (591), 223 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 224 states, 216 states have (on average 2.736111111111111) internal successors, (591), 223 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:33,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-12 00:19:33,039 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:33,039 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-12 00:19:33,039 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:19:33,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:33,040 INFO L82 PathProgramCache]: Analyzing trace with hash 428308, now seen corresponding path program 1 times [2020-11-12 00:19:33,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:33,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797374592] [2020-11-12 00:19:33,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:19:33,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797374592] [2020-11-12 00:19:33,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:33,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-12 00:19:33,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800054352] [2020-11-12 00:19:33,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:19:33,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:33,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:19:33,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:19:33,084 INFO L87 Difference]: Start difference. First operand has 224 states, 216 states have (on average 2.736111111111111) internal successors, (591), 223 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:33,114 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2020-11-12 00:19:33,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:19:33,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2020-11-12 00:19:33,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:33,119 INFO L225 Difference]: With dead ends: 185 [2020-11-12 00:19:33,119 INFO L226 Difference]: Without dead ends: 171 [2020-11-12 00:19:33,120 INFO L749 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-11-12 00:19:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-11-12 00:19:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-11-12 00:19:33,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 2.502994011976048) internal successors, (418), 170 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 418 transitions. [2020-11-12 00:19:33,147 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 418 transitions. Word has length 3 [2020-11-12 00:19:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:33,148 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 418 transitions. [2020-11-12 00:19:33,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 418 transitions. [2020-11-12 00:19:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-12 00:19:33,149 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:33,149 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:33,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-12 00:19:33,149 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:19:33,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:33,150 INFO L82 PathProgramCache]: Analyzing trace with hash -654958418, now seen corresponding path program 1 times [2020-11-12 00:19:33,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:33,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140820751] [2020-11-12 00:19:33,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:19:33,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140820751] [2020-11-12 00:19:33,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:33,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:19:33,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908764749] [2020-11-12 00:19:33,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:19:33,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:33,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:19:33,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:19:33,229 INFO L87 Difference]: Start difference. First operand 171 states and 418 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:33,315 INFO L93 Difference]: Finished difference Result 205 states and 460 transitions. [2020-11-12 00:19:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:19:33,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2020-11-12 00:19:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:33,320 INFO L225 Difference]: With dead ends: 205 [2020-11-12 00:19:33,320 INFO L226 Difference]: Without dead ends: 201 [2020-11-12 00:19:33,321 INFO L749 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-11-12 00:19:33,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-11-12 00:19:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2020-11-12 00:19:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 159 states have (on average 2.509433962264151) internal successors, (399), 161 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2020-11-12 00:19:33,347 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2020-11-12 00:19:33,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:33,347 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2020-11-12 00:19:33,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2020-11-12 00:19:33,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-12 00:19:33,349 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:33,349 INFO L494 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:33,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-12 00:19:33,349 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:19:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:33,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1012131376, now seen corresponding path program 1 times [2020-11-12 00:19:33,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:33,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325968933] [2020-11-12 00:19:33,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:19:33,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325968933] [2020-11-12 00:19:33,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:33,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:19:33,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574414432] [2020-11-12 00:19:33,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:19:33,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:33,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:19:33,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:19:33,434 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:33,517 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2020-11-12 00:19:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:19:33,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2020-11-12 00:19:33,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:33,521 INFO L225 Difference]: With dead ends: 189 [2020-11-12 00:19:33,521 INFO L226 Difference]: Without dead ends: 185 [2020-11-12 00:19:33,521 INFO L749 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-11-12 00:19:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-11-12 00:19:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2020-11-12 00:19:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 150 states have (on average 2.4466666666666668) internal successors, (367), 152 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2020-11-12 00:19:33,539 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2020-11-12 00:19:33,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:33,540 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2020-11-12 00:19:33,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2020-11-12 00:19:33,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-12 00:19:33,542 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:33,542 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:33,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-12 00:19:33,542 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:19:33,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:33,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1307733960, now seen corresponding path program 1 times [2020-11-12 00:19:33,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:33,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657349427] [2020-11-12 00:19:33,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 00:19:33,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 00:19:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 00:19:33,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 00:19:33,588 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-12 00:19:33,588 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-12 00:19:33,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-12 00:19:33,588 WARN L386 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-11-12 00:19:33,590 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-11-12 00:19:33,605 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,605 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,605 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,605 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,606 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,606 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,606 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,606 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,606 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,606 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,606 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,607 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,607 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,607 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,607 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,607 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,607 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,607 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,608 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,608 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,608 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,608 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,608 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,609 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,609 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,609 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,609 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,609 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,609 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,609 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,610 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,610 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,610 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,610 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,610 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,610 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,611 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,611 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,611 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,611 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,611 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,612 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,612 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,612 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,612 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,612 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,612 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,613 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,613 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,613 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,613 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,613 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,613 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,614 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,614 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,614 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,615 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,615 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,616 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,616 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,617 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,617 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,619 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,620 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,621 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,622 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,622 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,623 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,624 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,625 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,625 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,626 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,626 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,627 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,627 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,628 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,629 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,630 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,630 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,631 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,631 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,633 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,634 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,634 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,635 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,640 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,641 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,641 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,642 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,643 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,643 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,644 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,644 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,644 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,645 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,645 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,646 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,646 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,646 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,647 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,647 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,648 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,648 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,648 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:33,649 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-12 00:19:33,649 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-12 00:19:33,650 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 00:19:33,650 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 00:19:33,650 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 00:19:33,651 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 00:19:33,651 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 00:19:33,651 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 00:19:33,651 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 00:19:33,651 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 00:19:33,653 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-12 00:19:33,653 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 106 transitions, 254 flow [2020-11-12 00:19:33,654 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 106 transitions, 254 flow [2020-11-12 00:19:33,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 106 transitions, 254 flow [2020-11-12 00:19:33,699 INFO L129 PetriNetUnfolder]: 6/114 cut-off events. [2020-11-12 00:19:33,699 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-11-12 00:19:33,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 114 events. 6/114 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 198 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 128. Up to 8 conditions per place. [2020-11-12 00:19:33,708 INFO L116 LiptonReduction]: Number of co-enabled transitions 1998 [2020-11-12 00:19:36,952 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-12 00:19:37,074 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-11-12 00:19:37,213 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-12 00:19:37,332 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-11-12 00:19:37,797 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-12 00:19:37,927 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-12 00:19:38,058 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-12 00:19:38,190 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-12 00:19:38,616 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2020-11-12 00:19:38,748 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-12 00:19:39,049 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2020-11-12 00:19:39,176 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-12 00:19:39,180 INFO L131 LiptonReduction]: Checked pairs total: 2879 [2020-11-12 00:19:39,181 INFO L133 LiptonReduction]: Total number of compositions: 111 [2020-11-12 00:19:39,181 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 27 transitions, 96 flow [2020-11-12 00:19:39,215 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 683 states, 673 states have (on average 3.325408618127786) internal successors, (2238), 682 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 683 states, 673 states have (on average 3.325408618127786) internal successors, (2238), 682 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:39,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-12 00:19:39,218 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:39,218 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-12 00:19:39,218 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:19:39,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:39,219 INFO L82 PathProgramCache]: Analyzing trace with hash 671600, now seen corresponding path program 1 times [2020-11-12 00:19:39,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:39,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841643398] [2020-11-12 00:19:39,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:19:39,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841643398] [2020-11-12 00:19:39,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:39,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-12 00:19:39,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710900474] [2020-11-12 00:19:39,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:19:39,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:39,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:19:39,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:19:39,250 INFO L87 Difference]: Start difference. First operand has 683 states, 673 states have (on average 3.325408618127786) internal successors, (2238), 682 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:39,285 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2020-11-12 00:19:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:19:39,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2020-11-12 00:19:39,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:39,292 INFO L225 Difference]: With dead ends: 600 [2020-11-12 00:19:39,292 INFO L226 Difference]: Without dead ends: 559 [2020-11-12 00:19:39,293 INFO L749 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-11-12 00:19:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-11-12 00:19:39,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2020-11-12 00:19:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 554 states have (on average 3.1353790613718413) internal successors, (1737), 558 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1737 transitions. [2020-11-12 00:19:39,377 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1737 transitions. Word has length 3 [2020-11-12 00:19:39,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:39,378 INFO L481 AbstractCegarLoop]: Abstraction has 559 states and 1737 transitions. [2020-11-12 00:19:39,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1737 transitions. [2020-11-12 00:19:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-12 00:19:39,379 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:39,379 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:39,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-12 00:19:39,380 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:19:39,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1624290378, now seen corresponding path program 1 times [2020-11-12 00:19:39,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:39,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128154839] [2020-11-12 00:19:39,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:19:39,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128154839] [2020-11-12 00:19:39,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:39,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:19:39,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251295411] [2020-11-12 00:19:39,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:19:39,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:39,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:19:39,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:19:39,467 INFO L87 Difference]: Start difference. First operand 559 states and 1737 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:39,570 INFO L93 Difference]: Finished difference Result 817 states and 2317 transitions. [2020-11-12 00:19:39,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:19:39,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2020-11-12 00:19:39,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:39,581 INFO L225 Difference]: With dead ends: 817 [2020-11-12 00:19:39,581 INFO L226 Difference]: Without dead ends: 812 [2020-11-12 00:19:39,581 INFO L749 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-11-12 00:19:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-11-12 00:19:39,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 585. [2020-11-12 00:19:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 3.153184165232358) internal successors, (1832), 584 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1832 transitions. [2020-11-12 00:19:39,616 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1832 transitions. Word has length 9 [2020-11-12 00:19:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:39,616 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 1832 transitions. [2020-11-12 00:19:39,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1832 transitions. [2020-11-12 00:19:39,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-12 00:19:39,623 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:39,623 INFO L494 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:39,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-12 00:19:39,623 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:19:39,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:39,623 INFO L82 PathProgramCache]: Analyzing trace with hash 377898121, now seen corresponding path program 1 times [2020-11-12 00:19:39,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:39,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429723883] [2020-11-12 00:19:39,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:19:39,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429723883] [2020-11-12 00:19:39,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:39,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:19:39,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640881698] [2020-11-12 00:19:39,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:19:39,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:39,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:19:39,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:19:39,698 INFO L87 Difference]: Start difference. First operand 585 states and 1832 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:39,780 INFO L93 Difference]: Finished difference Result 843 states and 2406 transitions. [2020-11-12 00:19:39,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:19:39,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2020-11-12 00:19:39,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:39,788 INFO L225 Difference]: With dead ends: 843 [2020-11-12 00:19:39,788 INFO L226 Difference]: Without dead ends: 836 [2020-11-12 00:19:39,788 INFO L749 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-11-12 00:19:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-11-12 00:19:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 611. [2020-11-12 00:19:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 607 states have (on average 3.14003294892916) internal successors, (1906), 610 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1906 transitions. [2020-11-12 00:19:39,824 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1906 transitions. Word has length 13 [2020-11-12 00:19:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:39,824 INFO L481 AbstractCegarLoop]: Abstraction has 611 states and 1906 transitions. [2020-11-12 00:19:39,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1906 transitions. [2020-11-12 00:19:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:19:39,827 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:39,827 INFO L494 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:39,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-12 00:19:39,827 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:19:39,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:39,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1176628986, now seen corresponding path program 1 times [2020-11-12 00:19:39,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:39,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868259194] [2020-11-12 00:19:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:19:39,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868259194] [2020-11-12 00:19:39,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845378164] [2020-11-12 00:19:39,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:19:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:40,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-12 00:19:40,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:19:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:19:40,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:19:40,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-11-12 00:19:40,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549557863] [2020-11-12 00:19:40,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:19:40,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:19:40,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:19:40,224 INFO L87 Difference]: Start difference. First operand 611 states and 1906 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:40,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:40,428 INFO L93 Difference]: Finished difference Result 1059 states and 2818 transitions. [2020-11-12 00:19:40,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:19:40,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:19:40,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:40,437 INFO L225 Difference]: With dead ends: 1059 [2020-11-12 00:19:40,437 INFO L226 Difference]: Without dead ends: 1052 [2020-11-12 00:19:40,438 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-11-12 00:19:40,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-11-12 00:19:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 591. [2020-11-12 00:19:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 587 states have (on average 3.13458262350937) internal successors, (1840), 590 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1840 transitions. [2020-11-12 00:19:40,471 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1840 transitions. Word has length 15 [2020-11-12 00:19:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:40,471 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 1840 transitions. [2020-11-12 00:19:40,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1840 transitions. [2020-11-12 00:19:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:19:40,472 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:40,472 INFO L494 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:40,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-11-12 00:19:40,687 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:19:40,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:40,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1912136186, now seen corresponding path program 2 times [2020-11-12 00:19:40,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:40,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156497195] [2020-11-12 00:19:40,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:19:40,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156497195] [2020-11-12 00:19:40,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:40,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:19:40,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483974121] [2020-11-12 00:19:40,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:19:40,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:40,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:19:40,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:19:40,793 INFO L87 Difference]: Start difference. First operand 591 states and 1840 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:41,002 INFO L93 Difference]: Finished difference Result 1053 states and 2807 transitions. [2020-11-12 00:19:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:19:41,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:19:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:41,011 INFO L225 Difference]: With dead ends: 1053 [2020-11-12 00:19:41,011 INFO L226 Difference]: Without dead ends: 1045 [2020-11-12 00:19:41,012 INFO L749 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-11-12 00:19:41,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-11-12 00:19:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2020-11-12 00:19:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 533 states have (on average 3.1669793621013134) internal successors, (1688), 535 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2020-11-12 00:19:41,041 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2020-11-12 00:19:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:41,041 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2020-11-12 00:19:41,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2020-11-12 00:19:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-12 00:19:41,042 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:41,043 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:41,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-12 00:19:41,043 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:19:41,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:41,043 INFO L82 PathProgramCache]: Analyzing trace with hash -88272074, now seen corresponding path program 1 times [2020-11-12 00:19:41,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:41,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897335841] [2020-11-12 00:19:41,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:19:41,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897335841] [2020-11-12 00:19:41,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:41,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:19:41,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208354833] [2020-11-12 00:19:41,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:19:41,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:41,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:19:41,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:19:41,118 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:41,202 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2020-11-12 00:19:41,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:19:41,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2020-11-12 00:19:41,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:41,208 INFO L225 Difference]: With dead ends: 736 [2020-11-12 00:19:41,208 INFO L226 Difference]: Without dead ends: 728 [2020-11-12 00:19:41,209 INFO L749 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-11-12 00:19:41,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-11-12 00:19:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2020-11-12 00:19:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 546 states have (on average 3.0842490842490844) internal successors, (1684), 548 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2020-11-12 00:19:41,233 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2020-11-12 00:19:41,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:41,233 INFO L481 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2020-11-12 00:19:41,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2020-11-12 00:19:41,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-12 00:19:41,234 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:41,235 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:41,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-12 00:19:41,235 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:19:41,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:41,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1553733808, now seen corresponding path program 1 times [2020-11-12 00:19:41,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:41,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097862753] [2020-11-12 00:19:41,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 00:19:41,254 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 00:19:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 00:19:41,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 00:19:41,280 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-12 00:19:41,280 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-12 00:19:41,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-12 00:19:41,281 WARN L386 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-11-12 00:19:41,281 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-11-12 00:19:41,307 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,308 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,308 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,308 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,308 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,308 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,308 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,308 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,308 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,314 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,314 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,314 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,315 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,315 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,315 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,315 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,315 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,315 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,315 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,315 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,316 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,316 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,316 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,316 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,316 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,316 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,316 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,316 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,316 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,316 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,317 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,317 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,317 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,317 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,317 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,317 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,317 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,318 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,318 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,318 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,318 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,318 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,318 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,318 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,318 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,318 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,319 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,319 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,319 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,319 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,319 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,319 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,319 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,319 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,320 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,320 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,321 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,321 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,321 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,321 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,321 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,321 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,321 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,321 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,321 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,321 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,322 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,322 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,322 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,322 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,322 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,322 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,335 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,345 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,348 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,348 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,348 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,348 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,348 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,350 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,350 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,350 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,350 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,350 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,352 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,352 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,352 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,352 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,352 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,353 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,353 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,354 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,354 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,354 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:41,355 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-12 00:19:41,355 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-12 00:19:41,356 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 00:19:41,356 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 00:19:41,356 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 00:19:41,356 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 00:19:41,357 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 00:19:41,357 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 00:19:41,357 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 00:19:41,357 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 00:19:41,360 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-12 00:19:41,360 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 129 transitions, 322 flow [2020-11-12 00:19:41,360 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 129 transitions, 322 flow [2020-11-12 00:19:41,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 138 places, 129 transitions, 322 flow [2020-11-12 00:19:41,404 INFO L129 PetriNetUnfolder]: 7/136 cut-off events. [2020-11-12 00:19:41,404 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-11-12 00:19:41,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 136 events. 7/136 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 235 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 156. Up to 10 conditions per place. [2020-11-12 00:19:41,411 INFO L116 LiptonReduction]: Number of co-enabled transitions 2652 [2020-11-12 00:19:44,913 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-11-12 00:19:45,099 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-11-12 00:19:46,093 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2020-11-12 00:19:46,231 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-12 00:19:46,533 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2020-11-12 00:19:46,659 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-12 00:19:46,835 INFO L131 LiptonReduction]: Checked pairs total: 3955 [2020-11-12 00:19:46,835 INFO L133 LiptonReduction]: Total number of compositions: 142 [2020-11-12 00:19:46,835 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 33 transitions, 130 flow [2020-11-12 00:19:46,989 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2060 states, 2048 states have (on average 3.95361328125) internal successors, (8097), 2059 states have internal predecessors, (8097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:46,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 2060 states, 2048 states have (on average 3.95361328125) internal successors, (8097), 2059 states have internal predecessors, (8097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-12 00:19:46,997 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:46,997 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-12 00:19:46,997 INFO L429 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-11-12 00:19:46,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:46,998 INFO L82 PathProgramCache]: Analyzing trace with hash 950957, now seen corresponding path program 1 times [2020-11-12 00:19:46,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:46,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330620198] [2020-11-12 00:19:46,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:19:47,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330620198] [2020-11-12 00:19:47,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:47,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-12 00:19:47,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927861665] [2020-11-12 00:19:47,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:19:47,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:47,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:19:47,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:19:47,037 INFO L87 Difference]: Start difference. First operand has 2060 states, 2048 states have (on average 3.95361328125) internal successors, (8097), 2059 states have internal predecessors, (8097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:47,079 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2020-11-12 00:19:47,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:19:47,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2020-11-12 00:19:47,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:47,098 INFO L225 Difference]: With dead ends: 1889 [2020-11-12 00:19:47,098 INFO L226 Difference]: Without dead ends: 1767 [2020-11-12 00:19:47,098 INFO L749 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-11-12 00:19:47,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2020-11-12 00:19:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2020-11-12 00:19:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1761 states have (on average 3.798977853492334) internal successors, (6690), 1766 states have internal predecessors, (6690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 6690 transitions. [2020-11-12 00:19:47,190 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 6690 transitions. Word has length 3 [2020-11-12 00:19:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:47,191 INFO L481 AbstractCegarLoop]: Abstraction has 1767 states and 6690 transitions. [2020-11-12 00:19:47,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 6690 transitions. [2020-11-12 00:19:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-12 00:19:47,191 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:47,191 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:47,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-12 00:19:47,192 INFO L429 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-11-12 00:19:47,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:47,192 INFO L82 PathProgramCache]: Analyzing trace with hash -583405114, now seen corresponding path program 1 times [2020-11-12 00:19:47,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:47,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745952456] [2020-11-12 00:19:47,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:19:47,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745952456] [2020-11-12 00:19:47,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:47,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:19:47,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169879679] [2020-11-12 00:19:47,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:19:47,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:47,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:19:47,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:19:47,232 INFO L87 Difference]: Start difference. First operand 1767 states and 6690 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:47,336 INFO L93 Difference]: Finished difference Result 2905 states and 10138 transitions. [2020-11-12 00:19:47,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:19:47,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2020-11-12 00:19:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:47,362 INFO L225 Difference]: With dead ends: 2905 [2020-11-12 00:19:47,362 INFO L226 Difference]: Without dead ends: 2899 [2020-11-12 00:19:47,363 INFO L749 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-11-12 00:19:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-11-12 00:19:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1966. [2020-11-12 00:19:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1961 states have (on average 3.8261091279959203) internal successors, (7503), 1965 states have internal predecessors, (7503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 7503 transitions. [2020-11-12 00:19:47,497 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 7503 transitions. Word has length 9 [2020-11-12 00:19:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:47,497 INFO L481 AbstractCegarLoop]: Abstraction has 1966 states and 7503 transitions. [2020-11-12 00:19:47,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 7503 transitions. [2020-11-12 00:19:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-12 00:19:47,498 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:47,499 INFO L494 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:47,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-12 00:19:47,499 INFO L429 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-11-12 00:19:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:47,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1890638603, now seen corresponding path program 1 times [2020-11-12 00:19:47,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:47,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769509204] [2020-11-12 00:19:47,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:19:47,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769509204] [2020-11-12 00:19:47,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:47,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:19:47,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467663324] [2020-11-12 00:19:47,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:19:47,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:47,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:19:47,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:19:47,544 INFO L87 Difference]: Start difference. First operand 1966 states and 7503 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:47,651 INFO L93 Difference]: Finished difference Result 3204 states and 11312 transitions. [2020-11-12 00:19:47,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:19:47,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2020-11-12 00:19:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:47,682 INFO L225 Difference]: With dead ends: 3204 [2020-11-12 00:19:47,682 INFO L226 Difference]: Without dead ends: 3194 [2020-11-12 00:19:47,683 INFO L749 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-11-12 00:19:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2020-11-12 00:19:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2200. [2020-11-12 00:19:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2200 states, 2195 states have (on average 3.8510250569476083) internal successors, (8453), 2199 states have internal predecessors, (8453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 8453 transitions. [2020-11-12 00:19:47,817 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 8453 transitions. Word has length 13 [2020-11-12 00:19:47,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:47,818 INFO L481 AbstractCegarLoop]: Abstraction has 2200 states and 8453 transitions. [2020-11-12 00:19:47,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 8453 transitions. [2020-11-12 00:19:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:19:47,819 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:47,819 INFO L494 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:47,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-12 00:19:47,819 INFO L429 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-11-12 00:19:47,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:47,819 INFO L82 PathProgramCache]: Analyzing trace with hash 132539460, now seen corresponding path program 1 times [2020-11-12 00:19:47,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:47,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863904560] [2020-11-12 00:19:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:19:47,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863904560] [2020-11-12 00:19:47,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:47,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:19:47,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801467572] [2020-11-12 00:19:47,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:19:47,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:47,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:19:47,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:19:47,877 INFO L87 Difference]: Start difference. First operand 2200 states and 8453 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:48,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:48,129 INFO L93 Difference]: Finished difference Result 4556 states and 14911 transitions. [2020-11-12 00:19:48,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:19:48,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:19:48,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:48,157 INFO L225 Difference]: With dead ends: 4556 [2020-11-12 00:19:48,157 INFO L226 Difference]: Without dead ends: 4546 [2020-11-12 00:19:48,158 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:19:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2020-11-12 00:19:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2157. [2020-11-12 00:19:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 2152 states have (on average 3.846654275092937) internal successors, (8278), 2156 states have internal predecessors, (8278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 8278 transitions. [2020-11-12 00:19:48,300 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 8278 transitions. Word has length 15 [2020-11-12 00:19:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:48,300 INFO L481 AbstractCegarLoop]: Abstraction has 2157 states and 8278 transitions. [2020-11-12 00:19:48,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 8278 transitions. [2020-11-12 00:19:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:19:48,301 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:48,301 INFO L494 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:48,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-12 00:19:48,301 INFO L429 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-11-12 00:19:48,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:48,302 INFO L82 PathProgramCache]: Analyzing trace with hash 151883460, now seen corresponding path program 2 times [2020-11-12 00:19:48,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:48,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977442156] [2020-11-12 00:19:48,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:19:48,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977442156] [2020-11-12 00:19:48,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:48,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:19:48,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553922807] [2020-11-12 00:19:48,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:19:48,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:48,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:19:48,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:19:48,354 INFO L87 Difference]: Start difference. First operand 2157 states and 8278 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:48,653 INFO L93 Difference]: Finished difference Result 4612 states and 15111 transitions. [2020-11-12 00:19:48,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:19:48,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:19:48,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:48,674 INFO L225 Difference]: With dead ends: 4612 [2020-11-12 00:19:48,674 INFO L226 Difference]: Without dead ends: 4601 [2020-11-12 00:19:48,675 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:19:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2020-11-12 00:19:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 2035. [2020-11-12 00:19:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 2031 states have (on average 3.862629246676514) internal successors, (7845), 2034 states have internal predecessors, (7845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 7845 transitions. [2020-11-12 00:19:48,817 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 7845 transitions. Word has length 15 [2020-11-12 00:19:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:48,817 INFO L481 AbstractCegarLoop]: Abstraction has 2035 states and 7845 transitions. [2020-11-12 00:19:48,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 7845 transitions. [2020-11-12 00:19:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-12 00:19:48,818 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:48,819 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:48,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-12 00:19:48,819 INFO L429 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-11-12 00:19:48,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:48,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2054803444, now seen corresponding path program 1 times [2020-11-12 00:19:48,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:48,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898034689] [2020-11-12 00:19:48,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:48,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:19:48,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898034689] [2020-11-12 00:19:48,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:48,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:19:48,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691019062] [2020-11-12 00:19:48,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:19:48,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:48,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:19:48,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:19:48,870 INFO L87 Difference]: Start difference. First operand 2035 states and 7845 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:48,975 INFO L93 Difference]: Finished difference Result 3265 states and 11681 transitions. [2020-11-12 00:19:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:19:48,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2020-11-12 00:19:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:48,990 INFO L225 Difference]: With dead ends: 3265 [2020-11-12 00:19:48,990 INFO L226 Difference]: Without dead ends: 3250 [2020-11-12 00:19:48,991 INFO L749 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-11-12 00:19:49,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-11-12 00:19:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2281. [2020-11-12 00:19:49,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 2277 states have (on average 3.844971453667106) internal successors, (8755), 2280 states have internal predecessors, (8755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 8755 transitions. [2020-11-12 00:19:49,114 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 8755 transitions. Word has length 17 [2020-11-12 00:19:49,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:49,114 INFO L481 AbstractCegarLoop]: Abstraction has 2281 states and 8755 transitions. [2020-11-12 00:19:49,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 8755 transitions. [2020-11-12 00:19:49,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-12 00:19:49,116 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:49,116 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:49,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-12 00:19:49,116 INFO L429 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-11-12 00:19:49,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:49,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1018834511, now seen corresponding path program 1 times [2020-11-12 00:19:49,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:49,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434584956] [2020-11-12 00:19:49,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:19:49,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434584956] [2020-11-12 00:19:49,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:49,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:19:49,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823680722] [2020-11-12 00:19:49,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:19:49,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:49,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:19:49,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:19:49,198 INFO L87 Difference]: Start difference. First operand 2281 states and 8755 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:49,454 INFO L93 Difference]: Finished difference Result 4824 states and 15985 transitions. [2020-11-12 00:19:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:19:49,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2020-11-12 00:19:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:49,479 INFO L225 Difference]: With dead ends: 4824 [2020-11-12 00:19:49,480 INFO L226 Difference]: Without dead ends: 4807 [2020-11-12 00:19:49,481 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:19:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2020-11-12 00:19:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 2214. [2020-11-12 00:19:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 2210 states have (on average 3.849321266968326) internal successors, (8507), 2213 states have internal predecessors, (8507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 8507 transitions. [2020-11-12 00:19:49,636 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 8507 transitions. Word has length 19 [2020-11-12 00:19:49,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:49,636 INFO L481 AbstractCegarLoop]: Abstraction has 2214 states and 8507 transitions. [2020-11-12 00:19:49,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 8507 transitions. [2020-11-12 00:19:49,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-12 00:19:49,640 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:49,641 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:49,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-12 00:19:49,641 INFO L429 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-11-12 00:19:49,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:49,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1018854661, now seen corresponding path program 1 times [2020-11-12 00:19:49,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:49,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978987116] [2020-11-12 00:19:49,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:19:49,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978987116] [2020-11-12 00:19:49,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:49,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:19:49,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640992965] [2020-11-12 00:19:49,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:19:49,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:49,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:19:49,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:19:49,706 INFO L87 Difference]: Start difference. First operand 2214 states and 8507 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:49,960 INFO L93 Difference]: Finished difference Result 4664 states and 15420 transitions. [2020-11-12 00:19:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:19:49,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2020-11-12 00:19:49,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:49,981 INFO L225 Difference]: With dead ends: 4664 [2020-11-12 00:19:49,981 INFO L226 Difference]: Without dead ends: 4647 [2020-11-12 00:19:49,982 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:19:50,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4647 states. [2020-11-12 00:19:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4647 to 2244. [2020-11-12 00:19:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2244 states, 2240 states have (on average 3.836607142857143) internal successors, (8594), 2243 states have internal predecessors, (8594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 8594 transitions. [2020-11-12 00:19:50,182 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 8594 transitions. Word has length 19 [2020-11-12 00:19:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:50,183 INFO L481 AbstractCegarLoop]: Abstraction has 2244 states and 8594 transitions. [2020-11-12 00:19:50,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 8594 transitions. [2020-11-12 00:19:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-12 00:19:50,184 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:50,184 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:50,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-12 00:19:50,184 INFO L429 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-11-12 00:19:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:50,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1011424271, now seen corresponding path program 2 times [2020-11-12 00:19:50,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:50,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409625417] [2020-11-12 00:19:50,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:50,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:19:50,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409625417] [2020-11-12 00:19:50,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:50,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:19:50,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519059039] [2020-11-12 00:19:50,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:19:50,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:50,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:19:50,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:19:50,257 INFO L87 Difference]: Start difference. First operand 2244 states and 8594 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:50,509 INFO L93 Difference]: Finished difference Result 4657 states and 15404 transitions. [2020-11-12 00:19:50,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:19:50,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2020-11-12 00:19:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:50,530 INFO L225 Difference]: With dead ends: 4657 [2020-11-12 00:19:50,531 INFO L226 Difference]: Without dead ends: 4645 [2020-11-12 00:19:50,531 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:19:50,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2020-11-12 00:19:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 2212. [2020-11-12 00:19:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2212 states, 2208 states have (on average 3.833786231884058) internal successors, (8465), 2211 states have internal predecessors, (8465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 8465 transitions. [2020-11-12 00:19:50,649 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 8465 transitions. Word has length 19 [2020-11-12 00:19:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:50,650 INFO L481 AbstractCegarLoop]: Abstraction has 2212 states and 8465 transitions. [2020-11-12 00:19:50,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 8465 transitions. [2020-11-12 00:19:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-12 00:19:50,652 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:50,652 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:50,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-12 00:19:50,652 INFO L429 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-11-12 00:19:50,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:50,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1030788421, now seen corresponding path program 2 times [2020-11-12 00:19:50,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:50,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629252338] [2020-11-12 00:19:50,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:50,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:19:50,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629252338] [2020-11-12 00:19:50,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:50,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:19:50,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629116910] [2020-11-12 00:19:50,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:19:50,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:50,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:19:50,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:19:50,708 INFO L87 Difference]: Start difference. First operand 2212 states and 8465 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:50,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:50,943 INFO L93 Difference]: Finished difference Result 4774 states and 15828 transitions. [2020-11-12 00:19:50,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:19:50,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2020-11-12 00:19:50,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:50,961 INFO L225 Difference]: With dead ends: 4774 [2020-11-12 00:19:50,961 INFO L226 Difference]: Without dead ends: 4757 [2020-11-12 00:19:50,962 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:19:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2020-11-12 00:19:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 2150. [2020-11-12 00:19:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2150 states, 2146 states have (on average 3.841099720410065) internal successors, (8243), 2149 states have internal predecessors, (8243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 8243 transitions. [2020-11-12 00:19:51,077 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 8243 transitions. Word has length 19 [2020-11-12 00:19:51,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:51,077 INFO L481 AbstractCegarLoop]: Abstraction has 2150 states and 8243 transitions. [2020-11-12 00:19:51,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 8243 transitions. [2020-11-12 00:19:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:19:51,079 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:51,079 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:51,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-12 00:19:51,080 INFO L429 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-11-12 00:19:51,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:51,080 INFO L82 PathProgramCache]: Analyzing trace with hash -152570232, now seen corresponding path program 1 times [2020-11-12 00:19:51,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:51,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061900657] [2020-11-12 00:19:51,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:19:51,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061900657] [2020-11-12 00:19:51,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:51,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:19:51,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401055084] [2020-11-12 00:19:51,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:19:51,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:51,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:19:51,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:19:51,156 INFO L87 Difference]: Start difference. First operand 2150 states and 8243 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:51,830 INFO L93 Difference]: Finished difference Result 6025 states and 18746 transitions. [2020-11-12 00:19:51,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:19:51,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:19:51,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:51,853 INFO L225 Difference]: With dead ends: 6025 [2020-11-12 00:19:51,854 INFO L226 Difference]: Without dead ends: 6017 [2020-11-12 00:19:51,854 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:19:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-11-12 00:19:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 2121. [2020-11-12 00:19:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2117 states have (on average 3.834671705243269) internal successors, (8118), 2120 states have internal predecessors, (8118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 8118 transitions. [2020-11-12 00:19:51,992 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 8118 transitions. Word has length 21 [2020-11-12 00:19:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:51,994 INFO L481 AbstractCegarLoop]: Abstraction has 2121 states and 8118 transitions. [2020-11-12 00:19:51,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 8118 transitions. [2020-11-12 00:19:51,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:19:51,996 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:51,996 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:51,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-12 00:19:51,997 INFO L429 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-11-12 00:19:51,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:51,997 INFO L82 PathProgramCache]: Analyzing trace with hash -133226232, now seen corresponding path program 2 times [2020-11-12 00:19:51,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:51,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616495795] [2020-11-12 00:19:51,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:19:52,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616495795] [2020-11-12 00:19:52,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:52,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:19:52,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841669457] [2020-11-12 00:19:52,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:19:52,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:52,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:19:52,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:19:52,100 INFO L87 Difference]: Start difference. First operand 2121 states and 8118 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:52,741 INFO L93 Difference]: Finished difference Result 5922 states and 18404 transitions. [2020-11-12 00:19:52,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:19:52,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:19:52,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:52,763 INFO L225 Difference]: With dead ends: 5922 [2020-11-12 00:19:52,763 INFO L226 Difference]: Without dead ends: 5911 [2020-11-12 00:19:52,764 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:19:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5911 states. [2020-11-12 00:19:52,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5911 to 2089. [2020-11-12 00:19:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2085 states have (on average 3.8306954436450837) internal successors, (7987), 2088 states have internal predecessors, (7987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 7987 transitions. [2020-11-12 00:19:52,888 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 7987 transitions. Word has length 21 [2020-11-12 00:19:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:52,888 INFO L481 AbstractCegarLoop]: Abstraction has 2089 states and 7987 transitions. [2020-11-12 00:19:52,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 7987 transitions. [2020-11-12 00:19:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:19:52,890 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:52,890 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:52,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-12 00:19:52,891 INFO L429 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-11-12 00:19:52,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:52,891 INFO L82 PathProgramCache]: Analyzing trace with hash 751872532, now seen corresponding path program 1 times [2020-11-12 00:19:52,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:52,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980565456] [2020-11-12 00:19:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:19:52,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980565456] [2020-11-12 00:19:52,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:52,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:19:52,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825436274] [2020-11-12 00:19:52,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:19:52,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:52,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:19:52,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:19:52,939 INFO L87 Difference]: Start difference. First operand 2089 states and 7987 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:53,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:53,046 INFO L93 Difference]: Finished difference Result 3171 states and 11420 transitions. [2020-11-12 00:19:53,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:19:53,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:19:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:53,061 INFO L225 Difference]: With dead ends: 3171 [2020-11-12 00:19:53,062 INFO L226 Difference]: Without dead ends: 3155 [2020-11-12 00:19:53,062 INFO L749 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-11-12 00:19:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2020-11-12 00:19:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 2326. [2020-11-12 00:19:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2322 states have (on average 3.7708871662360033) internal successors, (8756), 2325 states have internal predecessors, (8756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 8756 transitions. [2020-11-12 00:19:53,148 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 8756 transitions. Word has length 21 [2020-11-12 00:19:53,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:53,148 INFO L481 AbstractCegarLoop]: Abstraction has 2326 states and 8756 transitions. [2020-11-12 00:19:53,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 8756 transitions. [2020-11-12 00:19:53,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:19:53,150 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:53,150 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:53,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-12 00:19:53,150 INFO L429 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-11-12 00:19:53,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:53,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1316123720, now seen corresponding path program 3 times [2020-11-12 00:19:53,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:53,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537786028] [2020-11-12 00:19:53,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:19:53,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537786028] [2020-11-12 00:19:53,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:53,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:19:53,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520142863] [2020-11-12 00:19:53,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:19:53,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:53,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:19:53,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:19:53,218 INFO L87 Difference]: Start difference. First operand 2326 states and 8756 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:53,898 INFO L93 Difference]: Finished difference Result 6243 states and 19533 transitions. [2020-11-12 00:19:53,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:19:53,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:19:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:53,920 INFO L225 Difference]: With dead ends: 6243 [2020-11-12 00:19:53,920 INFO L226 Difference]: Without dead ends: 6232 [2020-11-12 00:19:53,921 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:19:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6232 states. [2020-11-12 00:19:54,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6232 to 2239. [2020-11-12 00:19:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2239 states, 2235 states have (on average 3.7682326621923936) internal successors, (8422), 2238 states have internal predecessors, (8422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 8422 transitions. [2020-11-12 00:19:54,042 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 8422 transitions. Word has length 21 [2020-11-12 00:19:54,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:54,042 INFO L481 AbstractCegarLoop]: Abstraction has 2239 states and 8422 transitions. [2020-11-12 00:19:54,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:54,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 8422 transitions. [2020-11-12 00:19:54,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:19:54,044 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:54,044 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:54,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-12 00:19:54,045 INFO L429 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-11-12 00:19:54,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1328057480, now seen corresponding path program 4 times [2020-11-12 00:19:54,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:54,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605039681] [2020-11-12 00:19:54,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:19:54,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605039681] [2020-11-12 00:19:54,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:54,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:19:54,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722682979] [2020-11-12 00:19:54,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:19:54,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:19:54,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:19:54,129 INFO L87 Difference]: Start difference. First operand 2239 states and 8422 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:54,762 INFO L93 Difference]: Finished difference Result 6169 states and 19292 transitions. [2020-11-12 00:19:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:19:54,762 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:19:54,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:54,781 INFO L225 Difference]: With dead ends: 6169 [2020-11-12 00:19:54,782 INFO L226 Difference]: Without dead ends: 6155 [2020-11-12 00:19:54,782 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:19:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6155 states. [2020-11-12 00:19:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6155 to 2191. [2020-11-12 00:19:54,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2191 states, 2187 states have (on average 3.763145861911294) internal successors, (8230), 2190 states have internal predecessors, (8230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2191 states to 2191 states and 8230 transitions. [2020-11-12 00:19:54,913 INFO L78 Accepts]: Start accepts. Automaton has 2191 states and 8230 transitions. Word has length 21 [2020-11-12 00:19:54,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:54,913 INFO L481 AbstractCegarLoop]: Abstraction has 2191 states and 8230 transitions. [2020-11-12 00:19:54,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 8230 transitions. [2020-11-12 00:19:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:19:54,915 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:54,915 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:54,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-12 00:19:54,915 INFO L429 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-11-12 00:19:54,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:54,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1549784760, now seen corresponding path program 5 times [2020-11-12 00:19:54,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:54,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170719882] [2020-11-12 00:19:54,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:19:55,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170719882] [2020-11-12 00:19:55,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:55,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:19:55,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567405379] [2020-11-12 00:19:55,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:19:55,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:55,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:19:55,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:19:55,005 INFO L87 Difference]: Start difference. First operand 2191 states and 8230 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:55,598 INFO L93 Difference]: Finished difference Result 6158 states and 19267 transitions. [2020-11-12 00:19:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:19:55,599 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:19:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:55,613 INFO L225 Difference]: With dead ends: 6158 [2020-11-12 00:19:55,613 INFO L226 Difference]: Without dead ends: 6147 [2020-11-12 00:19:55,614 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:19:55,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2020-11-12 00:19:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 2104. [2020-11-12 00:19:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2104 states, 2100 states have (on average 3.76) internal successors, (7896), 2103 states have internal predecessors, (7896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 7896 transitions. [2020-11-12 00:19:55,758 INFO L78 Accepts]: Start accepts. Automaton has 2104 states and 7896 transitions. Word has length 21 [2020-11-12 00:19:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:55,758 INFO L481 AbstractCegarLoop]: Abstraction has 2104 states and 7896 transitions. [2020-11-12 00:19:55,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 7896 transitions. [2020-11-12 00:19:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:19:55,760 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:55,760 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:55,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-12 00:19:55,761 INFO L429 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-11-12 00:19:55,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:55,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1557195000, now seen corresponding path program 6 times [2020-11-12 00:19:55,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:55,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372046969] [2020-11-12 00:19:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:19:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:19:55,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372046969] [2020-11-12 00:19:55,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:19:55,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:19:55,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967687582] [2020-11-12 00:19:55,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:19:55,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:19:55,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:19:55,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:19:55,834 INFO L87 Difference]: Start difference. First operand 2104 states and 7896 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:19:56,452 INFO L93 Difference]: Finished difference Result 6025 states and 18811 transitions. [2020-11-12 00:19:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:19:56,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:19:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:19:56,464 INFO L225 Difference]: With dead ends: 6025 [2020-11-12 00:19:56,464 INFO L226 Difference]: Without dead ends: 6010 [2020-11-12 00:19:56,465 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:19:56,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-11-12 00:19:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 1965. [2020-11-12 00:19:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1962 states have (on average 3.7864424057084607) internal successors, (7429), 1964 states have internal predecessors, (7429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2020-11-12 00:19:56,580 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2020-11-12 00:19:56,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:19:56,581 INFO L481 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2020-11-12 00:19:56,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:19:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2020-11-12 00:19:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-12 00:19:56,583 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:19:56,583 INFO L494 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:19:56,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-12 00:19:56,583 INFO L429 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-11-12 00:19:56,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:19:56,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1828033516, now seen corresponding path program 1 times [2020-11-12 00:19:56,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:19:56,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510918932] [2020-11-12 00:19:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:19:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 00:19:56,596 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 00:19:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 00:19:56,605 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 00:19:56,614 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-12 00:19:56,614 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-12 00:19:56,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-12 00:19:56,614 WARN L386 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-11-12 00:19:56,614 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-11-12 00:19:56,634 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,634 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,634 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,634 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,634 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,634 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,635 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,635 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,635 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,635 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,635 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,635 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,635 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,635 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,636 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,636 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,636 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,636 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,636 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,636 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,636 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,636 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,636 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,637 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,637 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,637 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,637 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,637 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,637 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,637 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,637 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,637 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,637 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,638 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,638 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,638 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,638 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,638 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,638 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,638 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,638 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,638 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,639 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,639 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,639 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,639 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,639 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,639 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,639 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,639 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,639 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,639 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,640 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,640 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,640 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,640 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,640 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,640 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,640 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,640 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,640 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,640 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,641 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,641 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,641 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,641 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,641 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,641 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,641 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,641 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,641 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,641 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,642 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,642 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,642 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,642 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,642 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,642 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,642 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,642 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,642 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,643 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,643 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,643 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,643 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,643 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,643 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,643 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,643 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,643 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,644 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,644 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,652 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,655 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,658 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,661 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,661 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,662 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,682 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,683 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,683 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,683 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,683 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,686 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,686 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,687 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,687 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,687 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,688 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,688 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,688 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,688 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,688 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,690 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,690 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,690 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,690 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,690 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,691 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,691 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,691 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,692 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,692 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:19:56,693 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-12 00:19:56,693 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-11-12 00:19:56,694 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 00:19:56,694 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 00:19:56,694 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 00:19:56,694 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 00:19:56,694 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 00:19:56,694 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 00:19:56,694 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 00:19:56,694 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 00:19:56,698 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-12 00:19:56,699 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 152 transitions, 394 flow [2020-11-12 00:19:56,699 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 152 transitions, 394 flow [2020-11-12 00:19:56,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 163 places, 152 transitions, 394 flow [2020-11-12 00:19:56,742 INFO L129 PetriNetUnfolder]: 8/158 cut-off events. [2020-11-12 00:19:56,742 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-11-12 00:19:56,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 158 events. 8/158 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 280 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 185. Up to 12 conditions per place. [2020-11-12 00:19:56,750 INFO L116 LiptonReduction]: Number of co-enabled transitions 3390 [2020-11-12 00:20:00,299 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-12 00:20:00,458 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-12 00:20:02,589 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2020-11-12 00:20:02,714 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-12 00:20:03,013 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2020-11-12 00:20:03,136 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-12 00:20:03,197 INFO L131 LiptonReduction]: Checked pairs total: 4896 [2020-11-12 00:20:03,197 INFO L133 LiptonReduction]: Total number of compositions: 165 [2020-11-12 00:20:03,197 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 39 transitions, 168 flow [2020-11-12 00:20:03,731 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6191 states, 6177 states have (on average 4.602234094220496) internal successors, (28428), 6190 states have internal predecessors, (28428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 6191 states, 6177 states have (on average 4.602234094220496) internal successors, (28428), 6190 states have internal predecessors, (28428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-12 00:20:03,744 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:03,745 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-12 00:20:03,745 INFO L429 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-11-12 00:20:03,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:03,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1295513, now seen corresponding path program 1 times [2020-11-12 00:20:03,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:03,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197144038] [2020-11-12 00:20:03,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:20:03,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197144038] [2020-11-12 00:20:03,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:03,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-12 00:20:03,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341536938] [2020-11-12 00:20:03,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:20:03,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:03,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:20:03,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:20:03,791 INFO L87 Difference]: Start difference. First operand has 6191 states, 6177 states have (on average 4.602234094220496) internal successors, (28428), 6190 states have internal predecessors, (28428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:03,869 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2020-11-12 00:20:03,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:20:03,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2020-11-12 00:20:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:03,892 INFO L225 Difference]: With dead ends: 5844 [2020-11-12 00:20:03,893 INFO L226 Difference]: Without dead ends: 5479 [2020-11-12 00:20:03,893 INFO L749 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-11-12 00:20:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-11-12 00:20:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-11-12 00:20:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5479 states, 5472 states have (on average 4.476059941520468) internal successors, (24493), 5478 states have internal predecessors, (24493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 24493 transitions. [2020-11-12 00:20:04,165 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 24493 transitions. Word has length 3 [2020-11-12 00:20:04,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:04,165 INFO L481 AbstractCegarLoop]: Abstraction has 5479 states and 24493 transitions. [2020-11-12 00:20:04,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:04,165 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 24493 transitions. [2020-11-12 00:20:04,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-12 00:20:04,166 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:04,166 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:04,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-12 00:20:04,167 INFO L429 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-11-12 00:20:04,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:04,168 INFO L82 PathProgramCache]: Analyzing trace with hash 107014561, now seen corresponding path program 1 times [2020-11-12 00:20:04,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:04,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710973390] [2020-11-12 00:20:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:20:04,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710973390] [2020-11-12 00:20:04,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:04,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:20:04,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440355432] [2020-11-12 00:20:04,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:20:04,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:04,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:20:04,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:20:04,213 INFO L87 Difference]: Start difference. First operand 5479 states and 24493 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:04,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:04,365 INFO L93 Difference]: Finished difference Result 9673 states and 40333 transitions. [2020-11-12 00:20:04,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:20:04,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2020-11-12 00:20:04,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:04,401 INFO L225 Difference]: With dead ends: 9673 [2020-11-12 00:20:04,401 INFO L226 Difference]: Without dead ends: 9666 [2020-11-12 00:20:04,402 INFO L749 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-11-12 00:20:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2020-11-12 00:20:04,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 6331. [2020-11-12 00:20:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6331 states, 6325 states have (on average 4.512885375494071) internal successors, (28544), 6330 states have internal predecessors, (28544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 28544 transitions. [2020-11-12 00:20:04,744 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 28544 transitions. Word has length 9 [2020-11-12 00:20:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:04,745 INFO L481 AbstractCegarLoop]: Abstraction has 6331 states and 28544 transitions. [2020-11-12 00:20:04,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:04,745 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 28544 transitions. [2020-11-12 00:20:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-12 00:20:04,745 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:04,746 INFO L494 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:04,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-12 00:20:04,746 INFO L429 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-11-12 00:20:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash -570788987, now seen corresponding path program 1 times [2020-11-12 00:20:04,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:04,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659140580] [2020-11-12 00:20:04,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:20:04,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659140580] [2020-11-12 00:20:04,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:04,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:20:04,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134046083] [2020-11-12 00:20:04,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:20:04,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:04,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:20:04,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:20:04,780 INFO L87 Difference]: Start difference. First operand 6331 states and 28544 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:05,007 INFO L93 Difference]: Finished difference Result 11081 states and 46826 transitions. [2020-11-12 00:20:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:20:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2020-11-12 00:20:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:05,039 INFO L225 Difference]: With dead ends: 11081 [2020-11-12 00:20:05,039 INFO L226 Difference]: Without dead ends: 11068 [2020-11-12 00:20:05,039 INFO L749 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-11-12 00:20:05,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11068 states. [2020-11-12 00:20:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11068 to 7391. [2020-11-12 00:20:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7391 states, 7385 states have (on average 4.5624915368991195) internal successors, (33694), 7390 states have internal predecessors, (33694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 33694 transitions. [2020-11-12 00:20:05,449 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 33694 transitions. Word has length 13 [2020-11-12 00:20:05,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:05,449 INFO L481 AbstractCegarLoop]: Abstraction has 7391 states and 33694 transitions. [2020-11-12 00:20:05,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 33694 transitions. [2020-11-12 00:20:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:20:05,450 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:05,450 INFO L494 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:05,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-12 00:20:05,450 INFO L429 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-11-12 00:20:05,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:05,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1227589065, now seen corresponding path program 1 times [2020-11-12 00:20:05,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:05,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092938701] [2020-11-12 00:20:05,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:20:05,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092938701] [2020-11-12 00:20:05,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:05,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:20:05,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917807791] [2020-11-12 00:20:05,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:20:05,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:05,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:20:05,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:20:05,500 INFO L87 Difference]: Start difference. First operand 7391 states and 33694 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:05,840 INFO L93 Difference]: Finished difference Result 16749 states and 66010 transitions. [2020-11-12 00:20:05,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:20:05,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:20:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:05,886 INFO L225 Difference]: With dead ends: 16749 [2020-11-12 00:20:05,886 INFO L226 Difference]: Without dead ends: 16736 [2020-11-12 00:20:05,887 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:20:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16736 states. [2020-11-12 00:20:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16736 to 7303. [2020-11-12 00:20:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7303 states, 7297 states have (on average 4.55803754967795) internal successors, (33260), 7302 states have internal predecessors, (33260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 33260 transitions. [2020-11-12 00:20:06,357 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 33260 transitions. Word has length 15 [2020-11-12 00:20:06,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:06,357 INFO L481 AbstractCegarLoop]: Abstraction has 7303 states and 33260 transitions. [2020-11-12 00:20:06,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 33260 transitions. [2020-11-12 00:20:06,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:20:06,358 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:06,358 INFO L494 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:06,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-12 00:20:06,359 INFO L429 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-11-12 00:20:06,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:06,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1230059145, now seen corresponding path program 2 times [2020-11-12 00:20:06,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:06,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260262164] [2020-11-12 00:20:06,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:20:06,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260262164] [2020-11-12 00:20:06,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:06,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:20:06,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294229194] [2020-11-12 00:20:06,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:20:06,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:06,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:20:06,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:20:06,402 INFO L87 Difference]: Start difference. First operand 7303 states and 33260 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:06,735 INFO L93 Difference]: Finished difference Result 17085 states and 67393 transitions. [2020-11-12 00:20:06,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:20:06,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:20:06,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:06,783 INFO L225 Difference]: With dead ends: 17085 [2020-11-12 00:20:06,783 INFO L226 Difference]: Without dead ends: 17071 [2020-11-12 00:20:06,783 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:20:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2020-11-12 00:20:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 7048. [2020-11-12 00:20:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7048 states, 7043 states have (on average 4.5628283401959395) internal successors, (32136), 7047 states have internal predecessors, (32136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 32136 transitions. [2020-11-12 00:20:07,344 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 32136 transitions. Word has length 15 [2020-11-12 00:20:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:07,344 INFO L481 AbstractCegarLoop]: Abstraction has 7048 states and 32136 transitions. [2020-11-12 00:20:07,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 32136 transitions. [2020-11-12 00:20:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-12 00:20:07,345 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:07,345 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:07,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-12 00:20:07,346 INFO L429 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-11-12 00:20:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:07,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1708569982, now seen corresponding path program 1 times [2020-11-12 00:20:07,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:07,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922745432] [2020-11-12 00:20:07,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:07,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:07,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922745432] [2020-11-12 00:20:07,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:07,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:20:07,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395443860] [2020-11-12 00:20:07,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:20:07,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:07,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:20:07,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:20:07,392 INFO L87 Difference]: Start difference. First operand 7048 states and 32136 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:07,746 INFO L93 Difference]: Finished difference Result 12234 states and 52488 transitions. [2020-11-12 00:20:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:20:07,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2020-11-12 00:20:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:07,793 INFO L225 Difference]: With dead ends: 12234 [2020-11-12 00:20:07,793 INFO L226 Difference]: Without dead ends: 12212 [2020-11-12 00:20:07,794 INFO L749 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-11-12 00:20:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2020-11-12 00:20:08,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 8342. [2020-11-12 00:20:08,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8342 states, 8337 states have (on average 4.591339810483388) internal successors, (38278), 8341 states have internal predecessors, (38278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 38278 transitions. [2020-11-12 00:20:08,300 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 38278 transitions. Word has length 17 [2020-11-12 00:20:08,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:08,300 INFO L481 AbstractCegarLoop]: Abstraction has 8342 states and 38278 transitions. [2020-11-12 00:20:08,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 38278 transitions. [2020-11-12 00:20:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-12 00:20:08,303 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:08,303 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:08,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-12 00:20:08,303 INFO L429 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-11-12 00:20:08,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:08,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1145752117, now seen corresponding path program 1 times [2020-11-12 00:20:08,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:08,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249232439] [2020-11-12 00:20:08,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:20:08,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249232439] [2020-11-12 00:20:08,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264628284] [2020-11-12 00:20:08,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:08,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-12 00:20:08,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:08,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:20:08,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:08,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-11-12 00:20:08,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055874887] [2020-11-12 00:20:08,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:20:08,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:08,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:20:08,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:20:08,525 INFO L87 Difference]: Start difference. First operand 8342 states and 38278 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:08,941 INFO L93 Difference]: Finished difference Result 19016 states and 76191 transitions. [2020-11-12 00:20:08,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:20:08,941 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2020-11-12 00:20:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:09,143 INFO L225 Difference]: With dead ends: 19016 [2020-11-12 00:20:09,143 INFO L226 Difference]: Without dead ends: 18998 [2020-11-12 00:20:09,143 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-11-12 00:20:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2020-11-12 00:20:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 8452. [2020-11-12 00:20:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8452 states, 8447 states have (on average 4.581981768675269) internal successors, (38704), 8451 states have internal predecessors, (38704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8452 states to 8452 states and 38704 transitions. [2020-11-12 00:20:09,627 INFO L78 Accepts]: Start accepts. Automaton has 8452 states and 38704 transitions. Word has length 19 [2020-11-12 00:20:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:09,627 INFO L481 AbstractCegarLoop]: Abstraction has 8452 states and 38704 transitions. [2020-11-12 00:20:09,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 8452 states and 38704 transitions. [2020-11-12 00:20:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-12 00:20:09,628 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:09,628 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:09,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-11-12 00:20:09,830 INFO L429 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-11-12 00:20:09,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:09,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1258234741, now seen corresponding path program 2 times [2020-11-12 00:20:09,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:09,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770299132] [2020-11-12 00:20:09,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:09,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:09,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770299132] [2020-11-12 00:20:09,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:09,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:20:09,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674581626] [2020-11-12 00:20:09,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:20:09,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:09,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:20:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:20:09,879 INFO L87 Difference]: Start difference. First operand 8452 states and 38704 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:10,196 INFO L93 Difference]: Finished difference Result 19420 states and 77854 transitions. [2020-11-12 00:20:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:20:10,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2020-11-12 00:20:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:10,249 INFO L225 Difference]: With dead ends: 19420 [2020-11-12 00:20:10,249 INFO L226 Difference]: Without dead ends: 19395 [2020-11-12 00:20:10,249 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:20:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19395 states. [2020-11-12 00:20:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19395 to 8129. [2020-11-12 00:20:10,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8129 states, 8124 states have (on average 4.591088133924175) internal successors, (37298), 8128 states have internal predecessors, (37298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8129 states to 8129 states and 37298 transitions. [2020-11-12 00:20:10,779 INFO L78 Accepts]: Start accepts. Automaton has 8129 states and 37298 transitions. Word has length 19 [2020-11-12 00:20:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:10,779 INFO L481 AbstractCegarLoop]: Abstraction has 8129 states and 37298 transitions. [2020-11-12 00:20:10,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 8129 states and 37298 transitions. [2020-11-12 00:20:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-12 00:20:10,780 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:10,780 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:10,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-12 00:20:10,781 INFO L429 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-11-12 00:20:10,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:10,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1258237314, now seen corresponding path program 1 times [2020-11-12 00:20:10,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:10,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194190076] [2020-11-12 00:20:10,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:10,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194190076] [2020-11-12 00:20:10,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:10,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:20:10,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25836972] [2020-11-12 00:20:10,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:20:10,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:10,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:20:10,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:20:10,832 INFO L87 Difference]: Start difference. First operand 8129 states and 37298 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:11,007 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-11-12 00:20:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:11,368 INFO L93 Difference]: Finished difference Result 19373 states and 77785 transitions. [2020-11-12 00:20:11,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:20:11,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2020-11-12 00:20:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:11,421 INFO L225 Difference]: With dead ends: 19373 [2020-11-12 00:20:11,421 INFO L226 Difference]: Without dead ends: 19348 [2020-11-12 00:20:11,422 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:20:11,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19348 states. [2020-11-12 00:20:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19348 to 8375. [2020-11-12 00:20:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8375 states, 8370 states have (on average 4.587096774193548) internal successors, (38394), 8374 states have internal predecessors, (38394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8375 states to 8375 states and 38394 transitions. [2020-11-12 00:20:11,959 INFO L78 Accepts]: Start accepts. Automaton has 8375 states and 38394 transitions. Word has length 19 [2020-11-12 00:20:11,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:11,960 INFO L481 AbstractCegarLoop]: Abstraction has 8375 states and 38394 transitions. [2020-11-12 00:20:11,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8375 states and 38394 transitions. [2020-11-12 00:20:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-12 00:20:11,961 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:11,961 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:11,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-12 00:20:11,961 INFO L429 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-11-12 00:20:11,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:11,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1285735554, now seen corresponding path program 2 times [2020-11-12 00:20:11,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:11,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285980054] [2020-11-12 00:20:11,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:12,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285980054] [2020-11-12 00:20:12,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:12,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:20:12,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824588071] [2020-11-12 00:20:12,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:20:12,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:12,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:20:12,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:20:12,009 INFO L87 Difference]: Start difference. First operand 8375 states and 38394 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:12,367 INFO L93 Difference]: Finished difference Result 19555 states and 78564 transitions. [2020-11-12 00:20:12,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:20:12,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2020-11-12 00:20:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:12,601 INFO L225 Difference]: With dead ends: 19555 [2020-11-12 00:20:12,601 INFO L226 Difference]: Without dead ends: 19530 [2020-11-12 00:20:12,602 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:20:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2020-11-12 00:20:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 8317. [2020-11-12 00:20:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8317 states, 8312 states have (on average 4.593840230991338) internal successors, (38184), 8316 states have internal predecessors, (38184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 38184 transitions. [2020-11-12 00:20:13,141 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 38184 transitions. Word has length 19 [2020-11-12 00:20:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:13,141 INFO L481 AbstractCegarLoop]: Abstraction has 8317 states and 38184 transitions. [2020-11-12 00:20:13,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 38184 transitions. [2020-11-12 00:20:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:20:13,142 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:13,142 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:13,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-12 00:20:13,143 INFO L429 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-11-12 00:20:13,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:13,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1556148345, now seen corresponding path program 1 times [2020-11-12 00:20:13,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:13,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995230694] [2020-11-12 00:20:13,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:20:13,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995230694] [2020-11-12 00:20:13,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209820467] [2020-11-12 00:20:13,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:13,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:20:13,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:20:13,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:13,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:20:13,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432193241] [2020-11-12 00:20:13,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:20:13,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:13,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:20:13,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:20:13,362 INFO L87 Difference]: Start difference. First operand 8317 states and 38184 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:14,455 INFO L93 Difference]: Finished difference Result 26969 states and 101544 transitions. [2020-11-12 00:20:14,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:14,456 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:20:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:14,538 INFO L225 Difference]: With dead ends: 26969 [2020-11-12 00:20:14,538 INFO L226 Difference]: Without dead ends: 26957 [2020-11-12 00:20:14,539 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:20:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2020-11-12 00:20:15,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 8208. [2020-11-12 00:20:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8208 states, 8203 states have (on average 4.588565159088138) internal successors, (37640), 8207 states have internal predecessors, (37640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8208 states to 8208 states and 37640 transitions. [2020-11-12 00:20:15,209 INFO L78 Accepts]: Start accepts. Automaton has 8208 states and 37640 transitions. Word has length 21 [2020-11-12 00:20:15,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:15,209 INFO L481 AbstractCegarLoop]: Abstraction has 8208 states and 37640 transitions. [2020-11-12 00:20:15,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 8208 states and 37640 transitions. [2020-11-12 00:20:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:20:15,210 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:15,210 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:15,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:15,411 INFO L429 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-11-12 00:20:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:15,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1583646585, now seen corresponding path program 2 times [2020-11-12 00:20:15,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:15,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131196531] [2020-11-12 00:20:15,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:20:15,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131196531] [2020-11-12 00:20:15,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364191119] [2020-11-12 00:20:15,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 00:20:15,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-12 00:20:15,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-12 00:20:15,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:20:15,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:20:15,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:15,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:20:15,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081349408] [2020-11-12 00:20:15,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:20:15,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:15,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:20:15,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:20:15,677 INFO L87 Difference]: Start difference. First operand 8208 states and 37640 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:16,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:16,693 INFO L93 Difference]: Finished difference Result 26669 states and 100297 transitions. [2020-11-12 00:20:16,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:16,694 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:20:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:16,788 INFO L225 Difference]: With dead ends: 26669 [2020-11-12 00:20:16,789 INFO L226 Difference]: Without dead ends: 26653 [2020-11-12 00:20:16,789 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:20:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26653 states. [2020-11-12 00:20:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26653 to 8091. [2020-11-12 00:20:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8091 states, 8086 states have (on average 4.585209003215434) internal successors, (37076), 8090 states have internal predecessors, (37076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 37076 transitions. [2020-11-12 00:20:17,427 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 37076 transitions. Word has length 21 [2020-11-12 00:20:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:17,427 INFO L481 AbstractCegarLoop]: Abstraction has 8091 states and 37076 transitions. [2020-11-12 00:20:17,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 37076 transitions. [2020-11-12 00:20:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:20:17,428 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:17,428 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:17,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:17,629 INFO L429 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-11-12 00:20:17,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:17,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2017199687, now seen corresponding path program 3 times [2020-11-12 00:20:17,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:17,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958071603] [2020-11-12 00:20:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:17,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958071603] [2020-11-12 00:20:17,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:17,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:20:17,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816641951] [2020-11-12 00:20:17,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:20:17,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:17,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:20:17,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:20:17,701 INFO L87 Difference]: Start difference. First operand 8091 states and 37076 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:18,604 INFO L93 Difference]: Finished difference Result 26678 states and 100382 transitions. [2020-11-12 00:20:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:18,605 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:20:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:18,698 INFO L225 Difference]: With dead ends: 26678 [2020-11-12 00:20:18,698 INFO L226 Difference]: Without dead ends: 26666 [2020-11-12 00:20:18,699 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:20:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26666 states. [2020-11-12 00:20:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26666 to 7869. [2020-11-12 00:20:19,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7869 states, 7864 states have (on average 4.588758901322482) internal successors, (36086), 7868 states have internal predecessors, (36086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:19,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7869 states to 7869 states and 36086 transitions. [2020-11-12 00:20:19,413 INFO L78 Accepts]: Start accepts. Automaton has 7869 states and 36086 transitions. Word has length 21 [2020-11-12 00:20:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:19,414 INFO L481 AbstractCegarLoop]: Abstraction has 7869 states and 36086 transitions. [2020-11-12 00:20:19,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:19,414 INFO L276 IsEmpty]: Start isEmpty. Operand 7869 states and 36086 transitions. [2020-11-12 00:20:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:20:19,416 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:19,416 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:19,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-11-12 00:20:19,416 INFO L429 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-11-12 00:20:19,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:19,416 INFO L82 PathProgramCache]: Analyzing trace with hash -2014729607, now seen corresponding path program 4 times [2020-11-12 00:20:19,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:19,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861254305] [2020-11-12 00:20:19,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:19,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861254305] [2020-11-12 00:20:19,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:19,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:20:19,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505079896] [2020-11-12 00:20:19,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:20:19,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:19,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:20:19,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:20:19,502 INFO L87 Difference]: Start difference. First operand 7869 states and 36086 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:20,578 INFO L93 Difference]: Finished difference Result 26497 states and 99670 transitions. [2020-11-12 00:20:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:20,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:20:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:20,649 INFO L225 Difference]: With dead ends: 26497 [2020-11-12 00:20:20,649 INFO L226 Difference]: Without dead ends: 26481 [2020-11-12 00:20:20,649 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:20:20,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26481 states. [2020-11-12 00:20:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26481 to 7756. [2020-11-12 00:20:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7756 states, 7751 states have (on average 4.584440717326797) internal successors, (35534), 7755 states have internal predecessors, (35534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7756 states to 7756 states and 35534 transitions. [2020-11-12 00:20:21,063 INFO L78 Accepts]: Start accepts. Automaton has 7756 states and 35534 transitions. Word has length 21 [2020-11-12 00:20:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:21,063 INFO L481 AbstractCegarLoop]: Abstraction has 7756 states and 35534 transitions. [2020-11-12 00:20:21,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 7756 states and 35534 transitions. [2020-11-12 00:20:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:20:21,065 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:21,065 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:21,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-12 00:20:21,065 INFO L429 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-11-12 00:20:21,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:21,065 INFO L82 PathProgramCache]: Analyzing trace with hash -595876884, now seen corresponding path program 1 times [2020-11-12 00:20:21,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:21,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171990452] [2020-11-12 00:20:21,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:20:21,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171990452] [2020-11-12 00:20:21,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:21,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:20:21,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844651392] [2020-11-12 00:20:21,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:20:21,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:21,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:20:21,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:20:21,102 INFO L87 Difference]: Start difference. First operand 7756 states and 35534 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:21,284 INFO L93 Difference]: Finished difference Result 13259 states and 57521 transitions. [2020-11-12 00:20:21,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:20:21,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:20:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:21,512 INFO L225 Difference]: With dead ends: 13259 [2020-11-12 00:20:21,512 INFO L226 Difference]: Without dead ends: 13228 [2020-11-12 00:20:21,512 INFO L749 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-11-12 00:20:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13228 states. [2020-11-12 00:20:21,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13228 to 9263. [2020-11-12 00:20:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9263 states, 9258 states have (on average 4.578526679628429) internal successors, (42388), 9262 states have internal predecessors, (42388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9263 states to 9263 states and 42388 transitions. [2020-11-12 00:20:21,835 INFO L78 Accepts]: Start accepts. Automaton has 9263 states and 42388 transitions. Word has length 21 [2020-11-12 00:20:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:21,835 INFO L481 AbstractCegarLoop]: Abstraction has 9263 states and 42388 transitions. [2020-11-12 00:20:21,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 9263 states and 42388 transitions. [2020-11-12 00:20:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:20:21,836 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:21,837 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:21,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-12 00:20:21,837 INFO L429 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-11-12 00:20:21,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:21,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1358724743, now seen corresponding path program 5 times [2020-11-12 00:20:21,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:21,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779035682] [2020-11-12 00:20:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:21,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779035682] [2020-11-12 00:20:21,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:21,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:20:21,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709519529] [2020-11-12 00:20:21,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:20:21,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:21,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:20:21,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:20:21,901 INFO L87 Difference]: Start difference. First operand 9263 states and 42388 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:22,959 INFO L93 Difference]: Finished difference Result 29796 states and 113861 transitions. [2020-11-12 00:20:22,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:22,960 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:20:22,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:23,053 INFO L225 Difference]: With dead ends: 29796 [2020-11-12 00:20:23,054 INFO L226 Difference]: Without dead ends: 29778 [2020-11-12 00:20:23,054 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:20:23,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29778 states. [2020-11-12 00:20:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29778 to 8972. [2020-11-12 00:20:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8972 states, 8967 states have (on average 4.578008252481321) internal successors, (41051), 8971 states have internal predecessors, (41051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8972 states to 8972 states and 41051 transitions. [2020-11-12 00:20:23,537 INFO L78 Accepts]: Start accepts. Automaton has 8972 states and 41051 transitions. Word has length 21 [2020-11-12 00:20:23,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:23,537 INFO L481 AbstractCegarLoop]: Abstraction has 8972 states and 41051 transitions. [2020-11-12 00:20:23,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:23,537 INFO L276 IsEmpty]: Start isEmpty. Operand 8972 states and 41051 transitions. [2020-11-12 00:20:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:20:23,539 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:23,539 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:23,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-11-12 00:20:23,539 INFO L429 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-11-12 00:20:23,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:23,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1333696583, now seen corresponding path program 6 times [2020-11-12 00:20:23,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:23,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144849407] [2020-11-12 00:20:23,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:23,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144849407] [2020-11-12 00:20:23,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:23,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:20:23,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826610840] [2020-11-12 00:20:23,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:20:23,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:23,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:20:23,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:20:23,605 INFO L87 Difference]: Start difference. First operand 8972 states and 41051 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:24,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:24,726 INFO L93 Difference]: Finished difference Result 29387 states and 112119 transitions. [2020-11-12 00:20:24,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:24,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:20:24,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:24,805 INFO L225 Difference]: With dead ends: 29387 [2020-11-12 00:20:24,805 INFO L226 Difference]: Without dead ends: 29364 [2020-11-12 00:20:24,805 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:20:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29364 states. [2020-11-12 00:20:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29364 to 8573. [2020-11-12 00:20:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8573 states, 8569 states have (on average 4.592484537285564) internal successors, (39353), 8572 states have internal predecessors, (39353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8573 states to 8573 states and 39353 transitions. [2020-11-12 00:20:25,421 INFO L78 Accepts]: Start accepts. Automaton has 8573 states and 39353 transitions. Word has length 21 [2020-11-12 00:20:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:25,421 INFO L481 AbstractCegarLoop]: Abstraction has 8573 states and 39353 transitions. [2020-11-12 00:20:25,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 8573 states and 39353 transitions. [2020-11-12 00:20:25,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-12 00:20:25,424 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:25,424 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:25,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-11-12 00:20:25,424 INFO L429 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-11-12 00:20:25,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:25,425 INFO L82 PathProgramCache]: Analyzing trace with hash -2066184925, now seen corresponding path program 1 times [2020-11-12 00:20:25,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:25,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146350126] [2020-11-12 00:20:25,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-12 00:20:25,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146350126] [2020-11-12 00:20:25,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683119677] [2020-11-12 00:20:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:25,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-12 00:20:25,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-12 00:20:25,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:25,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-11-12 00:20:25,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284495585] [2020-11-12 00:20:25,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:20:25,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:25,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:20:25,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:20:25,823 INFO L87 Difference]: Start difference. First operand 8573 states and 39353 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:26,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:26,229 INFO L93 Difference]: Finished difference Result 19727 states and 80274 transitions. [2020-11-12 00:20:26,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:20:26,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-12 00:20:26,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:26,281 INFO L225 Difference]: With dead ends: 19727 [2020-11-12 00:20:26,282 INFO L226 Difference]: Without dead ends: 19703 [2020-11-12 00:20:26,282 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-11-12 00:20:26,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19703 states. [2020-11-12 00:20:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19703 to 8847. [2020-11-12 00:20:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8847 states, 8843 states have (on average 4.579328282257152) internal successors, (40495), 8846 states have internal predecessors, (40495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40495 transitions. [2020-11-12 00:20:26,656 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40495 transitions. Word has length 23 [2020-11-12 00:20:26,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:26,656 INFO L481 AbstractCegarLoop]: Abstraction has 8847 states and 40495 transitions. [2020-11-12 00:20:26,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40495 transitions. [2020-11-12 00:20:26,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-12 00:20:26,659 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:26,659 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:26,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-11-12 00:20:26,873 INFO L429 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-11-12 00:20:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:26,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1612880908, now seen corresponding path program 1 times [2020-11-12 00:20:26,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:26,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436919619] [2020-11-12 00:20:26,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:26,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436919619] [2020-11-12 00:20:26,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335547580] [2020-11-12 00:20:26,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:27,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-12 00:20:27,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:27,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:27,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-11-12 00:20:27,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326386071] [2020-11-12 00:20:27,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:20:27,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:27,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:20:27,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:20:27,070 INFO L87 Difference]: Start difference. First operand 8847 states and 40495 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:27,542 INFO L93 Difference]: Finished difference Result 20670 states and 84217 transitions. [2020-11-12 00:20:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:20:27,543 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-12 00:20:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:27,592 INFO L225 Difference]: With dead ends: 20670 [2020-11-12 00:20:27,592 INFO L226 Difference]: Without dead ends: 20642 [2020-11-12 00:20:27,593 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-11-12 00:20:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20642 states. [2020-11-12 00:20:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20642 to 9111. [2020-11-12 00:20:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9111 states, 9107 states have (on average 4.575271768968925) internal successors, (41667), 9110 states have internal predecessors, (41667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9111 states to 9111 states and 41667 transitions. [2020-11-12 00:20:27,968 INFO L78 Accepts]: Start accepts. Automaton has 9111 states and 41667 transitions. Word has length 23 [2020-11-12 00:20:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:27,968 INFO L481 AbstractCegarLoop]: Abstraction has 9111 states and 41667 transitions. [2020-11-12 00:20:27,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 9111 states and 41667 transitions. [2020-11-12 00:20:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-12 00:20:27,971 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:27,972 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:28,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:28,185 INFO L429 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-11-12 00:20:28,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:28,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1348103848, now seen corresponding path program 1 times [2020-11-12 00:20:28,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:28,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127515978] [2020-11-12 00:20:28,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-12 00:20:28,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127515978] [2020-11-12 00:20:28,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772247237] [2020-11-12 00:20:28,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:28,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-12 00:20:28,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-12 00:20:28,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:28,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-11-12 00:20:28,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668653850] [2020-11-12 00:20:28,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:20:28,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:28,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:20:28,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:20:28,362 INFO L87 Difference]: Start difference. First operand 9111 states and 41667 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:28,770 INFO L93 Difference]: Finished difference Result 21416 states and 87392 transitions. [2020-11-12 00:20:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:20:28,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-12 00:20:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:28,952 INFO L225 Difference]: With dead ends: 21416 [2020-11-12 00:20:28,952 INFO L226 Difference]: Without dead ends: 21379 [2020-11-12 00:20:28,952 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-11-12 00:20:29,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21379 states. [2020-11-12 00:20:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21379 to 9320. [2020-11-12 00:20:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9320 states, 9316 states have (on average 4.577930442249893) internal successors, (42648), 9319 states have internal predecessors, (42648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9320 states to 9320 states and 42648 transitions. [2020-11-12 00:20:29,323 INFO L78 Accepts]: Start accepts. Automaton has 9320 states and 42648 transitions. Word has length 23 [2020-11-12 00:20:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:29,323 INFO L481 AbstractCegarLoop]: Abstraction has 9320 states and 42648 transitions. [2020-11-12 00:20:29,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 9320 states and 42648 transitions. [2020-11-12 00:20:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-12 00:20:29,325 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:29,325 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:29,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:29,532 INFO L429 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-11-12 00:20:29,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:29,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1407072116, now seen corresponding path program 2 times [2020-11-12 00:20:29,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:29,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412445812] [2020-11-12 00:20:29,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:20:29,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412445812] [2020-11-12 00:20:29,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:29,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:20:29,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740618177] [2020-11-12 00:20:29,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:20:29,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:29,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:20:29,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:20:29,579 INFO L87 Difference]: Start difference. First operand 9320 states and 42648 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:29,965 INFO L93 Difference]: Finished difference Result 21469 states and 87720 transitions. [2020-11-12 00:20:29,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:20:29,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-12 00:20:29,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:30,018 INFO L225 Difference]: With dead ends: 21469 [2020-11-12 00:20:30,018 INFO L226 Difference]: Without dead ends: 21432 [2020-11-12 00:20:30,018 INFO L749 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-11-12 00:20:30,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21432 states. [2020-11-12 00:20:30,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21432 to 9401. [2020-11-12 00:20:30,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9401 states, 9397 states have (on average 4.576992657231031) internal successors, (43010), 9400 states have internal predecessors, (43010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9401 states to 9401 states and 43010 transitions. [2020-11-12 00:20:30,606 INFO L78 Accepts]: Start accepts. Automaton has 9401 states and 43010 transitions. Word has length 23 [2020-11-12 00:20:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:30,606 INFO L481 AbstractCegarLoop]: Abstraction has 9401 states and 43010 transitions. [2020-11-12 00:20:30,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:30,607 INFO L276 IsEmpty]: Start isEmpty. Operand 9401 states and 43010 transitions. [2020-11-12 00:20:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-12 00:20:30,610 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:30,610 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:30,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-11-12 00:20:30,610 INFO L429 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-11-12 00:20:30,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:30,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1407046045, now seen corresponding path program 2 times [2020-11-12 00:20:30,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:30,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526471510] [2020-11-12 00:20:30,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:20:30,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526471510] [2020-11-12 00:20:30,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:30,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:20:30,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789615598] [2020-11-12 00:20:30,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:20:30,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:30,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:20:30,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:20:30,659 INFO L87 Difference]: Start difference. First operand 9401 states and 43010 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:31,019 INFO L93 Difference]: Finished difference Result 21218 states and 86469 transitions. [2020-11-12 00:20:31,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:20:31,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-12 00:20:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:31,070 INFO L225 Difference]: With dead ends: 21218 [2020-11-12 00:20:31,070 INFO L226 Difference]: Without dead ends: 21181 [2020-11-12 00:20:31,071 INFO L749 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-11-12 00:20:31,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21181 states. [2020-11-12 00:20:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21181 to 9396. [2020-11-12 00:20:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9396 states, 9392 states have (on average 4.5767674616695055) internal successors, (42985), 9395 states have internal predecessors, (42985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9396 states to 9396 states and 42985 transitions. [2020-11-12 00:20:31,668 INFO L78 Accepts]: Start accepts. Automaton has 9396 states and 42985 transitions. Word has length 23 [2020-11-12 00:20:31,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:31,668 INFO L481 AbstractCegarLoop]: Abstraction has 9396 states and 42985 transitions. [2020-11-12 00:20:31,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:31,668 INFO L276 IsEmpty]: Start isEmpty. Operand 9396 states and 42985 transitions. [2020-11-12 00:20:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-12 00:20:31,671 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:31,672 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:31,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-11-12 00:20:31,672 INFO L429 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-11-12 00:20:31,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:31,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1407043472, now seen corresponding path program 2 times [2020-11-12 00:20:31,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:31,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515357814] [2020-11-12 00:20:31,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:20:31,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515357814] [2020-11-12 00:20:31,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:31,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:20:31,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824068462] [2020-11-12 00:20:31,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:20:31,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:31,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:20:31,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:20:31,717 INFO L87 Difference]: Start difference. First operand 9396 states and 42985 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:32,128 INFO L93 Difference]: Finished difference Result 21067 states and 85734 transitions. [2020-11-12 00:20:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:20:32,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-12 00:20:32,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:32,191 INFO L225 Difference]: With dead ends: 21067 [2020-11-12 00:20:32,191 INFO L226 Difference]: Without dead ends: 21030 [2020-11-12 00:20:32,191 INFO L749 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-11-12 00:20:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21030 states. [2020-11-12 00:20:32,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21030 to 9426. [2020-11-12 00:20:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9426 states, 9422 states have (on average 4.569836552748885) internal successors, (43057), 9425 states have internal predecessors, (43057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 43057 transitions. [2020-11-12 00:20:32,677 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 43057 transitions. Word has length 23 [2020-11-12 00:20:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:32,677 INFO L481 AbstractCegarLoop]: Abstraction has 9426 states and 43057 transitions. [2020-11-12 00:20:32,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 43057 transitions. [2020-11-12 00:20:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:20:32,682 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:32,682 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:32,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-11-12 00:20:32,682 INFO L429 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-11-12 00:20:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:32,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1691093891, now seen corresponding path program 1 times [2020-11-12 00:20:32,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:32,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062532820] [2020-11-12 00:20:32,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:20:32,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062532820] [2020-11-12 00:20:32,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744876242] [2020-11-12 00:20:32,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:32,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:20:32,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:20:32,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:32,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:20:32,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548675477] [2020-11-12 00:20:32,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:20:32,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:32,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:20:32,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:20:32,926 INFO L87 Difference]: Start difference. First operand 9426 states and 43057 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:34,130 INFO L93 Difference]: Finished difference Result 30145 states and 115754 transitions. [2020-11-12 00:20:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:34,130 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:20:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:34,202 INFO L225 Difference]: With dead ends: 30145 [2020-11-12 00:20:34,202 INFO L226 Difference]: Without dead ends: 30125 [2020-11-12 00:20:34,202 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:20:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30125 states. [2020-11-12 00:20:34,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30125 to 9346. [2020-11-12 00:20:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9346 states, 9342 states have (on average 4.560265467779919) internal successors, (42602), 9345 states have internal predecessors, (42602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9346 states to 9346 states and 42602 transitions. [2020-11-12 00:20:34,695 INFO L78 Accepts]: Start accepts. Automaton has 9346 states and 42602 transitions. Word has length 25 [2020-11-12 00:20:34,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:34,696 INFO L481 AbstractCegarLoop]: Abstraction has 9346 states and 42602 transitions. [2020-11-12 00:20:34,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 9346 states and 42602 transitions. [2020-11-12 00:20:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:20:34,699 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:34,700 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:34,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-11-12 00:20:34,901 INFO L429 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-11-12 00:20:34,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:34,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1426316831, now seen corresponding path program 1 times [2020-11-12 00:20:34,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:34,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984213339] [2020-11-12 00:20:34,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-12 00:20:34,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984213339] [2020-11-12 00:20:34,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82145689] [2020-11-12 00:20:34,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:35,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:20:35,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-12 00:20:35,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:35,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:20:35,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309906631] [2020-11-12 00:20:35,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:20:35,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:35,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:20:35,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:20:35,295 INFO L87 Difference]: Start difference. First operand 9346 states and 42602 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:36,149 INFO L93 Difference]: Finished difference Result 29704 states and 113936 transitions. [2020-11-12 00:20:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:36,150 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:20:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:36,221 INFO L225 Difference]: With dead ends: 29704 [2020-11-12 00:20:36,221 INFO L226 Difference]: Without dead ends: 29684 [2020-11-12 00:20:36,222 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:20:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29684 states. [2020-11-12 00:20:36,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29684 to 9291. [2020-11-12 00:20:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9291 states, 9287 states have (on average 4.554215570151825) internal successors, (42295), 9290 states have internal predecessors, (42295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 42295 transitions. [2020-11-12 00:20:36,708 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 42295 transitions. Word has length 25 [2020-11-12 00:20:36,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:36,708 INFO L481 AbstractCegarLoop]: Abstraction has 9291 states and 42295 transitions. [2020-11-12 00:20:36,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 42295 transitions. [2020-11-12 00:20:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:20:36,711 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:36,712 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:36,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:36,912 INFO L429 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-11-12 00:20:36,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:36,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1328859133, now seen corresponding path program 2 times [2020-11-12 00:20:36,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:36,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924760943] [2020-11-12 00:20:36,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-12 00:20:37,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924760943] [2020-11-12 00:20:37,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468642294] [2020-11-12 00:20:37,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 00:20:37,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-12 00:20:37,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-12 00:20:37,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:20:37,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-12 00:20:37,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:37,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:20:37,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934492322] [2020-11-12 00:20:37,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:20:37,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:37,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:20:37,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:20:37,252 INFO L87 Difference]: Start difference. First operand 9291 states and 42295 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:38,127 INFO L93 Difference]: Finished difference Result 29267 states and 112142 transitions. [2020-11-12 00:20:38,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:38,128 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:20:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:38,198 INFO L225 Difference]: With dead ends: 29267 [2020-11-12 00:20:38,198 INFO L226 Difference]: Without dead ends: 29245 [2020-11-12 00:20:38,198 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:20:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2020-11-12 00:20:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 9288. [2020-11-12 00:20:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9288 states, 9284 states have (on average 4.549978457561396) internal successors, (42242), 9287 states have internal predecessors, (42242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 42242 transitions. [2020-11-12 00:20:38,902 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 42242 transitions. Word has length 25 [2020-11-12 00:20:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:38,903 INFO L481 AbstractCegarLoop]: Abstraction has 9288 states and 42242 transitions. [2020-11-12 00:20:38,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 42242 transitions. [2020-11-12 00:20:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:20:38,907 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:38,907 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:39,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:39,122 INFO L429 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-11-12 00:20:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:39,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1328830489, now seen corresponding path program 2 times [2020-11-12 00:20:39,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:39,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283125432] [2020-11-12 00:20:39,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-12 00:20:39,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283125432] [2020-11-12 00:20:39,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7123377] [2020-11-12 00:20:39,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 00:20:39,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-12 00:20:39,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-12 00:20:39,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:20:39,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-12 00:20:39,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:39,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:20:39,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207595722] [2020-11-12 00:20:39,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:20:39,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:39,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:20:39,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:20:39,360 INFO L87 Difference]: Start difference. First operand 9288 states and 42242 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:40,334 INFO L93 Difference]: Finished difference Result 28920 states and 110796 transitions. [2020-11-12 00:20:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:40,335 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:20:40,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:40,414 INFO L225 Difference]: With dead ends: 28920 [2020-11-12 00:20:40,414 INFO L226 Difference]: Without dead ends: 28898 [2020-11-12 00:20:40,414 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:20:40,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28898 states. [2020-11-12 00:20:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28898 to 9176. [2020-11-12 00:20:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9176 states, 9172 states have (on average 4.54590056694287) internal successors, (41695), 9175 states have internal predecessors, (41695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 41695 transitions. [2020-11-12 00:20:41,242 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 41695 transitions. Word has length 25 [2020-11-12 00:20:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:41,242 INFO L481 AbstractCegarLoop]: Abstraction has 9176 states and 41695 transitions. [2020-11-12 00:20:41,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 41695 transitions. [2020-11-12 00:20:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:20:41,248 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:41,248 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:41,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2020-11-12 00:20:41,456 INFO L429 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-11-12 00:20:41,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:41,456 INFO L82 PathProgramCache]: Analyzing trace with hash -660048701, now seen corresponding path program 3 times [2020-11-12 00:20:41,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:41,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136921872] [2020-11-12 00:20:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:41,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136921872] [2020-11-12 00:20:41,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753227221] [2020-11-12 00:20:41,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 00:20:41,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-11-12 00:20:41,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-12 00:20:41,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:20:41,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:41,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:41,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:20:41,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752150034] [2020-11-12 00:20:41,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:20:41,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:41,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:20:41,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:20:41,665 INFO L87 Difference]: Start difference. First operand 9176 states and 41695 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:42,521 INFO L93 Difference]: Finished difference Result 29030 states and 111196 transitions. [2020-11-12 00:20:42,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:42,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:20:42,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:42,592 INFO L225 Difference]: With dead ends: 29030 [2020-11-12 00:20:42,592 INFO L226 Difference]: Without dead ends: 29010 [2020-11-12 00:20:42,592 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:20:42,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29010 states. [2020-11-12 00:20:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29010 to 9004. [2020-11-12 00:20:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9004 states, 9000 states have (on average 4.545) internal successors, (40905), 9003 states have internal predecessors, (40905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9004 states to 9004 states and 40905 transitions. [2020-11-12 00:20:43,064 INFO L78 Accepts]: Start accepts. Automaton has 9004 states and 40905 transitions. Word has length 25 [2020-11-12 00:20:43,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:43,065 INFO L481 AbstractCegarLoop]: Abstraction has 9004 states and 40905 transitions. [2020-11-12 00:20:43,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 9004 states and 40905 transitions. [2020-11-12 00:20:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:20:43,227 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:43,227 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:43,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-11-12 00:20:43,428 INFO L429 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-11-12 00:20:43,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:43,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2044469560, now seen corresponding path program 1 times [2020-11-12 00:20:43,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:43,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248873901] [2020-11-12 00:20:43,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:43,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248873901] [2020-11-12 00:20:43,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011439854] [2020-11-12 00:20:43,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:43,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:20:43,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:43,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:43,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:20:43,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796595689] [2020-11-12 00:20:43,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:20:43,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:43,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:20:43,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:20:43,638 INFO L87 Difference]: Start difference. First operand 9004 states and 40905 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:44,571 INFO L93 Difference]: Finished difference Result 29417 states and 113034 transitions. [2020-11-12 00:20:44,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:44,571 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:20:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:44,642 INFO L225 Difference]: With dead ends: 29417 [2020-11-12 00:20:44,642 INFO L226 Difference]: Without dead ends: 29397 [2020-11-12 00:20:44,643 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:20:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29397 states. [2020-11-12 00:20:45,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29397 to 8986. [2020-11-12 00:20:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8986 states, 8982 states have (on average 4.539523491427299) internal successors, (40774), 8985 states have internal predecessors, (40774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8986 states to 8986 states and 40774 transitions. [2020-11-12 00:20:45,121 INFO L78 Accepts]: Start accepts. Automaton has 8986 states and 40774 transitions. Word has length 25 [2020-11-12 00:20:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:45,123 INFO L481 AbstractCegarLoop]: Abstraction has 8986 states and 40774 transitions. [2020-11-12 00:20:45,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 8986 states and 40774 transitions. [2020-11-12 00:20:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:20:45,128 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:45,128 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:45,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2020-11-12 00:20:45,328 INFO L429 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-11-12 00:20:45,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:45,329 INFO L82 PathProgramCache]: Analyzing trace with hash -504652157, now seen corresponding path program 4 times [2020-11-12 00:20:45,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:45,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287994625] [2020-11-12 00:20:45,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:45,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287994625] [2020-11-12 00:20:45,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62160037] [2020-11-12 00:20:45,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 00:20:45,647 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-12 00:20:45,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-12 00:20:45,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:20:45,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:45,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:45,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:20:45,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491609693] [2020-11-12 00:20:45,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:20:45,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:45,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:20:45,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:20:45,676 INFO L87 Difference]: Start difference. First operand 8986 states and 40774 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:46,582 INFO L93 Difference]: Finished difference Result 28867 states and 110566 transitions. [2020-11-12 00:20:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:46,583 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:20:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:46,662 INFO L225 Difference]: With dead ends: 28867 [2020-11-12 00:20:46,662 INFO L226 Difference]: Without dead ends: 28845 [2020-11-12 00:20:46,662 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:20:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28845 states. [2020-11-12 00:20:47,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28845 to 8983. [2020-11-12 00:20:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8983 states, 8979 states have (on average 4.535137543156253) internal successors, (40721), 8982 states have internal predecessors, (40721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8983 states to 8983 states and 40721 transitions. [2020-11-12 00:20:47,144 INFO L78 Accepts]: Start accepts. Automaton has 8983 states and 40721 transitions. Word has length 25 [2020-11-12 00:20:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:47,144 INFO L481 AbstractCegarLoop]: Abstraction has 8983 states and 40721 transitions. [2020-11-12 00:20:47,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 8983 states and 40721 transitions. [2020-11-12 00:20:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:20:47,147 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:47,147 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:47,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:47,348 INFO L429 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-11-12 00:20:47,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:47,349 INFO L82 PathProgramCache]: Analyzing trace with hash -504649584, now seen corresponding path program 2 times [2020-11-12 00:20:47,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:47,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115221441] [2020-11-12 00:20:47,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:47,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115221441] [2020-11-12 00:20:47,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750357422] [2020-11-12 00:20:47,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 00:20:47,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-12 00:20:47,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-12 00:20:47,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:20:47,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:20:47,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:47,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:20:47,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366301434] [2020-11-12 00:20:47,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:20:47,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:47,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:20:47,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:20:47,738 INFO L87 Difference]: Start difference. First operand 8983 states and 40721 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:48,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:48,633 INFO L93 Difference]: Finished difference Result 28717 states and 110206 transitions. [2020-11-12 00:20:48,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:48,633 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:20:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:48,714 INFO L225 Difference]: With dead ends: 28717 [2020-11-12 00:20:48,714 INFO L226 Difference]: Without dead ends: 28690 [2020-11-12 00:20:48,715 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:20:48,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28690 states. [2020-11-12 00:20:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28690 to 8841. [2020-11-12 00:20:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8841 states, 8837 states have (on average 4.532986307570442) internal successors, (40058), 8840 states have internal predecessors, (40058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 40058 transitions. [2020-11-12 00:20:49,200 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 40058 transitions. Word has length 25 [2020-11-12 00:20:49,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:49,200 INFO L481 AbstractCegarLoop]: Abstraction has 8841 states and 40058 transitions. [2020-11-12 00:20:49,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 40058 transitions. [2020-11-12 00:20:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:20:49,204 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:49,204 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:49,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:49,411 INFO L429 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-11-12 00:20:49,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:49,412 INFO L82 PathProgramCache]: Analyzing trace with hash 349480136, now seen corresponding path program 3 times [2020-11-12 00:20:49,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:49,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340276478] [2020-11-12 00:20:49,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-12 00:20:49,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340276478] [2020-11-12 00:20:49,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582165706] [2020-11-12 00:20:49,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 00:20:49,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-11-12 00:20:49,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-12 00:20:49,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:20:49,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-12 00:20:49,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:49,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:20:49,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54770577] [2020-11-12 00:20:49,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:20:49,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:49,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:20:49,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:20:49,631 INFO L87 Difference]: Start difference. First operand 8841 states and 40058 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:50,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:50,670 INFO L93 Difference]: Finished difference Result 28636 states and 109852 transitions. [2020-11-12 00:20:50,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:50,671 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:20:50,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:50,748 INFO L225 Difference]: With dead ends: 28636 [2020-11-12 00:20:50,748 INFO L226 Difference]: Without dead ends: 28616 [2020-11-12 00:20:50,749 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:20:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28616 states. [2020-11-12 00:20:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28616 to 8710. [2020-11-12 00:20:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8710 states, 8706 states have (on average 4.531817137606248) internal successors, (39454), 8709 states have internal predecessors, (39454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8710 states to 8710 states and 39454 transitions. [2020-11-12 00:20:51,289 INFO L78 Accepts]: Start accepts. Automaton has 8710 states and 39454 transitions. Word has length 25 [2020-11-12 00:20:51,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:51,289 INFO L481 AbstractCegarLoop]: Abstraction has 8710 states and 39454 transitions. [2020-11-12 00:20:51,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:51,289 INFO L276 IsEmpty]: Start isEmpty. Operand 8710 states and 39454 transitions. [2020-11-12 00:20:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:20:51,293 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:51,293 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:51,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:20:51,497 INFO L429 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-11-12 00:20:51,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:51,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1126161297, now seen corresponding path program 3 times [2020-11-12 00:20:51,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:51,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165352617] [2020-11-12 00:20:51,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:51,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-12 00:20:51,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165352617] [2020-11-12 00:20:51,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877561335] [2020-11-12 00:20:51,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 00:20:51,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-11-12 00:20:51,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-12 00:20:51,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:20:51,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-12 00:20:51,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:51,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:20:51,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884244853] [2020-11-12 00:20:51,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:20:51,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:51,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:20:51,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:20:51,733 INFO L87 Difference]: Start difference. First operand 8710 states and 39454 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:52,697 INFO L93 Difference]: Finished difference Result 28297 states and 108461 transitions. [2020-11-12 00:20:52,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:52,697 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:20:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:52,767 INFO L225 Difference]: With dead ends: 28297 [2020-11-12 00:20:52,767 INFO L226 Difference]: Without dead ends: 28277 [2020-11-12 00:20:52,767 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:20:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28277 states. [2020-11-12 00:20:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28277 to 8600. [2020-11-12 00:20:53,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8600 states, 8596 states have (on average 4.535365286179618) internal successors, (38986), 8599 states have internal predecessors, (38986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8600 states to 8600 states and 38986 transitions. [2020-11-12 00:20:53,257 INFO L78 Accepts]: Start accepts. Automaton has 8600 states and 38986 transitions. Word has length 25 [2020-11-12 00:20:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:53,257 INFO L481 AbstractCegarLoop]: Abstraction has 8600 states and 38986 transitions. [2020-11-12 00:20:53,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 8600 states and 38986 transitions. [2020-11-12 00:20:53,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:20:53,260 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:53,261 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:53,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2020-11-12 00:20:53,461 INFO L429 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-11-12 00:20:53,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:53,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1552362424, now seen corresponding path program 4 times [2020-11-12 00:20:53,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:53,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540030338] [2020-11-12 00:20:53,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-12 00:20:53,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540030338] [2020-11-12 00:20:53,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523306710] [2020-11-12 00:20:53,522 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 00:20:53,645 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-12 00:20:53,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-12 00:20:53,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:20:53,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-12 00:20:53,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:53,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:20:53,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789165682] [2020-11-12 00:20:53,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:20:53,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:53,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:20:53,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:20:53,688 INFO L87 Difference]: Start difference. First operand 8600 states and 38986 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:54,671 INFO L93 Difference]: Finished difference Result 28565 states and 109596 transitions. [2020-11-12 00:20:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:54,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:20:54,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:54,740 INFO L225 Difference]: With dead ends: 28565 [2020-11-12 00:20:54,740 INFO L226 Difference]: Without dead ends: 28538 [2020-11-12 00:20:54,741 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:20:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2020-11-12 00:20:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8563. [2020-11-12 00:20:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8563 states, 8559 states have (on average 4.5342913891809795) internal successors, (38809), 8562 states have internal predecessors, (38809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 38809 transitions. [2020-11-12 00:20:55,197 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 38809 transitions. Word has length 25 [2020-11-12 00:20:55,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:55,197 INFO L481 AbstractCegarLoop]: Abstraction has 8563 states and 38809 transitions. [2020-11-12 00:20:55,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 38809 transitions. [2020-11-12 00:20:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:20:55,200 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:55,200 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:55,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2020-11-12 00:20:55,401 INFO L429 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-11-12 00:20:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:55,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1552336353, now seen corresponding path program 4 times [2020-11-12 00:20:55,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:55,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560235694] [2020-11-12 00:20:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-12 00:20:55,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560235694] [2020-11-12 00:20:55,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013240691] [2020-11-12 00:20:55,462 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 00:20:55,581 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-12 00:20:55,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-12 00:20:55,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:20:55,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:20:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-12 00:20:55,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:20:55,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:20:55,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077752482] [2020-11-12 00:20:55,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:20:55,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:55,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:20:55,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:20:55,608 INFO L87 Difference]: Start difference. First operand 8563 states and 38809 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:56,501 INFO L93 Difference]: Finished difference Result 28213 states and 108237 transitions. [2020-11-12 00:20:56,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:56,502 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:20:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:56,571 INFO L225 Difference]: With dead ends: 28213 [2020-11-12 00:20:56,571 INFO L226 Difference]: Without dead ends: 28186 [2020-11-12 00:20:56,572 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:20:56,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28186 states. [2020-11-12 00:20:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28186 to 8421. [2020-11-12 00:20:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8421 states, 8417 states have (on average 4.532018533919449) internal successors, (38146), 8420 states have internal predecessors, (38146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8421 states to 8421 states and 38146 transitions. [2020-11-12 00:20:57,096 INFO L78 Accepts]: Start accepts. Automaton has 8421 states and 38146 transitions. Word has length 25 [2020-11-12 00:20:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:57,096 INFO L481 AbstractCegarLoop]: Abstraction has 8421 states and 38146 transitions. [2020-11-12 00:20:57,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 8421 states and 38146 transitions. [2020-11-12 00:20:57,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:20:57,100 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:57,100 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:57,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2020-11-12 00:20:57,301 INFO L429 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-11-12 00:20:57,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:57,301 INFO L82 PathProgramCache]: Analyzing trace with hash 718383875, now seen corresponding path program 5 times [2020-11-12 00:20:57,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:57,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474375112] [2020-11-12 00:20:57,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:20:57,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474375112] [2020-11-12 00:20:57,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:57,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:20:57,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560687801] [2020-11-12 00:20:57,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:20:57,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:57,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:20:57,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:20:57,362 INFO L87 Difference]: Start difference. First operand 8421 states and 38146 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:58,212 INFO L93 Difference]: Finished difference Result 28226 states and 108274 transitions. [2020-11-12 00:20:58,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:58,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:20:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:58,282 INFO L225 Difference]: With dead ends: 28226 [2020-11-12 00:20:58,282 INFO L226 Difference]: Without dead ends: 28206 [2020-11-12 00:20:58,283 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:20:58,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28206 states. [2020-11-12 00:20:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28206 to 8277. [2020-11-12 00:20:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8277 states, 8273 states have (on average 4.531246222652) internal successors, (37487), 8276 states have internal predecessors, (37487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 37487 transitions. [2020-11-12 00:20:58,779 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 37487 transitions. Word has length 25 [2020-11-12 00:20:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:20:58,779 INFO L481 AbstractCegarLoop]: Abstraction has 8277 states and 37487 transitions. [2020-11-12 00:20:58,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 37487 transitions. [2020-11-12 00:20:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:20:58,783 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:20:58,783 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:20:58,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-11-12 00:20:58,784 INFO L429 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-11-12 00:20:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:20:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash 718386448, now seen corresponding path program 5 times [2020-11-12 00:20:58,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:20:58,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768185462] [2020-11-12 00:20:58,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:20:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:20:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:20:58,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768185462] [2020-11-12 00:20:58,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:20:58,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:20:58,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609722373] [2020-11-12 00:20:58,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:20:58,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:20:58,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:20:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:20:58,840 INFO L87 Difference]: Start difference. First operand 8277 states and 37487 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:20:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:20:59,742 INFO L93 Difference]: Finished difference Result 27801 states and 106552 transitions. [2020-11-12 00:20:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:20:59,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:20:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:20:59,829 INFO L225 Difference]: With dead ends: 27801 [2020-11-12 00:20:59,829 INFO L226 Difference]: Without dead ends: 27781 [2020-11-12 00:20:59,830 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:21:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27781 states. [2020-11-12 00:21:00,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27781 to 8127. [2020-11-12 00:21:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8127 states, 8123 states have (on average 4.531084574664533) internal successors, (36806), 8126 states have internal predecessors, (36806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8127 states to 8127 states and 36806 transitions. [2020-11-12 00:21:00,370 INFO L78 Accepts]: Start accepts. Automaton has 8127 states and 36806 transitions. Word has length 25 [2020-11-12 00:21:00,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:00,370 INFO L481 AbstractCegarLoop]: Abstraction has 8127 states and 36806 transitions. [2020-11-12 00:21:00,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 8127 states and 36806 transitions. [2020-11-12 00:21:00,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:21:00,374 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:00,374 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:00,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-11-12 00:21:00,374 INFO L429 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-11-12 00:21:00,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:00,374 INFO L82 PathProgramCache]: Analyzing trace with hash 743412035, now seen corresponding path program 6 times [2020-11-12 00:21:00,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:00,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683900064] [2020-11-12 00:21:00,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:21:00,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683900064] [2020-11-12 00:21:00,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:21:00,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:21:00,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627109649] [2020-11-12 00:21:00,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:21:00,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:00,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:21:00,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:21:00,444 INFO L87 Difference]: Start difference. First operand 8127 states and 36806 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:01,280 INFO L93 Difference]: Finished difference Result 27548 states and 105447 transitions. [2020-11-12 00:21:01,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:21:01,281 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:21:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:01,357 INFO L225 Difference]: With dead ends: 27548 [2020-11-12 00:21:01,358 INFO L226 Difference]: Without dead ends: 27521 [2020-11-12 00:21:01,358 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:21:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27521 states. [2020-11-12 00:21:01,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27521 to 7841. [2020-11-12 00:21:01,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7841 states, 7837 states have (on average 4.539747352303177) internal successors, (35578), 7840 states have internal predecessors, (35578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7841 states to 7841 states and 35578 transitions. [2020-11-12 00:21:01,797 INFO L78 Accepts]: Start accepts. Automaton has 7841 states and 35578 transitions. Word has length 25 [2020-11-12 00:21:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:01,797 INFO L481 AbstractCegarLoop]: Abstraction has 7841 states and 35578 transitions. [2020-11-12 00:21:01,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 7841 states and 35578 transitions. [2020-11-12 00:21:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:21:01,800 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:01,800 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:01,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-11-12 00:21:01,801 INFO L429 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-11-12 00:21:01,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:01,801 INFO L82 PathProgramCache]: Analyzing trace with hash 743440679, now seen corresponding path program 5 times [2020-11-12 00:21:01,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:01,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411908921] [2020-11-12 00:21:01,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:21:01,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411908921] [2020-11-12 00:21:01,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:21:01,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:21:01,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060053323] [2020-11-12 00:21:01,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:21:01,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:01,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:21:01,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:21:01,873 INFO L87 Difference]: Start difference. First operand 7841 states and 35578 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:02,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:02,727 INFO L93 Difference]: Finished difference Result 27167 states and 103966 transitions. [2020-11-12 00:21:02,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:21:02,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:21:02,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:02,800 INFO L225 Difference]: With dead ends: 27167 [2020-11-12 00:21:02,800 INFO L226 Difference]: Without dead ends: 27147 [2020-11-12 00:21:02,801 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:21:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27147 states. [2020-11-12 00:21:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27147 to 7743. [2020-11-12 00:21:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7743 states, 7739 states have (on average 4.5408967566869105) internal successors, (35142), 7742 states have internal predecessors, (35142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7743 states to 7743 states and 35142 transitions. [2020-11-12 00:21:03,308 INFO L78 Accepts]: Start accepts. Automaton has 7743 states and 35142 transitions. Word has length 25 [2020-11-12 00:21:03,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:03,308 INFO L481 AbstractCegarLoop]: Abstraction has 7743 states and 35142 transitions. [2020-11-12 00:21:03,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 7743 states and 35142 transitions. [2020-11-12 00:21:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:21:03,311 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:03,311 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:03,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-11-12 00:21:03,312 INFO L429 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-11-12 00:21:03,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:03,312 INFO L82 PathProgramCache]: Analyzing trace with hash 745884688, now seen corresponding path program 6 times [2020-11-12 00:21:03,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:03,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134317482] [2020-11-12 00:21:03,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:21:03,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134317482] [2020-11-12 00:21:03,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:21:03,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:21:03,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450449869] [2020-11-12 00:21:03,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:21:03,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:03,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:21:03,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:21:03,391 INFO L87 Difference]: Start difference. First operand 7743 states and 35142 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:04,405 INFO L93 Difference]: Finished difference Result 26955 states and 103085 transitions. [2020-11-12 00:21:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:21:04,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:21:04,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:04,477 INFO L225 Difference]: With dead ends: 26955 [2020-11-12 00:21:04,478 INFO L226 Difference]: Without dead ends: 26928 [2020-11-12 00:21:04,478 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:21:04,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26928 states. [2020-11-12 00:21:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26928 to 7532. [2020-11-12 00:21:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7532 states, 7528 states have (on average 4.55047821466525) internal successors, (34256), 7531 states have internal predecessors, (34256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:04,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7532 states to 7532 states and 34256 transitions. [2020-11-12 00:21:04,975 INFO L78 Accepts]: Start accepts. Automaton has 7532 states and 34256 transitions. Word has length 25 [2020-11-12 00:21:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:04,975 INFO L481 AbstractCegarLoop]: Abstraction has 7532 states and 34256 transitions. [2020-11-12 00:21:04,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 7532 states and 34256 transitions. [2020-11-12 00:21:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:21:04,978 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:04,978 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:04,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-11-12 00:21:04,979 INFO L429 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-11-12 00:21:04,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:04,979 INFO L82 PathProgramCache]: Analyzing trace with hash 745910759, now seen corresponding path program 6 times [2020-11-12 00:21:04,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:04,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927256283] [2020-11-12 00:21:04,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:21:05,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927256283] [2020-11-12 00:21:05,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:21:05,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:21:05,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885477126] [2020-11-12 00:21:05,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:21:05,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:05,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:21:05,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:21:05,058 INFO L87 Difference]: Start difference. First operand 7532 states and 34256 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:06,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:06,187 INFO L93 Difference]: Finished difference Result 26632 states and 101828 transitions. [2020-11-12 00:21:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:21:06,187 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:21:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:06,266 INFO L225 Difference]: With dead ends: 26632 [2020-11-12 00:21:06,266 INFO L226 Difference]: Without dead ends: 26605 [2020-11-12 00:21:06,266 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-11-12 00:21:06,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26605 states. [2020-11-12 00:21:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26605 to 7269. [2020-11-12 00:21:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7269 states, 7265 states have (on average 4.563523743977977) internal successors, (33154), 7268 states have internal predecessors, (33154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7269 states to 7269 states and 33154 transitions. [2020-11-12 00:21:06,746 INFO L78 Accepts]: Start accepts. Automaton has 7269 states and 33154 transitions. Word has length 25 [2020-11-12 00:21:06,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:06,746 INFO L481 AbstractCegarLoop]: Abstraction has 7269 states and 33154 transitions. [2020-11-12 00:21:06,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 7269 states and 33154 transitions. [2020-11-12 00:21:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-12 00:21:06,750 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:06,750 INFO L494 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:06,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-11-12 00:21:06,750 INFO L429 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-11-12 00:21:06,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:06,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1279067299, now seen corresponding path program 1 times [2020-11-12 00:21:06,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:06,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538964806] [2020-11-12 00:21:06,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-11-12 00:21:06,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538964806] [2020-11-12 00:21:06,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:21:06,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:21:06,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189250644] [2020-11-12 00:21:06,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:21:06,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:06,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:21:06,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:21:06,786 INFO L87 Difference]: Start difference. First operand 7269 states and 33154 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:06,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:06,955 INFO L93 Difference]: Finished difference Result 11919 states and 51979 transitions. [2020-11-12 00:21:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:21:06,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2020-11-12 00:21:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:06,984 INFO L225 Difference]: With dead ends: 11919 [2020-11-12 00:21:06,985 INFO L226 Difference]: Without dead ends: 11887 [2020-11-12 00:21:06,985 INFO L749 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-11-12 00:21:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2020-11-12 00:21:07,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 8560. [2020-11-12 00:21:07,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8560 states, 8556 states have (on average 4.499181860682562) internal successors, (38495), 8559 states have internal predecessors, (38495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 38495 transitions. [2020-11-12 00:21:07,254 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 38495 transitions. Word has length 25 [2020-11-12 00:21:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:07,254 INFO L481 AbstractCegarLoop]: Abstraction has 8560 states and 38495 transitions. [2020-11-12 00:21:07,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 38495 transitions. [2020-11-12 00:21:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-12 00:21:07,258 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:07,258 INFO L494 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:07,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-11-12 00:21:07,258 INFO L429 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-11-12 00:21:07,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:07,259 INFO L82 PathProgramCache]: Analyzing trace with hash 989815361, now seen corresponding path program 1 times [2020-11-12 00:21:07,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:07,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393117546] [2020-11-12 00:21:07,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 00:21:07,267 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 00:21:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 00:21:07,274 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 00:21:07,282 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-12 00:21:07,282 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-12 00:21:07,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-11-12 00:21:07,283 WARN L386 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-11-12 00:21:07,283 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-11-12 00:21:07,305 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,306 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,306 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,306 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,306 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,306 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,306 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,306 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,306 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,306 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,306 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,307 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,307 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,307 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,307 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,307 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,307 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,307 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,307 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,307 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,307 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,308 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,308 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,308 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,308 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,308 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,308 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,308 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,308 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,308 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,308 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,309 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,309 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,309 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,309 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,309 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,309 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,309 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,309 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,309 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,309 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,309 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,310 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,310 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,310 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,310 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,310 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,310 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,310 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,310 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,310 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,310 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,310 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,311 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,311 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,311 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,311 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,311 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,311 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,311 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,311 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,311 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,311 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,311 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,312 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,312 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,312 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,312 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,312 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,312 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,312 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,312 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,312 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,313 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,313 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,313 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,313 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,313 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,313 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,313 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,313 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,313 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,314 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,314 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,314 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,314 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,314 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,314 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,314 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,314 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,314 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,315 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,315 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,315 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,315 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,315 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,315 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,315 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,315 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,315 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,315 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,316 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,316 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,316 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,316 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,316 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,316 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,316 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,320 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,323 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,324 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,324 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,325 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,326 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,326 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,327 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,327 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,328 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,328 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,329 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,329 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,330 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,330 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,331 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,331 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,332 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,332 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,333 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,333 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,334 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,334 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,335 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,336 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,336 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,337 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,337 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,338 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,338 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,339 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,339 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,340 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,340 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,341 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,341 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,342 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,342 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,343 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,343 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,344 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,344 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_reach_error_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,345 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_reach_error_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,345 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,345 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,345 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,346 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,346 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,346 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,347 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,347 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,347 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,347 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,348 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,348 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,348 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,348 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,348 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,350 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,350 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,350 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,350 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,351 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,352 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,352 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,352 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,352 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,352 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,353 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,353 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,353 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork1_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,353 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,353 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:21:07,354 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-12 00:21:07,354 INFO L253 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-11-12 00:21:07,355 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 00:21:07,355 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 00:21:07,355 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 00:21:07,355 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 00:21:07,355 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 00:21:07,355 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 00:21:07,355 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 00:21:07,355 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 00:21:07,357 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-12 00:21:07,357 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 175 transitions, 470 flow [2020-11-12 00:21:07,357 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 175 transitions, 470 flow [2020-11-12 00:21:07,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 188 places, 175 transitions, 470 flow [2020-11-12 00:21:07,381 INFO L129 PetriNetUnfolder]: 9/180 cut-off events. [2020-11-12 00:21:07,381 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-11-12 00:21:07,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 180 events. 9/180 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 323 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 215. Up to 14 conditions per place. [2020-11-12 00:21:07,390 INFO L116 LiptonReduction]: Number of co-enabled transitions 4212 [2020-11-12 00:21:12,596 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2020-11-12 00:21:12,752 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-12 00:21:12,862 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-12 00:21:12,980 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-12 00:21:13,088 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-11-12 00:21:14,139 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2020-11-12 00:21:14,306 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-12 00:21:14,633 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2020-11-12 00:21:14,777 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-12 00:21:14,975 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2020-11-12 00:21:15,116 INFO L131 LiptonReduction]: Checked pairs total: 6532 [2020-11-12 00:21:15,116 INFO L133 LiptonReduction]: Total number of compositions: 197 [2020-11-12 00:21:15,117 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 45 transitions, 210 flow [2020-11-12 00:21:17,183 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 18584 states, 18568 states have (on average 5.260825075398535) internal successors, (97683), 18583 states have internal predecessors, (97683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 18584 states, 18568 states have (on average 5.260825075398535) internal successors, (97683), 18583 states have internal predecessors, (97683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-12 00:21:17,210 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:17,210 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-12 00:21:17,210 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:21:17,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:17,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1680911, now seen corresponding path program 1 times [2020-11-12 00:21:17,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:17,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90503388] [2020-11-12 00:21:17,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:21:17,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90503388] [2020-11-12 00:21:17,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:21:17,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-12 00:21:17,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106087070] [2020-11-12 00:21:17,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:21:17,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:17,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:21:17,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:21:17,261 INFO L87 Difference]: Start difference. First operand has 18584 states, 18568 states have (on average 5.260825075398535) internal successors, (97683), 18583 states have internal predecessors, (97683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:17,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:17,461 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2020-11-12 00:21:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:21:17,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2020-11-12 00:21:17,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:17,524 INFO L225 Difference]: With dead ends: 17885 [2020-11-12 00:21:17,524 INFO L226 Difference]: Without dead ends: 16791 [2020-11-12 00:21:17,525 INFO L749 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-11-12 00:21:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2020-11-12 00:21:18,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16791. [2020-11-12 00:21:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16791 states, 16783 states have (on average 5.157480784126795) internal successors, (86558), 16790 states have internal predecessors, (86558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16791 states to 16791 states and 86558 transitions. [2020-11-12 00:21:18,432 INFO L78 Accepts]: Start accepts. Automaton has 16791 states and 86558 transitions. Word has length 3 [2020-11-12 00:21:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:18,432 INFO L481 AbstractCegarLoop]: Abstraction has 16791 states and 86558 transitions. [2020-11-12 00:21:18,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 16791 states and 86558 transitions. [2020-11-12 00:21:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-12 00:21:18,432 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:18,432 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:18,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-11-12 00:21:18,433 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:21:18,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:18,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1763653789, now seen corresponding path program 1 times [2020-11-12 00:21:18,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:18,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355190696] [2020-11-12 00:21:18,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:21:18,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355190696] [2020-11-12 00:21:18,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:21:18,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:21:18,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59652053] [2020-11-12 00:21:18,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:21:18,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:18,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:21:18,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:21:18,466 INFO L87 Difference]: Start difference. First operand 16791 states and 86558 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:18,839 INFO L93 Difference]: Finished difference Result 30985 states and 150574 transitions. [2020-11-12 00:21:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:21:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2020-11-12 00:21:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:18,941 INFO L225 Difference]: With dead ends: 30985 [2020-11-12 00:21:18,941 INFO L226 Difference]: Without dead ends: 30977 [2020-11-12 00:21:18,941 INFO L749 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-11-12 00:21:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30977 states. [2020-11-12 00:21:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30977 to 19868. [2020-11-12 00:21:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19868 states, 19861 states have (on average 5.204320024167967) internal successors, (103363), 19867 states have internal predecessors, (103363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19868 states to 19868 states and 103363 transitions. [2020-11-12 00:21:20,076 INFO L78 Accepts]: Start accepts. Automaton has 19868 states and 103363 transitions. Word has length 9 [2020-11-12 00:21:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:20,076 INFO L481 AbstractCegarLoop]: Abstraction has 19868 states and 103363 transitions. [2020-11-12 00:21:20,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 19868 states and 103363 transitions. [2020-11-12 00:21:20,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-12 00:21:20,077 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:20,077 INFO L494 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:20,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-11-12 00:21:20,077 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:21:20,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:20,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1607478829, now seen corresponding path program 1 times [2020-11-12 00:21:20,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:20,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695698785] [2020-11-12 00:21:20,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:21:20,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695698785] [2020-11-12 00:21:20,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:21:20,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:21:20,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492055101] [2020-11-12 00:21:20,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:21:20,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:20,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:21:20,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:21:20,128 INFO L87 Difference]: Start difference. First operand 19868 states and 103363 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:20,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:20,592 INFO L93 Difference]: Finished difference Result 36296 states and 178836 transitions. [2020-11-12 00:21:20,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:21:20,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2020-11-12 00:21:20,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:20,737 INFO L225 Difference]: With dead ends: 36296 [2020-11-12 00:21:20,737 INFO L226 Difference]: Without dead ends: 36280 [2020-11-12 00:21:20,737 INFO L749 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-11-12 00:21:21,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36280 states. [2020-11-12 00:21:22,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36280 to 23806. [2020-11-12 00:21:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23806 states, 23799 states have (on average 5.271439976469599) internal successors, (125455), 23805 states have internal predecessors, (125455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 125455 transitions. [2020-11-12 00:21:23,077 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 125455 transitions. Word has length 13 [2020-11-12 00:21:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:23,077 INFO L481 AbstractCegarLoop]: Abstraction has 23806 states and 125455 transitions. [2020-11-12 00:21:23,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 125455 transitions. [2020-11-12 00:21:23,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:21:23,078 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:23,078 INFO L494 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:23,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-11-12 00:21:23,078 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:21:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash -357379011, now seen corresponding path program 1 times [2020-11-12 00:21:23,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:23,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739178843] [2020-11-12 00:21:23,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:21:23,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739178843] [2020-11-12 00:21:23,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146760036] [2020-11-12 00:21:23,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:21:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:23,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-12 00:21:23,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:21:23,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:21:23,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:21:23,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-11-12 00:21:23,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816759685] [2020-11-12 00:21:23,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:21:23,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:23,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:21:23,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:21:23,273 INFO L87 Difference]: Start difference. First operand 23806 states and 125455 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:23,913 INFO L93 Difference]: Finished difference Result 56720 states and 262685 transitions. [2020-11-12 00:21:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:21:23,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:21:23,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:24,094 INFO L225 Difference]: With dead ends: 56720 [2020-11-12 00:21:24,094 INFO L226 Difference]: Without dead ends: 56704 [2020-11-12 00:21:24,094 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-11-12 00:21:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56704 states. [2020-11-12 00:21:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56704 to 23629. [2020-11-12 00:21:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23629 states, 23622 states have (on average 5.267039200745068) internal successors, (124418), 23628 states have internal predecessors, (124418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23629 states to 23629 states and 124418 transitions. [2020-11-12 00:21:26,407 INFO L78 Accepts]: Start accepts. Automaton has 23629 states and 124418 transitions. Word has length 15 [2020-11-12 00:21:26,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:26,407 INFO L481 AbstractCegarLoop]: Abstraction has 23629 states and 124418 transitions. [2020-11-12 00:21:26,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:26,407 INFO L276 IsEmpty]: Start isEmpty. Operand 23629 states and 124418 transitions. [2020-11-12 00:21:26,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:21:26,408 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:26,408 INFO L494 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:26,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-11-12 00:21:26,615 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:21:26,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:26,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1401068483, now seen corresponding path program 2 times [2020-11-12 00:21:26,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:26,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465987170] [2020-11-12 00:21:26,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:21:26,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465987170] [2020-11-12 00:21:26,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:21:26,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:21:26,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99210542] [2020-11-12 00:21:26,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:21:26,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:26,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:21:26,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:21:26,657 INFO L87 Difference]: Start difference. First operand 23629 states and 124418 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:27,267 INFO L93 Difference]: Finished difference Result 58078 states and 269185 transitions. [2020-11-12 00:21:27,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:21:27,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2020-11-12 00:21:27,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:27,455 INFO L225 Difference]: With dead ends: 58078 [2020-11-12 00:21:27,455 INFO L226 Difference]: Without dead ends: 58061 [2020-11-12 00:21:27,455 INFO L749 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-11-12 00:21:28,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58061 states. [2020-11-12 00:21:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58061 to 23109. [2020-11-12 00:21:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23109 states, 23103 states have (on average 5.26559321300264) internal successors, (121651), 23108 states have internal predecessors, (121651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 121651 transitions. [2020-11-12 00:21:29,993 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 121651 transitions. Word has length 15 [2020-11-12 00:21:29,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:29,994 INFO L481 AbstractCegarLoop]: Abstraction has 23109 states and 121651 transitions. [2020-11-12 00:21:29,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 121651 transitions. [2020-11-12 00:21:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-12 00:21:29,994 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:29,994 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:29,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-11-12 00:21:29,995 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:21:29,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:29,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1295943129, now seen corresponding path program 1 times [2020-11-12 00:21:29,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:29,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614122005] [2020-11-12 00:21:29,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:21:30,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614122005] [2020-11-12 00:21:30,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:21:30,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:21:30,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083277237] [2020-11-12 00:21:30,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:21:30,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:30,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:21:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:21:30,025 INFO L87 Difference]: Start difference. First operand 23109 states and 121651 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:30,672 INFO L93 Difference]: Finished difference Result 41885 states and 209629 transitions. [2020-11-12 00:21:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:21:30,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2020-11-12 00:21:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:30,844 INFO L225 Difference]: With dead ends: 41885 [2020-11-12 00:21:30,844 INFO L226 Difference]: Without dead ends: 41856 [2020-11-12 00:21:30,845 INFO L749 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-11-12 00:21:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41856 states. [2020-11-12 00:21:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41856 to 28237. [2020-11-12 00:21:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28237 states, 28231 states have (on average 5.322553221635791) internal successors, (150261), 28236 states have internal predecessors, (150261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28237 states to 28237 states and 150261 transitions. [2020-11-12 00:21:32,738 INFO L78 Accepts]: Start accepts. Automaton has 28237 states and 150261 transitions. Word has length 17 [2020-11-12 00:21:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:32,738 INFO L481 AbstractCegarLoop]: Abstraction has 28237 states and 150261 transitions. [2020-11-12 00:21:32,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 28237 states and 150261 transitions. [2020-11-12 00:21:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-12 00:21:32,738 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:32,739 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:32,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-11-12 00:21:32,739 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:21:32,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:32,739 INFO L82 PathProgramCache]: Analyzing trace with hash 549623863, now seen corresponding path program 1 times [2020-11-12 00:21:32,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:32,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108503766] [2020-11-12 00:21:32,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:21:32,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108503766] [2020-11-12 00:21:32,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802506051] [2020-11-12 00:21:32,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:21:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:32,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-12 00:21:32,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:21:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:21:32,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:21:32,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-11-12 00:21:32,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381588772] [2020-11-12 00:21:32,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:21:32,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:32,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:21:32,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:21:32,941 INFO L87 Difference]: Start difference. First operand 28237 states and 150261 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:34,079 INFO L93 Difference]: Finished difference Result 66831 states and 314874 transitions. [2020-11-12 00:21:34,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:21:34,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2020-11-12 00:21:34,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:34,295 INFO L225 Difference]: With dead ends: 66831 [2020-11-12 00:21:34,295 INFO L226 Difference]: Without dead ends: 66807 [2020-11-12 00:21:34,295 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-11-12 00:21:35,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66807 states. [2020-11-12 00:21:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66807 to 28673. [2020-11-12 00:21:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28673 states, 28667 states have (on average 5.315345170404996) internal successors, (152375), 28672 states have internal predecessors, (152375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28673 states to 28673 states and 152375 transitions. [2020-11-12 00:21:37,043 INFO L78 Accepts]: Start accepts. Automaton has 28673 states and 152375 transitions. Word has length 19 [2020-11-12 00:21:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:37,043 INFO L481 AbstractCegarLoop]: Abstraction has 28673 states and 152375 transitions. [2020-11-12 00:21:37,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 28673 states and 152375 transitions. [2020-11-12 00:21:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-12 00:21:37,044 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:37,044 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:37,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:21:37,245 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:21:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:37,245 INFO L82 PathProgramCache]: Analyzing trace with hash 139172279, now seen corresponding path program 2 times [2020-11-12 00:21:37,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:37,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217272027] [2020-11-12 00:21:37,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:21:37,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217272027] [2020-11-12 00:21:37,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:21:37,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:21:37,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452573331] [2020-11-12 00:21:37,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:21:37,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:37,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:21:37,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:21:37,290 INFO L87 Difference]: Start difference. First operand 28673 states and 152375 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:37,974 INFO L93 Difference]: Finished difference Result 68538 states and 323189 transitions. [2020-11-12 00:21:37,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:21:37,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2020-11-12 00:21:37,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:38,194 INFO L225 Difference]: With dead ends: 68538 [2020-11-12 00:21:38,194 INFO L226 Difference]: Without dead ends: 68505 [2020-11-12 00:21:38,194 INFO L749 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-11-12 00:21:39,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68505 states. [2020-11-12 00:21:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68505 to 28061. [2020-11-12 00:21:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28061 states, 28055 states have (on average 5.3219390482979865) internal successors, (149307), 28060 states have internal predecessors, (149307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28061 states to 28061 states and 149307 transitions. [2020-11-12 00:21:40,972 INFO L78 Accepts]: Start accepts. Automaton has 28061 states and 149307 transitions. Word has length 19 [2020-11-12 00:21:40,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:40,972 INFO L481 AbstractCegarLoop]: Abstraction has 28061 states and 149307 transitions. [2020-11-12 00:21:40,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 28061 states and 149307 transitions. [2020-11-12 00:21:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-12 00:21:40,973 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:40,974 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:40,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2020-11-12 00:21:40,974 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:21:40,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:40,974 INFO L82 PathProgramCache]: Analyzing trace with hash 139178386, now seen corresponding path program 1 times [2020-11-12 00:21:40,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:40,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620509906] [2020-11-12 00:21:40,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:21:41,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620509906] [2020-11-12 00:21:41,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:21:41,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:21:41,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032731709] [2020-11-12 00:21:41,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:21:41,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:41,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:21:41,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:21:41,026 INFO L87 Difference]: Start difference. First operand 28061 states and 149307 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:41,947 INFO L93 Difference]: Finished difference Result 69070 states and 326154 transitions. [2020-11-12 00:21:41,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:21:41,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2020-11-12 00:21:41,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:42,892 INFO L225 Difference]: With dead ends: 69070 [2020-11-12 00:21:42,893 INFO L226 Difference]: Without dead ends: 69037 [2020-11-12 00:21:42,893 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:21:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69037 states. [2020-11-12 00:21:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69037 to 28938. [2020-11-12 00:21:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28938 states, 28932 states have (on average 5.319680630443799) internal successors, (153909), 28937 states have internal predecessors, (153909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28938 states to 28938 states and 153909 transitions. [2020-11-12 00:21:45,346 INFO L78 Accepts]: Start accepts. Automaton has 28938 states and 153909 transitions. Word has length 19 [2020-11-12 00:21:45,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:45,346 INFO L481 AbstractCegarLoop]: Abstraction has 28938 states and 153909 transitions. [2020-11-12 00:21:45,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:45,346 INFO L276 IsEmpty]: Start isEmpty. Operand 28938 states and 153909 transitions. [2020-11-12 00:21:45,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-12 00:21:45,347 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:45,347 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:45,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-11-12 00:21:45,347 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:21:45,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:45,347 INFO L82 PathProgramCache]: Analyzing trace with hash 147927826, now seen corresponding path program 2 times [2020-11-12 00:21:45,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:45,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645546081] [2020-11-12 00:21:45,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:21:45,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645546081] [2020-11-12 00:21:45,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:21:45,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:21:45,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127166805] [2020-11-12 00:21:45,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:21:45,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:45,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:21:45,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:21:45,391 INFO L87 Difference]: Start difference. First operand 28938 states and 153909 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:46,058 INFO L93 Difference]: Finished difference Result 70096 states and 331298 transitions. [2020-11-12 00:21:46,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:21:46,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2020-11-12 00:21:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:47,053 INFO L225 Difference]: With dead ends: 70096 [2020-11-12 00:21:47,053 INFO L226 Difference]: Without dead ends: 70063 [2020-11-12 00:21:47,054 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-12 00:21:47,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70063 states. [2020-11-12 00:21:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70063 to 29094. [2020-11-12 00:21:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29094 states, 29088 states have (on average 5.324635588558856) internal successors, (154883), 29093 states have internal predecessors, (154883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 154883 transitions. [2020-11-12 00:21:49,625 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 154883 transitions. Word has length 19 [2020-11-12 00:21:49,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:49,625 INFO L481 AbstractCegarLoop]: Abstraction has 29094 states and 154883 transitions. [2020-11-12 00:21:49,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 154883 transitions. [2020-11-12 00:21:49,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:21:49,626 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:49,626 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:49,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-11-12 00:21:49,626 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:21:49,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:49,627 INFO L82 PathProgramCache]: Analyzing trace with hash -92435550, now seen corresponding path program 1 times [2020-11-12 00:21:49,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:49,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092209047] [2020-11-12 00:21:49,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:21:49,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092209047] [2020-11-12 00:21:49,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859767522] [2020-11-12 00:21:49,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:21:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:49,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:21:49,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:21:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:21:49,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:21:49,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:21:49,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738787918] [2020-11-12 00:21:49,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:21:49,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:49,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:21:49,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:21:49,882 INFO L87 Difference]: Start difference. First operand 29094 states and 154883 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:52,260 INFO L93 Difference]: Finished difference Result 100731 states and 448596 transitions. [2020-11-12 00:21:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:21:52,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:21:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:52,681 INFO L225 Difference]: With dead ends: 100731 [2020-11-12 00:21:52,681 INFO L226 Difference]: Without dead ends: 100715 [2020-11-12 00:21:52,681 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:21:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100715 states. [2020-11-12 00:21:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100715 to 28723. [2020-11-12 00:21:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28723 states, 28717 states have (on average 5.319915032907337) internal successors, (152772), 28722 states have internal predecessors, (152772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 152772 transitions. [2020-11-12 00:21:56,206 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 152772 transitions. Word has length 21 [2020-11-12 00:21:56,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:21:56,206 INFO L481 AbstractCegarLoop]: Abstraction has 28723 states and 152772 transitions. [2020-11-12 00:21:56,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 152772 transitions. [2020-11-12 00:21:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:21:56,208 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:21:56,208 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:21:56,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:21:56,424 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:21:56,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:21:56,425 INFO L82 PathProgramCache]: Analyzing trace with hash -83686110, now seen corresponding path program 2 times [2020-11-12 00:21:56,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:21:56,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407475304] [2020-11-12 00:21:56,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:21:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:21:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:21:56,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407475304] [2020-11-12 00:21:56,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345048450] [2020-11-12 00:21:56,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-12 00:21:56,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-12 00:21:56,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-12 00:21:56,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-12 00:21:56,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:21:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-12 00:21:56,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:21:56,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-11-12 00:21:56,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879636645] [2020-11-12 00:21:56,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 00:21:56,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:21:56,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 00:21:56,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-12 00:21:56,689 INFO L87 Difference]: Start difference. First operand 28723 states and 152772 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:21:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:21:58,003 INFO L93 Difference]: Finished difference Result 99884 states and 444368 transitions. [2020-11-12 00:21:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:21:58,004 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:21:58,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:21:59,040 INFO L225 Difference]: With dead ends: 99884 [2020-11-12 00:21:59,041 INFO L226 Difference]: Without dead ends: 99863 [2020-11-12 00:21:59,041 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-11-12 00:22:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99863 states. [2020-11-12 00:22:01,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99863 to 28343. [2020-11-12 00:22:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28343 states, 28337 states have (on average 5.315982637541024) internal successors, (150639), 28342 states have internal predecessors, (150639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28343 states to 28343 states and 150639 transitions. [2020-11-12 00:22:01,831 INFO L78 Accepts]: Start accepts. Automaton has 28343 states and 150639 transitions. Word has length 21 [2020-11-12 00:22:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:22:01,831 INFO L481 AbstractCegarLoop]: Abstraction has 28343 states and 150639 transitions. [2020-11-12 00:22:01,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 28343 states and 150639 transitions. [2020-11-12 00:22:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:22:01,832 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:22:01,832 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:22:02,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2020-11-12 00:22:02,033 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:22:02,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:22:02,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1233716929, now seen corresponding path program 1 times [2020-11-12 00:22:02,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:22:02,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970775234] [2020-11-12 00:22:02,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:22:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:22:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:22:02,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970775234] [2020-11-12 00:22:02,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:22:02,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:22:02,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309917085] [2020-11-12 00:22:02,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:22:02,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:22:02,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:22:02,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:22:02,062 INFO L87 Difference]: Start difference. First operand 28343 states and 150639 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:22:02,581 INFO L93 Difference]: Finished difference Result 50756 states and 257928 transitions. [2020-11-12 00:22:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:22:02,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:22:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:22:03,579 INFO L225 Difference]: With dead ends: 50756 [2020-11-12 00:22:03,579 INFO L226 Difference]: Without dead ends: 50710 [2020-11-12 00:22:03,594 INFO L749 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-11-12 00:22:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50710 states. [2020-11-12 00:22:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50710 to 35447. [2020-11-12 00:22:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35447 states, 35441 states have (on average 5.353347817499507) internal successors, (189728), 35446 states have internal predecessors, (189728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35447 states to 35447 states and 189728 transitions. [2020-11-12 00:22:05,988 INFO L78 Accepts]: Start accepts. Automaton has 35447 states and 189728 transitions. Word has length 21 [2020-11-12 00:22:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:22:05,988 INFO L481 AbstractCegarLoop]: Abstraction has 35447 states and 189728 transitions. [2020-11-12 00:22:05,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 35447 states and 189728 transitions. [2020-11-12 00:22:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:22:05,989 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:22:05,989 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:22:05,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2020-11-12 00:22:05,990 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:22:05,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:22:05,990 INFO L82 PathProgramCache]: Analyzing trace with hash 600583458, now seen corresponding path program 3 times [2020-11-12 00:22:05,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:22:05,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15957958] [2020-11-12 00:22:05,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:22:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:22:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:22:06,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15957958] [2020-11-12 00:22:06,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:22:06,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:22:06,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653826151] [2020-11-12 00:22:06,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:22:06,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:22:06,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:22:06,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:22:06,057 INFO L87 Difference]: Start difference. First operand 35447 states and 189728 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:08,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:22:08,281 INFO L93 Difference]: Finished difference Result 115906 states and 525370 transitions. [2020-11-12 00:22:08,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:22:08,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:22:08,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:22:08,791 INFO L225 Difference]: With dead ends: 115906 [2020-11-12 00:22:08,791 INFO L226 Difference]: Without dead ends: 115881 [2020-11-12 00:22:08,792 INFO L749 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-11-12 00:22:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115881 states. [2020-11-12 00:22:11,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115881 to 34544. [2020-11-12 00:22:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34544 states, 34538 states have (on average 5.353697376802363) internal successors, (184906), 34543 states have internal predecessors, (184906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:12,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34544 states to 34544 states and 184906 transitions. [2020-11-12 00:22:12,732 INFO L78 Accepts]: Start accepts. Automaton has 34544 states and 184906 transitions. Word has length 21 [2020-11-12 00:22:12,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:22:12,732 INFO L481 AbstractCegarLoop]: Abstraction has 34544 states and 184906 transitions. [2020-11-12 00:22:12,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:12,733 INFO L276 IsEmpty]: Start isEmpty. Operand 34544 states and 184906 transitions. [2020-11-12 00:22:12,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:22:12,734 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:22:12,734 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:22:12,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2020-11-12 00:22:12,734 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:22:12,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:22:12,735 INFO L82 PathProgramCache]: Analyzing trace with hash 606446178, now seen corresponding path program 4 times [2020-11-12 00:22:12,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:22:12,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822700183] [2020-11-12 00:22:12,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:22:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:22:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:22:12,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822700183] [2020-11-12 00:22:12,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:22:12,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:22:12,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845582088] [2020-11-12 00:22:12,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:22:12,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:22:12,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:22:12,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:22:12,806 INFO L87 Difference]: Start difference. First operand 34544 states and 184906 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:22:14,192 INFO L93 Difference]: Finished difference Result 115265 states and 522262 transitions. [2020-11-12 00:22:14,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:22:14,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:22:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:22:15,436 INFO L225 Difference]: With dead ends: 115265 [2020-11-12 00:22:15,436 INFO L226 Difference]: Without dead ends: 115235 [2020-11-12 00:22:15,436 INFO L749 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-11-12 00:22:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115235 states. [2020-11-12 00:22:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115235 to 33985. [2020-11-12 00:22:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33985 states, 33979 states have (on average 5.349686571117455) internal successors, (181777), 33984 states have internal predecessors, (181777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33985 states to 33985 states and 181777 transitions. [2020-11-12 00:22:18,778 INFO L78 Accepts]: Start accepts. Automaton has 33985 states and 181777 transitions. Word has length 21 [2020-11-12 00:22:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:22:18,778 INFO L481 AbstractCegarLoop]: Abstraction has 33985 states and 181777 transitions. [2020-11-12 00:22:18,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:18,778 INFO L276 IsEmpty]: Start isEmpty. Operand 33985 states and 181777 transitions. [2020-11-12 00:22:18,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:22:18,779 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:22:18,779 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:22:18,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2020-11-12 00:22:18,779 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:22:18,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:22:18,780 INFO L82 PathProgramCache]: Analyzing trace with hash 424723426, now seen corresponding path program 5 times [2020-11-12 00:22:18,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:22:18,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407869509] [2020-11-12 00:22:18,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:22:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:22:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:22:18,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407869509] [2020-11-12 00:22:18,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:22:18,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:22:18,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365122940] [2020-11-12 00:22:18,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:22:18,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:22:18,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:22:18,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:22:18,845 INFO L87 Difference]: Start difference. First operand 33985 states and 181777 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:20,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:22:20,951 INFO L93 Difference]: Finished difference Result 115592 states and 523747 transitions. [2020-11-12 00:22:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:22:20,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:22:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:22:21,331 INFO L225 Difference]: With dead ends: 115592 [2020-11-12 00:22:21,331 INFO L226 Difference]: Without dead ends: 115567 [2020-11-12 00:22:21,332 INFO L749 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-11-12 00:22:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115567 states. [2020-11-12 00:22:25,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115567 to 33082. [2020-11-12 00:22:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33082 states, 33076 states have (on average 5.34995162655702) internal successors, (176955), 33081 states have internal predecessors, (176955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33082 states to 33082 states and 176955 transitions. [2020-11-12 00:22:25,203 INFO L78 Accepts]: Start accepts. Automaton has 33082 states and 176955 transitions. Word has length 21 [2020-11-12 00:22:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:22:25,204 INFO L481 AbstractCegarLoop]: Abstraction has 33082 states and 176955 transitions. [2020-11-12 00:22:25,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 33082 states and 176955 transitions. [2020-11-12 00:22:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-12 00:22:25,205 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:22:25,205 INFO L494 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:22:25,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-11-12 00:22:25,205 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:22:25,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:22:25,206 INFO L82 PathProgramCache]: Analyzing trace with hash 427610146, now seen corresponding path program 6 times [2020-11-12 00:22:25,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:22:25,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813826626] [2020-11-12 00:22:25,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:22:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:22:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:22:25,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813826626] [2020-11-12 00:22:25,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:22:25,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 00:22:25,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131165643] [2020-11-12 00:22:25,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:22:25,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:22:25,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:22:25,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:22:25,263 INFO L87 Difference]: Start difference. First operand 33082 states and 176955 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:22:27,379 INFO L93 Difference]: Finished difference Result 114410 states and 517752 transitions. [2020-11-12 00:22:27,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 00:22:27,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2020-11-12 00:22:27,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:22:27,862 INFO L225 Difference]: With dead ends: 114410 [2020-11-12 00:22:27,862 INFO L226 Difference]: Without dead ends: 114379 [2020-11-12 00:22:27,862 INFO L749 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-11-12 00:22:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114379 states. [2020-11-12 00:22:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114379 to 31960. [2020-11-12 00:22:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31960 states, 31955 states have (on average 5.357815678297606) internal successors, (171209), 31959 states have internal predecessors, (171209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31960 states to 31960 states and 171209 transitions. [2020-11-12 00:22:31,494 INFO L78 Accepts]: Start accepts. Automaton has 31960 states and 171209 transitions. Word has length 21 [2020-11-12 00:22:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:22:31,495 INFO L481 AbstractCegarLoop]: Abstraction has 31960 states and 171209 transitions. [2020-11-12 00:22:31,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 31960 states and 171209 transitions. [2020-11-12 00:22:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-12 00:22:31,496 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:22:31,496 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:22:31,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-11-12 00:22:31,496 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:22:31,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:22:31,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1991023825, now seen corresponding path program 1 times [2020-11-12 00:22:31,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:22:31,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039393006] [2020-11-12 00:22:31,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:22:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:22:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:22:31,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039393006] [2020-11-12 00:22:31,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134146741] [2020-11-12 00:22:31,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:22:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:22:31,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-12 00:22:31,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:22:31,720 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-12 00:22:31,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:22:31,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-11-12 00:22:31,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580360219] [2020-11-12 00:22:31,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:22:31,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:22:31,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:22:31,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:22:31,722 INFO L87 Difference]: Start difference. First operand 31960 states and 171209 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:32,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:22:32,524 INFO L93 Difference]: Finished difference Result 75380 states and 361389 transitions. [2020-11-12 00:22:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:22:32,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-12 00:22:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:22:32,782 INFO L225 Difference]: With dead ends: 75380 [2020-11-12 00:22:32,783 INFO L226 Difference]: Without dead ends: 75344 [2020-11-12 00:22:32,783 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-11-12 00:22:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75344 states. [2020-11-12 00:22:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75344 to 32974. [2020-11-12 00:22:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32974 states, 32969 states have (on average 5.3493584882768666) internal successors, (176363), 32973 states have internal predecessors, (176363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32974 states to 32974 states and 176363 transitions. [2020-11-12 00:22:36,280 INFO L78 Accepts]: Start accepts. Automaton has 32974 states and 176363 transitions. Word has length 23 [2020-11-12 00:22:36,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:22:36,280 INFO L481 AbstractCegarLoop]: Abstraction has 32974 states and 176363 transitions. [2020-11-12 00:22:36,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 32974 states and 176363 transitions. [2020-11-12 00:22:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-12 00:22:36,283 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:22:36,283 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:22:36,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:22:36,497 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:22:36,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:22:36,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1563915694, now seen corresponding path program 1 times [2020-11-12 00:22:36,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:22:36,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960033465] [2020-11-12 00:22:36,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:22:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:22:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-12 00:22:36,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960033465] [2020-11-12 00:22:36,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141704152] [2020-11-12 00:22:36,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-12 00:22:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:22:36,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-12 00:22:36,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-12 00:22:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-12 00:22:36,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-12 00:22:36,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-11-12 00:22:36,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060689704] [2020-11-12 00:22:36,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 00:22:36,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:22:36,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 00:22:36,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-12 00:22:36,761 INFO L87 Difference]: Start difference. First operand 32974 states and 176363 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:37,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:22:37,688 INFO L93 Difference]: Finished difference Result 79463 states and 381713 transitions. [2020-11-12 00:22:37,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:22:37,688 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-12 00:22:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:22:38,053 INFO L225 Difference]: With dead ends: 79463 [2020-11-12 00:22:38,053 INFO L226 Difference]: Without dead ends: 79421 [2020-11-12 00:22:38,053 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-11-12 00:22:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79421 states. [2020-11-12 00:22:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79421 to 33977. [2020-11-12 00:22:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33977 states, 33972 states have (on average 5.348463440480396) internal successors, (181698), 33976 states have internal predecessors, (181698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33977 states to 33977 states and 181698 transitions. [2020-11-12 00:22:41,278 INFO L78 Accepts]: Start accepts. Automaton has 33977 states and 181698 transitions. Word has length 23 [2020-11-12 00:22:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:22:41,278 INFO L481 AbstractCegarLoop]: Abstraction has 33977 states and 181698 transitions. [2020-11-12 00:22:41,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 33977 states and 181698 transitions. [2020-11-12 00:22:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-12 00:22:41,280 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:22:41,280 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:22:41,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable93 [2020-11-12 00:22:41,482 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:22:41,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:22:41,482 INFO L82 PathProgramCache]: Analyzing trace with hash 190995474, now seen corresponding path program 2 times [2020-11-12 00:22:41,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:22:41,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521308883] [2020-11-12 00:22:41,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:22:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:22:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:22:41,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521308883] [2020-11-12 00:22:41,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:22:41,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:22:41,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361590697] [2020-11-12 00:22:41,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:22:41,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:22:41,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:22:41,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:22:41,525 INFO L87 Difference]: Start difference. First operand 33977 states and 181698 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:22:42,243 INFO L93 Difference]: Finished difference Result 80851 states and 388739 transitions. [2020-11-12 00:22:42,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:22:42,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-12 00:22:42,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:22:42,510 INFO L225 Difference]: With dead ends: 80851 [2020-11-12 00:22:42,511 INFO L226 Difference]: Without dead ends: 80796 [2020-11-12 00:22:42,511 INFO L749 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-11-12 00:22:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80796 states. [2020-11-12 00:22:45,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80796 to 34223. [2020-11-12 00:22:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34223 states, 34218 states have (on average 5.349026827985271) internal successors, (183033), 34222 states have internal predecessors, (183033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34223 states to 34223 states and 183033 transitions. [2020-11-12 00:22:45,834 INFO L78 Accepts]: Start accepts. Automaton has 34223 states and 183033 transitions. Word has length 23 [2020-11-12 00:22:45,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:22:45,834 INFO L481 AbstractCegarLoop]: Abstraction has 34223 states and 183033 transitions. [2020-11-12 00:22:45,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:45,834 INFO L276 IsEmpty]: Start isEmpty. Operand 34223 states and 183033 transitions. [2020-11-12 00:22:45,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-12 00:22:45,836 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:22:45,836 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:22:45,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2020-11-12 00:22:45,836 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:22:45,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:22:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash 190998481, now seen corresponding path program 2 times [2020-11-12 00:22:45,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:22:45,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550091015] [2020-11-12 00:22:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:22:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:22:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:22:45,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550091015] [2020-11-12 00:22:45,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:22:45,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:22:45,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839289723] [2020-11-12 00:22:45,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:22:45,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:22:45,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:22:45,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:22:45,878 INFO L87 Difference]: Start difference. First operand 34223 states and 183033 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:22:46,625 INFO L93 Difference]: Finished difference Result 80903 states and 388564 transitions. [2020-11-12 00:22:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:22:46,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-12 00:22:46,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:22:46,890 INFO L225 Difference]: With dead ends: 80903 [2020-11-12 00:22:46,890 INFO L226 Difference]: Without dead ends: 80848 [2020-11-12 00:22:46,890 INFO L749 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-11-12 00:22:48,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80848 states. [2020-11-12 00:22:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80848 to 34508. [2020-11-12 00:22:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34508 states, 34503 states have (on average 5.352288206822595) internal successors, (184670), 34507 states have internal predecessors, (184670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34508 states to 34508 states and 184670 transitions. [2020-11-12 00:22:50,256 INFO L78 Accepts]: Start accepts. Automaton has 34508 states and 184670 transitions. Word has length 23 [2020-11-12 00:22:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:22:50,256 INFO L481 AbstractCegarLoop]: Abstraction has 34508 states and 184670 transitions. [2020-11-12 00:22:50,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 34508 states and 184670 transitions. [2020-11-12 00:22:50,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-12 00:22:50,258 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:22:50,258 INFO L494 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:22:50,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2020-11-12 00:22:50,258 INFO L429 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, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:22:50,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:22:50,259 INFO L82 PathProgramCache]: Analyzing trace with hash 191004588, now seen corresponding path program 1 times [2020-11-12 00:22:50,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:22:50,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314726355] [2020-11-12 00:22:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:22:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:22:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-12 00:22:50,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314726355] [2020-11-12 00:22:50,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:22:50,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:22:50,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363557495] [2020-11-12 00:22:50,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:22:50,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:22:50,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:22:50,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:22:50,298 INFO L87 Difference]: Start difference. First operand 34508 states and 184670 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 00:22:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:22:51,098 INFO L93 Difference]: Finished difference Result 83313 states and 401031 transitions. [2020-11-12 00:22:51,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 00:22:51,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2020-11-12 00:22:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:22:51,383 INFO L225 Difference]: With dead ends: 83313 [2020-11-12 00:22:51,383 INFO L226 Difference]: Without dead ends: 83258 [2020-11-12 00:22:51,384 INFO L749 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-11-12 00:22:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83258 states. [2020-11-12 00:22:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83258 to 36258.