/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-60655ea [2020-09-14 12:49:13,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-14 12:49:13,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-14 12:49:13,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-14 12:49:13,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-14 12:49:13,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-14 12:49:13,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-14 12:49:13,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-14 12:49:13,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-14 12:49:13,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-14 12:49:13,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-14 12:49:13,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-14 12:49:13,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-14 12:49:13,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-14 12:49:13,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-14 12:49:13,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-14 12:49:13,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-14 12:49:13,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-14 12:49:13,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-14 12:49:13,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-14 12:49:13,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-14 12:49:13,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-14 12:49:13,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-14 12:49:13,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-14 12:49:13,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-14 12:49:13,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-14 12:49:13,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-14 12:49:13,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-14 12:49:13,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-14 12:49:13,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-14 12:49:13,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-14 12:49:14,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-14 12:49:14,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-14 12:49:14,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-14 12:49:14,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-14 12:49:14,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-14 12:49:14,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-14 12:49:14,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-14 12:49:14,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-14 12:49:14,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-14 12:49:14,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-14 12:49:14,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-14 12:49:14,059 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-14 12:49:14,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-14 12:49:14,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-14 12:49:14,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-14 12:49:14,062 INFO L138 SettingsManager]: * Use SBE=true [2020-09-14 12:49:14,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-14 12:49:14,062 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-14 12:49:14,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-14 12:49:14,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-14 12:49:14,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-14 12:49:14,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-14 12:49:14,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-14 12:49:14,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-14 12:49:14,065 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-14 12:49:14,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-14 12:49:14,065 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-14 12:49:14,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-14 12:49:14,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-14 12:49:14,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-14 12:49:14,066 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-14 12:49:14,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-14 12:49:14,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-14 12:49:14,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-14 12:49:14,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-14 12:49:14,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-14 12:49:14,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-14 12:49:14,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-14 12:49:14,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-14 12:49:14,068 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-14 12:49:14,068 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-14 12:49:14,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-14 12:49:14,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-14 12:49:14,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-14 12:49:14,607 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-14 12:49:14,608 INFO L275 PluginConnector]: CDTParser initialized [2020-09-14 12:49:14,610 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2020-09-14 12:49:14,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e059749f0/496c29a8867041afb12eb6087cb63697/FLAGb4b7b5938 [2020-09-14 12:49:15,477 INFO L306 CDTParser]: Found 1 translation units. [2020-09-14 12:49:15,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread/singleton.i [2020-09-14 12:49:15,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e059749f0/496c29a8867041afb12eb6087cb63697/FLAGb4b7b5938 [2020-09-14 12:49:15,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e059749f0/496c29a8867041afb12eb6087cb63697 [2020-09-14 12:49:15,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-14 12:49:15,671 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-14 12:49:15,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-14 12:49:15,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-14 12:49:15,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-14 12:49:15,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 12:49:15" (1/1) ... [2020-09-14 12:49:15,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a783f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 12:49:15, skipping insertion in model container [2020-09-14 12:49:15,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 12:49:15" (1/1) ... [2020-09-14 12:49:15,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-14 12:49:15,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-14 12:49:16,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-14 12:49:16,724 INFO L203 MainTranslator]: Completed pre-run [2020-09-14 12:49:16,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-14 12:49:17,059 INFO L208 MainTranslator]: Completed translation [2020-09-14 12:49:17,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 12:49:17 WrapperNode [2020-09-14 12:49:17,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-14 12:49:17,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-14 12:49:17,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-14 12:49:17,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-14 12:49:17,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 12:49:17" (1/1) ... [2020-09-14 12:49:17,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 12:49:17" (1/1) ... [2020-09-14 12:49:17,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-14 12:49:17,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-14 12:49:17,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-14 12:49:17,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-14 12:49:17,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 12:49:17" (1/1) ... [2020-09-14 12:49:17,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 12:49:17" (1/1) ... [2020-09-14 12:49:17,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 12:49:17" (1/1) ... [2020-09-14 12:49:17,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 12:49:17" (1/1) ... [2020-09-14 12:49:17,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 12:49:17" (1/1) ... [2020-09-14 12:49:17,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 12:49:17" (1/1) ... [2020-09-14 12:49:17,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 12:49:17" (1/1) ... [2020-09-14 12:49:17,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-14 12:49:17,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-14 12:49:17,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-14 12:49:17,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-14 12:49:17,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 12:49:17" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-14 12:49:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-14 12:49:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-14 12:49:17,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-14 12:49:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-09-14 12:49:17,337 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-09-14 12:49:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-09-14 12:49:17,337 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-09-14 12:49:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-09-14 12:49:17,338 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-09-14 12:49:17,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-09-14 12:49:17,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-09-14 12:49:17,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-14 12:49:17,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-14 12:49:17,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-14 12:49:17,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-14 12:49:17,343 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-14 12:49:17,990 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-14 12:49:17,991 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-09-14 12:49:17,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 12:49:17 BoogieIcfgContainer [2020-09-14 12:49:17,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-14 12:49:18,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-14 12:49:18,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-14 12:49:18,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-14 12:49:18,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 12:49:15" (1/3) ... [2020-09-14 12:49:18,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b857897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 12:49:18, skipping insertion in model container [2020-09-14 12:49:18,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 12:49:17" (2/3) ... [2020-09-14 12:49:18,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b857897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 12:49:18, skipping insertion in model container [2020-09-14 12:49:18,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 12:49:17" (3/3) ... [2020-09-14 12:49:18,014 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-09-14 12:49:18,032 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-14 12:49:18,033 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-14 12:49:18,048 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-14 12:49:18,051 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-14 12:49:18,109 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,110 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,110 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,111 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,111 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,111 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,112 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,112 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,113 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,113 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,113 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,114 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,114 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,114 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,115 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,147 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,148 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,149 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,150 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,150 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,150 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,151 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,152 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,157 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,158 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,159 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,160 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,161 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,162 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,163 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,163 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,163 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,164 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,164 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,164 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,164 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,165 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,165 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,165 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,166 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,166 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,166 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,166 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,167 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,167 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,167 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,168 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,168 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,168 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,168 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,169 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,169 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,169 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,169 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,170 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,170 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,171 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,171 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,171 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,171 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,172 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,172 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,172 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,172 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,173 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,173 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,173 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,174 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,174 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,174 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,175 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,175 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,175 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,176 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,176 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,176 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,176 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,177 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,177 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,177 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,178 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,178 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,178 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,178 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,184 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,185 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,185 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,185 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,194 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,195 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,195 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,195 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,199 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,199 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,199 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,200 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,203 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,204 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,204 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,204 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,205 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,205 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,205 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,206 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,206 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,206 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,206 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,207 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,207 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,207 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,207 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,208 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,208 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,208 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,208 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,209 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,209 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,209 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,209 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,209 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,213 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,214 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,214 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,214 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,215 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,215 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,218 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,218 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,219 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,219 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,223 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,223 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,223 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,224 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,224 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,224 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,228 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,228 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,228 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,229 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,233 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,233 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,234 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,234 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,238 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,238 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,239 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,239 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,242 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,242 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,242 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,243 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-14 12:49:18,451 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-09-14 12:49:18,482 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-14 12:49:18,482 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-14 12:49:18,482 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-14 12:49:18,482 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-14 12:49:18,483 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-14 12:49:18,483 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-14 12:49:18,483 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-14 12:49:18,483 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-14 12:49:18,514 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions, 866 flow [2020-09-14 12:49:18,518 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-09-14 12:49:18,646 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-09-14 12:49:18,646 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-09-14 12:49:18,666 INFO L80 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2020-09-14 12:49:18,680 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-09-14 12:49:18,751 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-09-14 12:49:18,752 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-09-14 12:49:18,756 INFO L80 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2020-09-14 12:49:18,767 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4038 [2020-09-14 12:49:18,769 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-09-14 12:49:20,540 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-09-14 12:49:20,653 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-14 12:49:21,116 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-09-14 12:49:21,288 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-09-14 12:49:21,568 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2242 [2020-09-14 12:49:21,569 INFO L214 etLargeBlockEncoding]: Total number of compositions: 75 [2020-09-14 12:49:21,576 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 173 transitions, 726 flow [2020-09-14 12:49:22,271 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-09-14 12:49:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-09-14 12:49:22,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-14 12:49:22,289 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:22,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:22,292 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:22,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:22,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1069688068, now seen corresponding path program 1 times [2020-09-14 12:49:22,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:22,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924109484] [2020-09-14 12:49:22,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:22,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924109484] [2020-09-14 12:49:22,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:22,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-14 12:49:22,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591921843] [2020-09-14 12:49:22,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-14 12:49:22,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:22,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-14 12:49:22,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-14 12:49:22,942 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-09-14 12:49:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:23,407 INFO L93 Difference]: Finished difference Result 4760 states and 19900 transitions. [2020-09-14 12:49:23,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-14 12:49:23,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-09-14 12:49:23,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:23,496 INFO L225 Difference]: With dead ends: 4760 [2020-09-14 12:49:23,496 INFO L226 Difference]: Without dead ends: 4272 [2020-09-14 12:49:23,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-09-14 12:49:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2020-09-14 12:49:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3018. [2020-09-14 12:49:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-09-14 12:49:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-09-14 12:49:23,869 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-09-14 12:49:23,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:23,870 INFO L479 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-09-14 12:49:23,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-14 12:49:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-09-14 12:49:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-14 12:49:23,882 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:23,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:23,883 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-14 12:49:23,883 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:23,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:23,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1263032832, now seen corresponding path program 2 times [2020-09-14 12:49:23,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:23,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951574638] [2020-09-14 12:49:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:24,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951574638] [2020-09-14 12:49:24,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:24,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-14 12:49:24,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092469095] [2020-09-14 12:49:24,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-14 12:49:24,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:24,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-14 12:49:24,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-14 12:49:24,128 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-09-14 12:49:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:24,743 INFO L93 Difference]: Finished difference Result 5518 states and 23821 transitions. [2020-09-14 12:49:24,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-14 12:49:24,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-09-14 12:49:24,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:24,826 INFO L225 Difference]: With dead ends: 5518 [2020-09-14 12:49:24,827 INFO L226 Difference]: Without dead ends: 5518 [2020-09-14 12:49:24,828 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-09-14 12:49:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2020-09-14 12:49:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 3008. [2020-09-14 12:49:25,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-09-14 12:49:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-09-14 12:49:25,087 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-09-14 12:49:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:25,088 INFO L479 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-09-14 12:49:25,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-14 12:49:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-09-14 12:49:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-14 12:49:25,090 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:25,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:25,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-14 12:49:25,091 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:25,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:25,092 INFO L82 PathProgramCache]: Analyzing trace with hash -690496787, now seen corresponding path program 1 times [2020-09-14 12:49:25,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:25,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795142733] [2020-09-14 12:49:25,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:25,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-09-14 12:49:25,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795142733] [2020-09-14 12:49:25,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:25,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-14 12:49:25,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975847839] [2020-09-14 12:49:25,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-14 12:49:25,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:25,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-14 12:49:25,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-14 12:49:25,216 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-09-14 12:49:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:25,351 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-09-14 12:49:25,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-14 12:49:25,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-09-14 12:49:25,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:25,407 INFO L225 Difference]: With dead ends: 4848 [2020-09-14 12:49:25,407 INFO L226 Difference]: Without dead ends: 3558 [2020-09-14 12:49:25,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-14 12:49:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-09-14 12:49:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-09-14 12:49:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-09-14 12:49:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-09-14 12:49:25,571 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-09-14 12:49:25,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:25,573 INFO L479 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-09-14 12:49:25,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-14 12:49:25,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-09-14 12:49:25,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-14 12:49:25,577 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:25,577 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:25,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-14 12:49:25,578 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:25,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:25,578 INFO L82 PathProgramCache]: Analyzing trace with hash 69435085, now seen corresponding path program 1 times [2020-09-14 12:49:25,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:25,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447601798] [2020-09-14 12:49:25,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:25,734 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447601798] [2020-09-14 12:49:25,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:25,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-14 12:49:25,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152576417] [2020-09-14 12:49:25,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-14 12:49:25,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:25,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-14 12:49:25,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-14 12:49:25,738 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-09-14 12:49:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:26,093 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-09-14 12:49:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-14 12:49:26,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-09-14 12:49:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:26,121 INFO L225 Difference]: With dead ends: 4417 [2020-09-14 12:49:26,121 INFO L226 Difference]: Without dead ends: 4393 [2020-09-14 12:49:26,122 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-14 12:49:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-09-14 12:49:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-09-14 12:49:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-09-14 12:49:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-09-14 12:49:26,303 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-09-14 12:49:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:26,304 INFO L479 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-09-14 12:49:26,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-14 12:49:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-09-14 12:49:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-14 12:49:26,307 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:26,307 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:26,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-14 12:49:26,307 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:26,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:26,308 INFO L82 PathProgramCache]: Analyzing trace with hash -954298863, now seen corresponding path program 2 times [2020-09-14 12:49:26,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:26,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994260392] [2020-09-14 12:49:26,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:26,425 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994260392] [2020-09-14 12:49:26,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:26,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-14 12:49:26,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850696249] [2020-09-14 12:49:26,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-14 12:49:26,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:26,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-14 12:49:26,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-14 12:49:26,428 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-09-14 12:49:26,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:26,583 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-09-14 12:49:26,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-14 12:49:26,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-09-14 12:49:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:26,610 INFO L225 Difference]: With dead ends: 4024 [2020-09-14 12:49:26,610 INFO L226 Difference]: Without dead ends: 4024 [2020-09-14 12:49:26,611 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-09-14 12:49:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-09-14 12:49:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-09-14 12:49:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-09-14 12:49:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-09-14 12:49:26,752 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-09-14 12:49:26,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:26,753 INFO L479 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-09-14 12:49:26,753 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-14 12:49:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-09-14 12:49:26,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-14 12:49:26,755 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:26,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:26,755 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-14 12:49:26,755 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:26,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:26,756 INFO L82 PathProgramCache]: Analyzing trace with hash -687500069, now seen corresponding path program 1 times [2020-09-14 12:49:26,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:26,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188241323] [2020-09-14 12:49:26,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:26,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188241323] [2020-09-14 12:49:26,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:26,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-14 12:49:26,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435769553] [2020-09-14 12:49:26,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-14 12:49:26,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:26,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-14 12:49:26,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-14 12:49:26,845 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-09-14 12:49:27,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:27,129 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-09-14 12:49:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-14 12:49:27,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-09-14 12:49:27,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:27,155 INFO L225 Difference]: With dead ends: 4225 [2020-09-14 12:49:27,156 INFO L226 Difference]: Without dead ends: 4129 [2020-09-14 12:49:27,156 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-14 12:49:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-09-14 12:49:27,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-09-14 12:49:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-09-14 12:49:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-09-14 12:49:27,438 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-09-14 12:49:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:27,439 INFO L479 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-09-14 12:49:27,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-14 12:49:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-09-14 12:49:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-14 12:49:27,441 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:27,442 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:27,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-14 12:49:27,442 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:27,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:27,443 INFO L82 PathProgramCache]: Analyzing trace with hash -454402421, now seen corresponding path program 2 times [2020-09-14 12:49:27,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:27,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805782472] [2020-09-14 12:49:27,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:27,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805782472] [2020-09-14 12:49:27,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:27,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-14 12:49:27,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421111869] [2020-09-14 12:49:27,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-14 12:49:27,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:27,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-14 12:49:27,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-14 12:49:27,615 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 7 states. [2020-09-14 12:49:28,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:28,003 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-09-14 12:49:28,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-14 12:49:28,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-09-14 12:49:28,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:28,034 INFO L225 Difference]: With dead ends: 4979 [2020-09-14 12:49:28,035 INFO L226 Difference]: Without dead ends: 4905 [2020-09-14 12:49:28,036 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-14 12:49:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-09-14 12:49:28,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-09-14 12:49:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-09-14 12:49:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-09-14 12:49:28,233 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-09-14 12:49:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:28,233 INFO L479 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-09-14 12:49:28,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-14 12:49:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-09-14 12:49:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-14 12:49:28,236 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:28,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:28,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-14 12:49:28,236 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:28,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:28,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1254406997, now seen corresponding path program 3 times [2020-09-14 12:49:28,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:28,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637932381] [2020-09-14 12:49:28,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:28,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637932381] [2020-09-14 12:49:28,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:28,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-14 12:49:28,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614763688] [2020-09-14 12:49:28,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-14 12:49:28,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:28,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-14 12:49:28,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-14 12:49:28,392 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 8 states. [2020-09-14 12:49:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:28,798 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-09-14 12:49:28,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-14 12:49:28,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-09-14 12:49:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:28,838 INFO L225 Difference]: With dead ends: 6735 [2020-09-14 12:49:28,839 INFO L226 Difference]: Without dead ends: 6661 [2020-09-14 12:49:28,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-09-14 12:49:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-09-14 12:49:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-09-14 12:49:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-09-14 12:49:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-09-14 12:49:29,196 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-09-14 12:49:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:29,197 INFO L479 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-09-14 12:49:29,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-14 12:49:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-09-14 12:49:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-14 12:49:29,199 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:29,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:29,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-14 12:49:29,200 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:29,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:29,200 INFO L82 PathProgramCache]: Analyzing trace with hash -164095139, now seen corresponding path program 4 times [2020-09-14 12:49:29,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:29,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290918756] [2020-09-14 12:49:29,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:29,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290918756] [2020-09-14 12:49:29,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:29,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-14 12:49:29,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092049789] [2020-09-14 12:49:29,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-14 12:49:29,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:29,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-14 12:49:29,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-09-14 12:49:29,429 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 10 states. [2020-09-14 12:49:29,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:29,967 INFO L93 Difference]: Finished difference Result 5374 states and 21882 transitions. [2020-09-14 12:49:29,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-14 12:49:29,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-09-14 12:49:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:30,004 INFO L225 Difference]: With dead ends: 5374 [2020-09-14 12:49:30,004 INFO L226 Difference]: Without dead ends: 5300 [2020-09-14 12:49:30,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-09-14 12:49:30,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2020-09-14 12:49:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 4114. [2020-09-14 12:49:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2020-09-14 12:49:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 16572 transitions. [2020-09-14 12:49:30,201 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 16572 transitions. Word has length 18 [2020-09-14 12:49:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:30,204 INFO L479 AbstractCegarLoop]: Abstraction has 4114 states and 16572 transitions. [2020-09-14 12:49:30,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-14 12:49:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 16572 transitions. [2020-09-14 12:49:30,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-14 12:49:30,206 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:30,206 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:30,207 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-14 12:49:30,207 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:30,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:30,208 INFO L82 PathProgramCache]: Analyzing trace with hash 2041625758, now seen corresponding path program 1 times [2020-09-14 12:49:30,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:30,208 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283511383] [2020-09-14 12:49:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:30,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283511383] [2020-09-14 12:49:30,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:30,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-14 12:49:30,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128291589] [2020-09-14 12:49:30,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-14 12:49:30,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:30,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-14 12:49:30,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-14 12:49:30,342 INFO L87 Difference]: Start difference. First operand 4114 states and 16572 transitions. Second operand 7 states. [2020-09-14 12:49:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:30,535 INFO L93 Difference]: Finished difference Result 4623 states and 18113 transitions. [2020-09-14 12:49:30,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-14 12:49:30,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-14 12:49:30,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:30,558 INFO L225 Difference]: With dead ends: 4623 [2020-09-14 12:49:30,558 INFO L226 Difference]: Without dead ends: 4623 [2020-09-14 12:49:30,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-09-14 12:49:30,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2020-09-14 12:49:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4076. [2020-09-14 12:49:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2020-09-14 12:49:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 16430 transitions. [2020-09-14 12:49:30,717 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 16430 transitions. Word has length 19 [2020-09-14 12:49:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:30,717 INFO L479 AbstractCegarLoop]: Abstraction has 4076 states and 16430 transitions. [2020-09-14 12:49:30,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-14 12:49:30,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 16430 transitions. [2020-09-14 12:49:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-14 12:49:30,720 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:30,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:30,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-14 12:49:30,721 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:30,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:30,722 INFO L82 PathProgramCache]: Analyzing trace with hash 898872146, now seen corresponding path program 1 times [2020-09-14 12:49:30,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:30,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527292852] [2020-09-14 12:49:30,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:31,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527292852] [2020-09-14 12:49:31,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:31,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-14 12:49:31,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797852431] [2020-09-14 12:49:31,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-14 12:49:31,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:31,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-14 12:49:31,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-14 12:49:31,149 INFO L87 Difference]: Start difference. First operand 4076 states and 16430 transitions. Second operand 11 states. [2020-09-14 12:49:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:31,754 INFO L93 Difference]: Finished difference Result 5825 states and 24230 transitions. [2020-09-14 12:49:31,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-14 12:49:31,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-09-14 12:49:31,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:31,780 INFO L225 Difference]: With dead ends: 5825 [2020-09-14 12:49:31,780 INFO L226 Difference]: Without dead ends: 5751 [2020-09-14 12:49:31,781 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-09-14 12:49:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5751 states. [2020-09-14 12:49:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5751 to 4013. [2020-09-14 12:49:31,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2020-09-14 12:49:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16198 transitions. [2020-09-14 12:49:31,958 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16198 transitions. Word has length 19 [2020-09-14 12:49:31,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:31,958 INFO L479 AbstractCegarLoop]: Abstraction has 4013 states and 16198 transitions. [2020-09-14 12:49:31,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-14 12:49:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16198 transitions. [2020-09-14 12:49:31,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-14 12:49:31,963 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:31,963 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:31,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-14 12:49:31,964 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:31,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:31,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1134272272, now seen corresponding path program 1 times [2020-09-14 12:49:31,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:31,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831903582] [2020-09-14 12:49:31,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:32,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831903582] [2020-09-14 12:49:32,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:32,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-14 12:49:32,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511902519] [2020-09-14 12:49:32,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-14 12:49:32,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:32,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-14 12:49:32,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-09-14 12:49:32,151 INFO L87 Difference]: Start difference. First operand 4013 states and 16198 transitions. Second operand 9 states. [2020-09-14 12:49:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:32,680 INFO L93 Difference]: Finished difference Result 5428 states and 21853 transitions. [2020-09-14 12:49:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-14 12:49:32,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-09-14 12:49:32,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:32,703 INFO L225 Difference]: With dead ends: 5428 [2020-09-14 12:49:32,703 INFO L226 Difference]: Without dead ends: 5382 [2020-09-14 12:49:32,704 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-09-14 12:49:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5382 states. [2020-09-14 12:49:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5382 to 4166. [2020-09-14 12:49:32,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4166 states. [2020-09-14 12:49:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 16924 transitions. [2020-09-14 12:49:32,917 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 16924 transitions. Word has length 20 [2020-09-14 12:49:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:32,918 INFO L479 AbstractCegarLoop]: Abstraction has 4166 states and 16924 transitions. [2020-09-14 12:49:32,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-14 12:49:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 16924 transitions. [2020-09-14 12:49:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-14 12:49:32,923 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:32,924 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:32,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-14 12:49:32,924 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:32,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:32,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1058647793, now seen corresponding path program 1 times [2020-09-14 12:49:32,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:32,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055909585] [2020-09-14 12:49:32,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:33,131 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055909585] [2020-09-14 12:49:33,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:33,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-14 12:49:33,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991151801] [2020-09-14 12:49:33,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-14 12:49:33,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:33,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-14 12:49:33,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-14 12:49:33,143 INFO L87 Difference]: Start difference. First operand 4166 states and 16924 transitions. Second operand 9 states. [2020-09-14 12:49:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:34,062 INFO L93 Difference]: Finished difference Result 5500 states and 22434 transitions. [2020-09-14 12:49:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-14 12:49:34,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-09-14 12:49:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:34,084 INFO L225 Difference]: With dead ends: 5500 [2020-09-14 12:49:34,084 INFO L226 Difference]: Without dead ends: 5454 [2020-09-14 12:49:34,085 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-09-14 12:49:34,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5454 states. [2020-09-14 12:49:34,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5454 to 4012. [2020-09-14 12:49:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4012 states. [2020-09-14 12:49:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4012 states to 4012 states and 16195 transitions. [2020-09-14 12:49:34,285 INFO L78 Accepts]: Start accepts. Automaton has 4012 states and 16195 transitions. Word has length 20 [2020-09-14 12:49:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:34,286 INFO L479 AbstractCegarLoop]: Abstraction has 4012 states and 16195 transitions. [2020-09-14 12:49:34,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-14 12:49:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4012 states and 16195 transitions. [2020-09-14 12:49:34,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-14 12:49:34,289 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:34,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:34,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-14 12:49:34,290 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:34,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:34,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2045819536, now seen corresponding path program 2 times [2020-09-14 12:49:34,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:34,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971189271] [2020-09-14 12:49:34,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:34,535 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971189271] [2020-09-14 12:49:34,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:34,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-14 12:49:34,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195445189] [2020-09-14 12:49:34,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-14 12:49:34,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:34,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-14 12:49:34,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-09-14 12:49:34,537 INFO L87 Difference]: Start difference. First operand 4012 states and 16195 transitions. Second operand 10 states. [2020-09-14 12:49:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:35,139 INFO L93 Difference]: Finished difference Result 5781 states and 23394 transitions. [2020-09-14 12:49:35,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-14 12:49:35,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-09-14 12:49:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:35,163 INFO L225 Difference]: With dead ends: 5781 [2020-09-14 12:49:35,163 INFO L226 Difference]: Without dead ends: 5735 [2020-09-14 12:49:35,164 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-09-14 12:49:35,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2020-09-14 12:49:35,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 4148. [2020-09-14 12:49:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4148 states. [2020-09-14 12:49:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 16836 transitions. [2020-09-14 12:49:35,343 INFO L78 Accepts]: Start accepts. Automaton has 4148 states and 16836 transitions. Word has length 20 [2020-09-14 12:49:35,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:35,343 INFO L479 AbstractCegarLoop]: Abstraction has 4148 states and 16836 transitions. [2020-09-14 12:49:35,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-14 12:49:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 4148 states and 16836 transitions. [2020-09-14 12:49:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-14 12:49:35,347 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:35,347 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:35,348 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-14 12:49:35,348 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:35,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:35,348 INFO L82 PathProgramCache]: Analyzing trace with hash 258643217, now seen corresponding path program 2 times [2020-09-14 12:49:35,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:35,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876006228] [2020-09-14 12:49:35,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:35,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876006228] [2020-09-14 12:49:35,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:35,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-14 12:49:35,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123380408] [2020-09-14 12:49:35,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-14 12:49:35,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:35,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-14 12:49:35,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-14 12:49:35,563 INFO L87 Difference]: Start difference. First operand 4148 states and 16836 transitions. Second operand 10 states. [2020-09-14 12:49:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:36,109 INFO L93 Difference]: Finished difference Result 6399 states and 26032 transitions. [2020-09-14 12:49:36,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-14 12:49:36,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-09-14 12:49:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:36,131 INFO L225 Difference]: With dead ends: 6399 [2020-09-14 12:49:36,132 INFO L226 Difference]: Without dead ends: 6353 [2020-09-14 12:49:36,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-09-14 12:49:36,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6353 states. [2020-09-14 12:49:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6353 to 3978. [2020-09-14 12:49:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2020-09-14 12:49:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 16074 transitions. [2020-09-14 12:49:36,285 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 16074 transitions. Word has length 20 [2020-09-14 12:49:36,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:36,286 INFO L479 AbstractCegarLoop]: Abstraction has 3978 states and 16074 transitions. [2020-09-14 12:49:36,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-14 12:49:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 16074 transitions. [2020-09-14 12:49:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-14 12:49:36,289 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:36,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:36,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-14 12:49:36,290 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:36,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:36,290 INFO L82 PathProgramCache]: Analyzing trace with hash 657525156, now seen corresponding path program 3 times [2020-09-14 12:49:36,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:36,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526635458] [2020-09-14 12:49:36,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:36,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526635458] [2020-09-14 12:49:36,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:36,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-14 12:49:36,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975897169] [2020-09-14 12:49:36,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-14 12:49:36,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:36,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-14 12:49:36,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-14 12:49:36,405 INFO L87 Difference]: Start difference. First operand 3978 states and 16074 transitions. Second operand 7 states. [2020-09-14 12:49:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:36,828 INFO L93 Difference]: Finished difference Result 6325 states and 25457 transitions. [2020-09-14 12:49:36,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-14 12:49:36,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-09-14 12:49:36,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:36,850 INFO L225 Difference]: With dead ends: 6325 [2020-09-14 12:49:36,850 INFO L226 Difference]: Without dead ends: 6279 [2020-09-14 12:49:36,850 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-09-14 12:49:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2020-09-14 12:49:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 3948. [2020-09-14 12:49:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2020-09-14 12:49:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 16005 transitions. [2020-09-14 12:49:37,002 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 16005 transitions. Word has length 20 [2020-09-14 12:49:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:37,003 INFO L479 AbstractCegarLoop]: Abstraction has 3948 states and 16005 transitions. [2020-09-14 12:49:37,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-14 12:49:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 16005 transitions. [2020-09-14 12:49:37,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-14 12:49:37,008 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:37,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:37,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-14 12:49:37,009 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:37,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:37,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1935934284, now seen corresponding path program 1 times [2020-09-14 12:49:37,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:37,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031704279] [2020-09-14 12:49:37,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:37,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031704279] [2020-09-14 12:49:37,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:37,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-14 12:49:37,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512589324] [2020-09-14 12:49:37,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-14 12:49:37,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:37,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-14 12:49:37,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-14 12:49:37,109 INFO L87 Difference]: Start difference. First operand 3948 states and 16005 transitions. Second operand 6 states. [2020-09-14 12:49:37,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:37,326 INFO L93 Difference]: Finished difference Result 4727 states and 18672 transitions. [2020-09-14 12:49:37,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-14 12:49:37,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-09-14 12:49:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:37,343 INFO L225 Difference]: With dead ends: 4727 [2020-09-14 12:49:37,343 INFO L226 Difference]: Without dead ends: 4652 [2020-09-14 12:49:37,344 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-14 12:49:37,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2020-09-14 12:49:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 4270. [2020-09-14 12:49:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4270 states. [2020-09-14 12:49:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 17192 transitions. [2020-09-14 12:49:37,463 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 17192 transitions. Word has length 21 [2020-09-14 12:49:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:37,464 INFO L479 AbstractCegarLoop]: Abstraction has 4270 states and 17192 transitions. [2020-09-14 12:49:37,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-14 12:49:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 17192 transitions. [2020-09-14 12:49:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-14 12:49:37,468 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:37,468 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:37,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-14 12:49:37,468 INFO L427 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:37,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1183087759, now seen corresponding path program 1 times [2020-09-14 12:49:37,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:37,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645984432] [2020-09-14 12:49:37,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:37,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645984432] [2020-09-14 12:49:37,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:37,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-14 12:49:37,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426327841] [2020-09-14 12:49:37,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-14 12:49:37,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:37,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-14 12:49:37,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-14 12:49:37,625 INFO L87 Difference]: Start difference. First operand 4270 states and 17192 transitions. Second operand 8 states. [2020-09-14 12:49:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:37,805 INFO L93 Difference]: Finished difference Result 4820 states and 18862 transitions. [2020-09-14 12:49:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-14 12:49:37,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-09-14 12:49:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:37,820 INFO L225 Difference]: With dead ends: 4820 [2020-09-14 12:49:37,820 INFO L226 Difference]: Without dead ends: 4296 [2020-09-14 12:49:37,821 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-09-14 12:49:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2020-09-14 12:49:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3680. [2020-09-14 12:49:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2020-09-14 12:49:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 14531 transitions. [2020-09-14 12:49:37,914 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 14531 transitions. Word has length 21 [2020-09-14 12:49:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:37,914 INFO L479 AbstractCegarLoop]: Abstraction has 3680 states and 14531 transitions. [2020-09-14 12:49:37,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-14 12:49:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 14531 transitions. [2020-09-14 12:49:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-14 12:49:37,917 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:37,917 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:37,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-14 12:49:37,917 INFO L427 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:37,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:37,918 INFO L82 PathProgramCache]: Analyzing trace with hash 558787563, now seen corresponding path program 1 times [2020-09-14 12:49:37,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:37,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840594078] [2020-09-14 12:49:37,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:38,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840594078] [2020-09-14 12:49:38,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:38,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-14 12:49:38,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450113096] [2020-09-14 12:49:38,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-14 12:49:38,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:38,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-14 12:49:38,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-09-14 12:49:38,196 INFO L87 Difference]: Start difference. First operand 3680 states and 14531 transitions. Second operand 11 states. [2020-09-14 12:49:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:38,709 INFO L93 Difference]: Finished difference Result 4556 states and 17623 transitions. [2020-09-14 12:49:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-14 12:49:38,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-09-14 12:49:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:38,725 INFO L225 Difference]: With dead ends: 4556 [2020-09-14 12:49:38,725 INFO L226 Difference]: Without dead ends: 4507 [2020-09-14 12:49:38,725 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-09-14 12:49:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2020-09-14 12:49:38,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3330. [2020-09-14 12:49:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2020-09-14 12:49:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 12802 transitions. [2020-09-14 12:49:38,905 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 12802 transitions. Word has length 21 [2020-09-14 12:49:38,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:38,906 INFO L479 AbstractCegarLoop]: Abstraction has 3330 states and 12802 transitions. [2020-09-14 12:49:38,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-14 12:49:38,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 12802 transitions. [2020-09-14 12:49:38,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-14 12:49:38,909 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:38,909 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:38,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-14 12:49:38,909 INFO L427 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:38,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:38,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2087336367, now seen corresponding path program 1 times [2020-09-14 12:49:38,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:38,911 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354642279] [2020-09-14 12:49:38,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:39,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354642279] [2020-09-14 12:49:39,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:39,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-14 12:49:39,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125960381] [2020-09-14 12:49:39,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-14 12:49:39,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:39,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-14 12:49:39,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-09-14 12:49:39,220 INFO L87 Difference]: Start difference. First operand 3330 states and 12802 transitions. Second operand 12 states. [2020-09-14 12:49:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:39,694 INFO L93 Difference]: Finished difference Result 3991 states and 15112 transitions. [2020-09-14 12:49:39,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-14 12:49:39,695 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-09-14 12:49:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:39,709 INFO L225 Difference]: With dead ends: 3991 [2020-09-14 12:49:39,709 INFO L226 Difference]: Without dead ends: 3835 [2020-09-14 12:49:39,709 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2020-09-14 12:49:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2020-09-14 12:49:39,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 2831. [2020-09-14 12:49:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-09-14 12:49:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-09-14 12:49:39,789 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-09-14 12:49:39,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:39,789 INFO L479 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-09-14 12:49:39,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-14 12:49:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-09-14 12:49:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-14 12:49:39,793 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:39,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:39,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-14 12:49:39,794 INFO L427 AbstractCegarLoop]: === Iteration 21 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:39,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:39,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1396456954, now seen corresponding path program 1 times [2020-09-14 12:49:39,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:39,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469035441] [2020-09-14 12:49:39,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:39,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469035441] [2020-09-14 12:49:39,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:39,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-14 12:49:39,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371039857] [2020-09-14 12:49:39,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-14 12:49:39,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:39,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-14 12:49:39,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-14 12:49:39,924 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 7 states. [2020-09-14 12:49:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:40,194 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2020-09-14 12:49:40,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-14 12:49:40,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-09-14 12:49:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:40,208 INFO L225 Difference]: With dead ends: 3550 [2020-09-14 12:49:40,208 INFO L226 Difference]: Without dead ends: 3490 [2020-09-14 12:49:40,209 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-14 12:49:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2020-09-14 12:49:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2020-09-14 12:49:40,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2020-09-14 12:49:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2020-09-14 12:49:40,311 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2020-09-14 12:49:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:40,312 INFO L479 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2020-09-14 12:49:40,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-14 12:49:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2020-09-14 12:49:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-14 12:49:40,316 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:40,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:40,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-14 12:49:40,316 INFO L427 AbstractCegarLoop]: === Iteration 22 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:40,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:40,317 INFO L82 PathProgramCache]: Analyzing trace with hash 644682778, now seen corresponding path program 2 times [2020-09-14 12:49:40,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:40,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431103303] [2020-09-14 12:49:40,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:40,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431103303] [2020-09-14 12:49:40,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:40,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-14 12:49:40,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697447743] [2020-09-14 12:49:40,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-14 12:49:40,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:40,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-14 12:49:40,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-14 12:49:40,441 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 8 states. [2020-09-14 12:49:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:40,770 INFO L93 Difference]: Finished difference Result 3540 states and 13065 transitions. [2020-09-14 12:49:40,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-14 12:49:40,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-09-14 12:49:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:40,782 INFO L225 Difference]: With dead ends: 3540 [2020-09-14 12:49:40,782 INFO L226 Difference]: Without dead ends: 3480 [2020-09-14 12:49:40,783 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-09-14 12:49:40,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2020-09-14 12:49:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 2822. [2020-09-14 12:49:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-09-14 12:49:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-09-14 12:49:40,849 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-09-14 12:49:40,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:40,849 INFO L479 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-09-14 12:49:40,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-14 12:49:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-09-14 12:49:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-14 12:49:40,852 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:40,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:40,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-14 12:49:40,853 INFO L427 AbstractCegarLoop]: === Iteration 23 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:40,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:40,853 INFO L82 PathProgramCache]: Analyzing trace with hash -787433364, now seen corresponding path program 3 times [2020-09-14 12:49:40,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:40,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052692216] [2020-09-14 12:49:40,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:41,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:41,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052692216] [2020-09-14 12:49:41,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:41,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-14 12:49:41,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151268958] [2020-09-14 12:49:41,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-14 12:49:41,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:41,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-14 12:49:41,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-14 12:49:41,023 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 9 states. [2020-09-14 12:49:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:41,462 INFO L93 Difference]: Finished difference Result 3525 states and 13034 transitions. [2020-09-14 12:49:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-14 12:49:41,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-09-14 12:49:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:41,481 INFO L225 Difference]: With dead ends: 3525 [2020-09-14 12:49:41,482 INFO L226 Difference]: Without dead ends: 3465 [2020-09-14 12:49:41,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-14 12:49:41,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2020-09-14 12:49:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 2822. [2020-09-14 12:49:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-09-14 12:49:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-09-14 12:49:41,591 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-09-14 12:49:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:41,592 INFO L479 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-09-14 12:49:41,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-14 12:49:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-09-14 12:49:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-14 12:49:41,597 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:41,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:41,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-14 12:49:41,598 INFO L427 AbstractCegarLoop]: === Iteration 24 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:41,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:41,598 INFO L82 PathProgramCache]: Analyzing trace with hash -270857424, now seen corresponding path program 4 times [2020-09-14 12:49:41,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:41,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358176268] [2020-09-14 12:49:41,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:41,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358176268] [2020-09-14 12:49:41,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:41,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-14 12:49:41,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942129292] [2020-09-14 12:49:41,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-14 12:49:41,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:41,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-14 12:49:41,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-09-14 12:49:41,842 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 11 states. [2020-09-14 12:49:42,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:42,395 INFO L93 Difference]: Finished difference Result 3740 states and 13820 transitions. [2020-09-14 12:49:42,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-14 12:49:42,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-09-14 12:49:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:42,407 INFO L225 Difference]: With dead ends: 3740 [2020-09-14 12:49:42,407 INFO L226 Difference]: Without dead ends: 3680 [2020-09-14 12:49:42,407 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-09-14 12:49:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2020-09-14 12:49:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 2822. [2020-09-14 12:49:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-09-14 12:49:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10603 transitions. [2020-09-14 12:49:42,482 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10603 transitions. Word has length 22 [2020-09-14 12:49:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:42,483 INFO L479 AbstractCegarLoop]: Abstraction has 2822 states and 10603 transitions. [2020-09-14 12:49:42,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-14 12:49:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10603 transitions. [2020-09-14 12:49:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-14 12:49:42,486 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:42,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:42,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-14 12:49:42,486 INFO L427 AbstractCegarLoop]: === Iteration 25 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:42,487 INFO L82 PathProgramCache]: Analyzing trace with hash -503603988, now seen corresponding path program 5 times [2020-09-14 12:49:42,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:42,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201010355] [2020-09-14 12:49:42,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:42,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201010355] [2020-09-14 12:49:42,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:42,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-14 12:49:42,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891868991] [2020-09-14 12:49:42,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-14 12:49:42,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:42,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-14 12:49:42,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-14 12:49:42,660 INFO L87 Difference]: Start difference. First operand 2822 states and 10603 transitions. Second operand 9 states. [2020-09-14 12:49:43,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:43,060 INFO L93 Difference]: Finished difference Result 4237 states and 15414 transitions. [2020-09-14 12:49:43,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-14 12:49:43,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-09-14 12:49:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:43,072 INFO L225 Difference]: With dead ends: 4237 [2020-09-14 12:49:43,073 INFO L226 Difference]: Without dead ends: 4177 [2020-09-14 12:49:43,073 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-09-14 12:49:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2020-09-14 12:49:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 2670. [2020-09-14 12:49:43,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-09-14 12:49:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2020-09-14 12:49:43,135 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2020-09-14 12:49:43,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:43,135 INFO L479 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2020-09-14 12:49:43,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-14 12:49:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2020-09-14 12:49:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-14 12:49:43,138 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:43,138 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:43,138 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-14 12:49:43,138 INFO L427 AbstractCegarLoop]: === Iteration 26 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:43,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:43,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1684489160, now seen corresponding path program 1 times [2020-09-14 12:49:43,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:43,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239562987] [2020-09-14 12:49:43,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:43,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239562987] [2020-09-14 12:49:43,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:43,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-14 12:49:43,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580940884] [2020-09-14 12:49:43,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-14 12:49:43,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:43,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-14 12:49:43,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-09-14 12:49:43,435 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2020-09-14 12:49:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:43,878 INFO L93 Difference]: Finished difference Result 3103 states and 11113 transitions. [2020-09-14 12:49:43,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-14 12:49:43,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-09-14 12:49:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:43,887 INFO L225 Difference]: With dead ends: 3103 [2020-09-14 12:49:43,887 INFO L226 Difference]: Without dead ends: 3007 [2020-09-14 12:49:43,888 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2020-09-14 12:49:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2020-09-14 12:49:43,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2170. [2020-09-14 12:49:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2020-09-14 12:49:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2020-09-14 12:49:43,946 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 23 [2020-09-14 12:49:43,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:43,946 INFO L479 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2020-09-14 12:49:43,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-14 12:49:43,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2020-09-14 12:49:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-14 12:49:43,949 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:43,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:43,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-14 12:49:43,950 INFO L427 AbstractCegarLoop]: === Iteration 27 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:43,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:43,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1357008819, now seen corresponding path program 1 times [2020-09-14 12:49:43,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:43,950 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202839990] [2020-09-14 12:49:43,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:44,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:44,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202839990] [2020-09-14 12:49:44,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:44,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-14 12:49:44,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396539465] [2020-09-14 12:49:44,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-14 12:49:44,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:44,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-14 12:49:44,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-14 12:49:44,197 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 10 states. [2020-09-14 12:49:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:44,702 INFO L93 Difference]: Finished difference Result 3115 states and 11153 transitions. [2020-09-14 12:49:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-14 12:49:44,702 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-09-14 12:49:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:44,711 INFO L225 Difference]: With dead ends: 3115 [2020-09-14 12:49:44,711 INFO L226 Difference]: Without dead ends: 3058 [2020-09-14 12:49:44,713 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-09-14 12:49:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-09-14 12:49:44,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2130. [2020-09-14 12:49:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2020-09-14 12:49:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 7633 transitions. [2020-09-14 12:49:44,766 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 7633 transitions. Word has length 23 [2020-09-14 12:49:44,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:44,767 INFO L479 AbstractCegarLoop]: Abstraction has 2130 states and 7633 transitions. [2020-09-14 12:49:44,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-14 12:49:44,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 7633 transitions. [2020-09-14 12:49:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-14 12:49:44,770 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:44,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:44,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-09-14 12:49:44,771 INFO L427 AbstractCegarLoop]: === Iteration 28 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:44,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:44,771 INFO L82 PathProgramCache]: Analyzing trace with hash -840432879, now seen corresponding path program 2 times [2020-09-14 12:49:44,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:44,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452831720] [2020-09-14 12:49:44,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:45,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452831720] [2020-09-14 12:49:45,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:45,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-14 12:49:45,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327811165] [2020-09-14 12:49:45,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-14 12:49:45,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:45,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-14 12:49:45,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-09-14 12:49:45,063 INFO L87 Difference]: Start difference. First operand 2130 states and 7633 transitions. Second operand 12 states. [2020-09-14 12:49:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:45,498 INFO L93 Difference]: Finished difference Result 2799 states and 9853 transitions. [2020-09-14 12:49:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-14 12:49:45,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-09-14 12:49:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:45,506 INFO L225 Difference]: With dead ends: 2799 [2020-09-14 12:49:45,507 INFO L226 Difference]: Without dead ends: 2682 [2020-09-14 12:49:45,507 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2020-09-14 12:49:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2020-09-14 12:49:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 1794. [2020-09-14 12:49:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-09-14 12:49:45,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2020-09-14 12:49:45,545 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2020-09-14 12:49:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:45,546 INFO L479 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2020-09-14 12:49:45,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-14 12:49:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2020-09-14 12:49:45,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-14 12:49:45,548 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:45,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:45,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-09-14 12:49:45,548 INFO L427 AbstractCegarLoop]: === Iteration 29 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:45,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:45,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1309010247, now seen corresponding path program 1 times [2020-09-14 12:49:45,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:45,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121209165] [2020-09-14 12:49:45,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:45,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121209165] [2020-09-14 12:49:45,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:45,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-14 12:49:45,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21247805] [2020-09-14 12:49:45,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-14 12:49:45,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:45,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-14 12:49:45,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-14 12:49:45,642 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 6 states. [2020-09-14 12:49:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:45,823 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2020-09-14 12:49:45,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-14 12:49:45,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-14 12:49:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:45,830 INFO L225 Difference]: With dead ends: 2291 [2020-09-14 12:49:45,830 INFO L226 Difference]: Without dead ends: 2227 [2020-09-14 12:49:45,831 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-14 12:49:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2020-09-14 12:49:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2020-09-14 12:49:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-09-14 12:49:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2020-09-14 12:49:45,886 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2020-09-14 12:49:45,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:45,887 INFO L479 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2020-09-14 12:49:45,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-14 12:49:45,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2020-09-14 12:49:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-14 12:49:45,890 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:45,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:45,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-09-14 12:49:45,891 INFO L427 AbstractCegarLoop]: === Iteration 30 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:45,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:45,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1793125216, now seen corresponding path program 1 times [2020-09-14 12:49:45,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:45,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771913347] [2020-09-14 12:49:45,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:46,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771913347] [2020-09-14 12:49:46,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:46,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-14 12:49:46,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347508599] [2020-09-14 12:49:46,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-14 12:49:46,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:46,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-14 12:49:46,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-14 12:49:46,041 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 9 states. [2020-09-14 12:49:46,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:46,378 INFO L93 Difference]: Finished difference Result 2954 states and 10228 transitions. [2020-09-14 12:49:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-14 12:49:46,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-09-14 12:49:46,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:46,387 INFO L225 Difference]: With dead ends: 2954 [2020-09-14 12:49:46,388 INFO L226 Difference]: Without dead ends: 2930 [2020-09-14 12:49:46,388 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-09-14 12:49:46,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-09-14 12:49:46,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2105. [2020-09-14 12:49:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2020-09-14 12:49:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 7278 transitions. [2020-09-14 12:49:46,438 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 7278 transitions. Word has length 24 [2020-09-14 12:49:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:46,438 INFO L479 AbstractCegarLoop]: Abstraction has 2105 states and 7278 transitions. [2020-09-14 12:49:46,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-14 12:49:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 7278 transitions. [2020-09-14 12:49:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-14 12:49:46,441 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:46,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:46,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-09-14 12:49:46,442 INFO L427 AbstractCegarLoop]: === Iteration 31 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:46,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:46,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1041351040, now seen corresponding path program 2 times [2020-09-14 12:49:46,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:46,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181226320] [2020-09-14 12:49:46,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:46,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181226320] [2020-09-14 12:49:46,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:46,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-14 12:49:46,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032078240] [2020-09-14 12:49:46,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-14 12:49:46,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:46,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-14 12:49:46,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-14 12:49:46,634 INFO L87 Difference]: Start difference. First operand 2105 states and 7278 transitions. Second operand 10 states. [2020-09-14 12:49:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:47,030 INFO L93 Difference]: Finished difference Result 2941 states and 10205 transitions. [2020-09-14 12:49:47,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-14 12:49:47,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-09-14 12:49:47,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:47,039 INFO L225 Difference]: With dead ends: 2941 [2020-09-14 12:49:47,040 INFO L226 Difference]: Without dead ends: 2917 [2020-09-14 12:49:47,040 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2020-09-14 12:49:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-09-14 12:49:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2102. [2020-09-14 12:49:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-09-14 12:49:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7274 transitions. [2020-09-14 12:49:47,093 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7274 transitions. Word has length 24 [2020-09-14 12:49:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:47,094 INFO L479 AbstractCegarLoop]: Abstraction has 2102 states and 7274 transitions. [2020-09-14 12:49:47,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-14 12:49:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7274 transitions. [2020-09-14 12:49:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-14 12:49:47,096 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:47,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:47,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-09-14 12:49:47,096 INFO L427 AbstractCegarLoop]: === Iteration 32 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:47,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:47,097 INFO L82 PathProgramCache]: Analyzing trace with hash -106935726, now seen corresponding path program 3 times [2020-09-14 12:49:47,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:47,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930405048] [2020-09-14 12:49:47,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:47,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930405048] [2020-09-14 12:49:47,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:47,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-14 12:49:47,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645062873] [2020-09-14 12:49:47,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-14 12:49:47,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:47,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-14 12:49:47,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-09-14 12:49:47,316 INFO L87 Difference]: Start difference. First operand 2102 states and 7274 transitions. Second operand 11 states. [2020-09-14 12:49:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:47,822 INFO L93 Difference]: Finished difference Result 3197 states and 11098 transitions. [2020-09-14 12:49:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-14 12:49:47,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-09-14 12:49:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:47,833 INFO L225 Difference]: With dead ends: 3197 [2020-09-14 12:49:47,833 INFO L226 Difference]: Without dead ends: 3173 [2020-09-14 12:49:47,833 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2020-09-14 12:49:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2020-09-14 12:49:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 1742. [2020-09-14 12:49:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2020-09-14 12:49:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 5952 transitions. [2020-09-14 12:49:47,898 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 5952 transitions. Word has length 24 [2020-09-14 12:49:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:47,898 INFO L479 AbstractCegarLoop]: Abstraction has 1742 states and 5952 transitions. [2020-09-14 12:49:47,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-14 12:49:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 5952 transitions. [2020-09-14 12:49:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-14 12:49:47,902 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:47,902 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:47,902 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-09-14 12:49:47,902 INFO L427 AbstractCegarLoop]: === Iteration 33 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:47,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:47,903 INFO L82 PathProgramCache]: Analyzing trace with hash -408101783, now seen corresponding path program 2 times [2020-09-14 12:49:47,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:47,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591336273] [2020-09-14 12:49:47,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:48,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591336273] [2020-09-14 12:49:48,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:48,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-14 12:49:48,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113771123] [2020-09-14 12:49:48,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-14 12:49:48,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:48,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-14 12:49:48,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-14 12:49:48,025 INFO L87 Difference]: Start difference. First operand 1742 states and 5952 transitions. Second operand 7 states. [2020-09-14 12:49:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:48,277 INFO L93 Difference]: Finished difference Result 2236 states and 7383 transitions. [2020-09-14 12:49:48,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-14 12:49:48,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-09-14 12:49:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:48,288 INFO L225 Difference]: With dead ends: 2236 [2020-09-14 12:49:48,288 INFO L226 Difference]: Without dead ends: 2172 [2020-09-14 12:49:48,290 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-14 12:49:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2020-09-14 12:49:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 1739. [2020-09-14 12:49:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2020-09-14 12:49:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 5947 transitions. [2020-09-14 12:49:48,362 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 5947 transitions. Word has length 24 [2020-09-14 12:49:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:48,362 INFO L479 AbstractCegarLoop]: Abstraction has 1739 states and 5947 transitions. [2020-09-14 12:49:48,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-14 12:49:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 5947 transitions. [2020-09-14 12:49:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-14 12:49:48,367 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:48,368 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:48,368 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-09-14 12:49:48,368 INFO L427 AbstractCegarLoop]: === Iteration 34 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:48,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:48,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1308579191, now seen corresponding path program 3 times [2020-09-14 12:49:48,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:48,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313055034] [2020-09-14 12:49:48,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:48,590 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313055034] [2020-09-14 12:49:48,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:48,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-14 12:49:48,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244681412] [2020-09-14 12:49:48,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-14 12:49:48,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:48,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-14 12:49:48,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-14 12:49:48,593 INFO L87 Difference]: Start difference. First operand 1739 states and 5947 transitions. Second operand 8 states. [2020-09-14 12:49:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:48,883 INFO L93 Difference]: Finished difference Result 2226 states and 7363 transitions. [2020-09-14 12:49:48,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-14 12:49:48,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-09-14 12:49:48,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:48,893 INFO L225 Difference]: With dead ends: 2226 [2020-09-14 12:49:48,894 INFO L226 Difference]: Without dead ends: 2162 [2020-09-14 12:49:48,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-09-14 12:49:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2020-09-14 12:49:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1733. [2020-09-14 12:49:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2020-09-14 12:49:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2020-09-14 12:49:48,971 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2020-09-14 12:49:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:48,972 INFO L479 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2020-09-14 12:49:48,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-14 12:49:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2020-09-14 12:49:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-14 12:49:48,977 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:48,977 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:48,977 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-09-14 12:49:48,977 INFO L427 AbstractCegarLoop]: === Iteration 35 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:48,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:48,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1370549309, now seen corresponding path program 4 times [2020-09-14 12:49:48,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:48,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413486978] [2020-09-14 12:49:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:49,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413486978] [2020-09-14 12:49:49,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:49,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-14 12:49:49,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608932770] [2020-09-14 12:49:49,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-14 12:49:49,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:49,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-14 12:49:49,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-14 12:49:49,187 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 10 states. [2020-09-14 12:49:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:49,492 INFO L93 Difference]: Finished difference Result 2175 states and 7230 transitions. [2020-09-14 12:49:49,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-14 12:49:49,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-09-14 12:49:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:49,501 INFO L225 Difference]: With dead ends: 2175 [2020-09-14 12:49:49,502 INFO L226 Difference]: Without dead ends: 2111 [2020-09-14 12:49:49,502 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-09-14 12:49:49,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2020-09-14 12:49:49,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1733. [2020-09-14 12:49:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2020-09-14 12:49:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2020-09-14 12:49:49,567 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2020-09-14 12:49:49,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:49,568 INFO L479 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2020-09-14 12:49:49,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-14 12:49:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2020-09-14 12:49:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-14 12:49:49,572 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:49,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:49,573 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-09-14 12:49:49,573 INFO L427 AbstractCegarLoop]: === Iteration 36 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:49,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:49,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1607134461, now seen corresponding path program 5 times [2020-09-14 12:49:49,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:49,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907141993] [2020-09-14 12:49:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:49,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907141993] [2020-09-14 12:49:49,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:49,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-14 12:49:49,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997018742] [2020-09-14 12:49:49,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-14 12:49:49,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:49,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-14 12:49:49,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-09-14 12:49:49,890 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 12 states. [2020-09-14 12:49:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:50,327 INFO L93 Difference]: Finished difference Result 2400 states and 7955 transitions. [2020-09-14 12:49:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-14 12:49:50,328 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-09-14 12:49:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:50,335 INFO L225 Difference]: With dead ends: 2400 [2020-09-14 12:49:50,335 INFO L226 Difference]: Without dead ends: 2272 [2020-09-14 12:49:50,336 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-09-14 12:49:50,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2020-09-14 12:49:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1669. [2020-09-14 12:49:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2020-09-14 12:49:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 5719 transitions. [2020-09-14 12:49:50,384 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 5719 transitions. Word has length 24 [2020-09-14 12:49:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:50,385 INFO L479 AbstractCegarLoop]: Abstraction has 1669 states and 5719 transitions. [2020-09-14 12:49:50,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-14 12:49:50,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 5719 transitions. [2020-09-14 12:49:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-14 12:49:50,388 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:50,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:50,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-09-14 12:49:50,389 INFO L427 AbstractCegarLoop]: === Iteration 37 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:50,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:50,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1497656527, now seen corresponding path program 6 times [2020-09-14 12:49:50,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:50,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692834565] [2020-09-14 12:49:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:50,572 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692834565] [2020-09-14 12:49:50,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:50,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-14 12:49:50,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141166340] [2020-09-14 12:49:50,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-14 12:49:50,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:50,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-14 12:49:50,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-14 12:49:50,574 INFO L87 Difference]: Start difference. First operand 1669 states and 5719 transitions. Second operand 10 states. [2020-09-14 12:49:51,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:51,047 INFO L93 Difference]: Finished difference Result 2576 states and 8317 transitions. [2020-09-14 12:49:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-14 12:49:51,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-09-14 12:49:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:51,055 INFO L225 Difference]: With dead ends: 2576 [2020-09-14 12:49:51,055 INFO L226 Difference]: Without dead ends: 2512 [2020-09-14 12:49:51,056 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-09-14 12:49:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2020-09-14 12:49:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 1489. [2020-09-14 12:49:51,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1489 states. [2020-09-14 12:49:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 5033 transitions. [2020-09-14 12:49:51,105 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 5033 transitions. Word has length 24 [2020-09-14 12:49:51,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:51,106 INFO L479 AbstractCegarLoop]: Abstraction has 1489 states and 5033 transitions. [2020-09-14 12:49:51,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-14 12:49:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 5033 transitions. [2020-09-14 12:49:51,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-14 12:49:51,110 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:51,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:51,110 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-09-14 12:49:51,111 INFO L427 AbstractCegarLoop]: === Iteration 38 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:51,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:51,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1461991345, now seen corresponding path program 1 times [2020-09-14 12:49:51,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:51,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452541358] [2020-09-14 12:49:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:51,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452541358] [2020-09-14 12:49:51,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:51,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-14 12:49:51,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858156051] [2020-09-14 12:49:51,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-14 12:49:51,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:51,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-14 12:49:51,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-14 12:49:51,290 INFO L87 Difference]: Start difference. First operand 1489 states and 5033 transitions. Second operand 9 states. [2020-09-14 12:49:51,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:51,632 INFO L93 Difference]: Finished difference Result 2106 states and 6852 transitions. [2020-09-14 12:49:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-14 12:49:51,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-09-14 12:49:51,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:51,646 INFO L225 Difference]: With dead ends: 2106 [2020-09-14 12:49:51,646 INFO L226 Difference]: Without dead ends: 2084 [2020-09-14 12:49:51,647 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-09-14 12:49:51,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2020-09-14 12:49:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1488. [2020-09-14 12:49:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2020-09-14 12:49:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 5032 transitions. [2020-09-14 12:49:51,696 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 5032 transitions. Word has length 26 [2020-09-14 12:49:51,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:51,696 INFO L479 AbstractCegarLoop]: Abstraction has 1488 states and 5032 transitions. [2020-09-14 12:49:51,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-14 12:49:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 5032 transitions. [2020-09-14 12:49:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-14 12:49:51,700 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:51,700 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:51,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-09-14 12:49:51,700 INFO L427 AbstractCegarLoop]: === Iteration 39 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:51,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1932498543, now seen corresponding path program 2 times [2020-09-14 12:49:51,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:51,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867367637] [2020-09-14 12:49:51,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:52,041 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867367637] [2020-09-14 12:49:52,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:52,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-14 12:49:52,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461771646] [2020-09-14 12:49:52,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-14 12:49:52,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:52,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-14 12:49:52,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-14 12:49:52,044 INFO L87 Difference]: Start difference. First operand 1488 states and 5032 transitions. Second operand 10 states. [2020-09-14 12:49:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:52,548 INFO L93 Difference]: Finished difference Result 2093 states and 6829 transitions. [2020-09-14 12:49:52,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-14 12:49:52,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-09-14 12:49:52,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:52,558 INFO L225 Difference]: With dead ends: 2093 [2020-09-14 12:49:52,558 INFO L226 Difference]: Without dead ends: 2071 [2020-09-14 12:49:52,559 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2020-09-14 12:49:52,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2020-09-14 12:49:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1485. [2020-09-14 12:49:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2020-09-14 12:49:52,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 5028 transitions. [2020-09-14 12:49:52,668 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 5028 transitions. Word has length 26 [2020-09-14 12:49:52,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:52,668 INFO L479 AbstractCegarLoop]: Abstraction has 1485 states and 5028 transitions. [2020-09-14 12:49:52,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-14 12:49:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 5028 transitions. [2020-09-14 12:49:52,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-14 12:49:52,672 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:52,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:52,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-09-14 12:49:52,672 INFO L427 AbstractCegarLoop]: === Iteration 40 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:52,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:52,673 INFO L82 PathProgramCache]: Analyzing trace with hash 443766965, now seen corresponding path program 3 times [2020-09-14 12:49:52,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:52,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467936904] [2020-09-14 12:49:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:52,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467936904] [2020-09-14 12:49:52,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:52,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-14 12:49:52,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593344966] [2020-09-14 12:49:52,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-14 12:49:52,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:52,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-14 12:49:52,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-09-14 12:49:52,973 INFO L87 Difference]: Start difference. First operand 1485 states and 5028 transitions. Second operand 12 states. [2020-09-14 12:49:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:53,688 INFO L93 Difference]: Finished difference Result 1538 states and 4992 transitions. [2020-09-14 12:49:53,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-14 12:49:53,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-09-14 12:49:53,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:53,696 INFO L225 Difference]: With dead ends: 1538 [2020-09-14 12:49:53,696 INFO L226 Difference]: Without dead ends: 1494 [2020-09-14 12:49:53,697 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-09-14 12:49:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2020-09-14 12:49:53,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 885. [2020-09-14 12:49:53,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-09-14 12:49:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-09-14 12:49:53,737 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-09-14 12:49:53,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:53,738 INFO L479 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-09-14 12:49:53,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-14 12:49:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-09-14 12:49:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-14 12:49:53,741 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:53,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:53,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-09-14 12:49:53,742 INFO L427 AbstractCegarLoop]: === Iteration 41 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:53,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:53,742 INFO L82 PathProgramCache]: Analyzing trace with hash -416507732, now seen corresponding path program 1 times [2020-09-14 12:49:53,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:53,743 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273770027] [2020-09-14 12:49:53,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:53,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273770027] [2020-09-14 12:49:53,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:53,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-14 12:49:53,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551681495] [2020-09-14 12:49:53,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-14 12:49:53,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:53,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-14 12:49:53,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-14 12:49:53,876 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-09-14 12:49:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:54,055 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2020-09-14 12:49:54,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-14 12:49:54,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-09-14 12:49:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:54,060 INFO L225 Difference]: With dead ends: 885 [2020-09-14 12:49:54,060 INFO L226 Difference]: Without dead ends: 879 [2020-09-14 12:49:54,061 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-09-14 12:49:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2020-09-14 12:49:54,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2020-09-14 12:49:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2020-09-14 12:49:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2020-09-14 12:49:54,090 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2020-09-14 12:49:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:54,091 INFO L479 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2020-09-14 12:49:54,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-14 12:49:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2020-09-14 12:49:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-14 12:49:54,095 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:54,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:54,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-09-14 12:49:54,095 INFO L427 AbstractCegarLoop]: === Iteration 42 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:54,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:54,098 INFO L82 PathProgramCache]: Analyzing trace with hash 829092404, now seen corresponding path program 1 times [2020-09-14 12:49:54,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:54,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548501914] [2020-09-14 12:49:54,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-14 12:49:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-14 12:49:54,266 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548501914] [2020-09-14 12:49:54,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-14 12:49:54,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-14 12:49:54,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790467902] [2020-09-14 12:49:54,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-14 12:49:54,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-14 12:49:54,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-14 12:49:54,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-14 12:49:54,268 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 8 states. [2020-09-14 12:49:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-14 12:49:54,454 INFO L93 Difference]: Finished difference Result 879 states and 3006 transitions. [2020-09-14 12:49:54,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-14 12:49:54,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-09-14 12:49:54,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-14 12:49:54,459 INFO L225 Difference]: With dead ends: 879 [2020-09-14 12:49:54,460 INFO L226 Difference]: Without dead ends: 819 [2020-09-14 12:49:54,460 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-09-14 12:49:54,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2020-09-14 12:49:54,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2020-09-14 12:49:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-09-14 12:49:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2020-09-14 12:49:54,478 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2020-09-14 12:49:54,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-14 12:49:54,479 INFO L479 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2020-09-14 12:49:54,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-14 12:49:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2020-09-14 12:49:54,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-14 12:49:54,481 INFO L414 BasicCegarLoop]: Found error trace [2020-09-14 12:49:54,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-14 12:49:54,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-09-14 12:49:54,482 INFO L427 AbstractCegarLoop]: === Iteration 43 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-09-14 12:49:54,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-14 12:49:54,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1378914744, now seen corresponding path program 1 times [2020-09-14 12:49:54,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-14 12:49:54,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660649795] [2020-09-14 12:49:54,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-14 12:49:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-14 12:49:54,521 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-14 12:49:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-14 12:49:54,560 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-14 12:49:54,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-14 12:49:54,623 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-14 12:49:54,624 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-09-14 12:49:54,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 12:49:54 BasicIcfg [2020-09-14 12:49:54,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-14 12:49:54,812 INFO L168 Benchmark]: Toolchain (without parser) took 39147.81 ms. Allocated memory was 136.8 MB in the beginning and 967.8 MB in the end (delta: 831.0 MB). Free memory was 97.8 MB in the beginning and 629.5 MB in the end (delta: -531.6 MB). Peak memory consumption was 299.4 MB. Max. memory is 7.1 GB. [2020-09-14 12:49:54,813 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 136.8 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-09-14 12:49:54,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1390.91 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 97.2 MB in the beginning and 121.7 MB in the end (delta: -24.5 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. [2020-09-14 12:49:54,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.25 ms. Allocated memory is still 201.9 MB. Free memory was 121.7 MB in the beginning and 119.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2020-09-14 12:49:54,814 INFO L168 Benchmark]: Boogie Preprocessor took 42.71 ms. Allocated memory is still 201.9 MB. Free memory was 119.5 MB in the beginning and 118.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2020-09-14 12:49:54,814 INFO L168 Benchmark]: RCFGBuilder took 769.03 ms. Allocated memory is still 201.9 MB. Free memory was 117.3 MB in the beginning and 90.7 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2020-09-14 12:49:54,815 INFO L168 Benchmark]: TraceAbstraction took 36807.09 ms. Allocated memory was 201.9 MB in the beginning and 967.8 MB in the end (delta: 766.0 MB). Free memory was 90.0 MB in the beginning and 629.5 MB in the end (delta: -539.5 MB). Peak memory consumption was 226.5 MB. Max. memory is 7.1 GB. [2020-09-14 12:49:54,817 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43 ms. Allocated memory is still 136.8 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1390.91 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 97.2 MB in the beginning and 121.7 MB in the end (delta: -24.5 MB). Peak memory consumption was 45.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 122.25 ms. Allocated memory is still 201.9 MB. Free memory was 121.7 MB in the beginning and 119.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.71 ms. Allocated memory is still 201.9 MB. Free memory was 119.5 MB in the beginning and 118.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 769.03 ms. Allocated memory is still 201.9 MB. Free memory was 117.3 MB in the beginning and 90.7 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36807.09 ms. Allocated memory was 201.9 MB in the beginning and 967.8 MB in the end (delta: 766.0 MB). Free memory was 90.0 MB in the beginning and 629.5 MB in the end (delta: -539.5 MB). Peak memory consumption was 226.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 172 ProgramPointsBefore, 101 ProgramPointsAfterwards, 243 TransitionsBefore, 173 TransitionsAfterwards, 4038 CoEnabledTransitionPairs, 6 FixpointIterations, 23 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 1507 VarBasedMoverChecksPositive, 11 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 9 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2242 CheckedPairsTotal, 75 TotalNumberOfCompositions - CounterExampleResult [Line: 1088]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1089] 0 char *v; [L1122] 0 pthread_t t; [L1123] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1107] 1 pthread_t t1, t2, t3, t4, t5; [L1108] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={0:0}] [L1109] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={0:0}] [L1124] 0 \read(t) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={0:0}] [L1092] 2 v = malloc(sizeof(char)) [L1093] 2 return 0; [L1109] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1110] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1097] 3 v[0] = 'X' [L1098] 3 return 0; [L1111] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1112] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1113] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1114] 1 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1114] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1115] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1097] 6 v[0] = 'X' [L1098] 6 return 0; [L1097] 5 v[0] = 'X' [L1098] 5 return 0; [L1102] 4 v[0] = 'Y' [L1103] 4 return 0; [L1115] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1116] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1116] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1117] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1117] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={8:0}, t2={11:0}, t3={10:0}, t4={13:0}, t5={12:0}, v={6:0}] [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1124] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] [L1125] 0 v[0] [L1088] COND TRUE 0 !expression [L1088] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 36.1s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 4482 SDtfs, 7573 SDslu, 12200 SDs, 0 SdLazy, 7382 SolverSat, 970 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4270occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 42 MinimizatonAttempts, 39550 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 958 NumberOfCodeBlocks, 958 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 875 ConstructedInterpolants, 0 QuantifiedInterpolants, 209371 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...