/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-507b705 [2020-09-11 12:06:11,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-11 12:06:11,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-11 12:06:11,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-11 12:06:11,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-11 12:06:11,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-11 12:06:11,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-11 12:06:11,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-11 12:06:11,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-11 12:06:11,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-11 12:06:11,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-11 12:06:11,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-11 12:06:11,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-11 12:06:11,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-11 12:06:11,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-11 12:06:11,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-11 12:06:11,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-11 12:06:11,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-11 12:06:11,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-11 12:06:11,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-11 12:06:11,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-11 12:06:11,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-11 12:06:11,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-11 12:06:11,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-11 12:06:11,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-11 12:06:11,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-11 12:06:11,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-11 12:06:11,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-11 12:06:11,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-11 12:06:11,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-11 12:06:11,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-11 12:06:11,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-11 12:06:11,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-11 12:06:11,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-11 12:06:11,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-11 12:06:11,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-11 12:06:11,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-11 12:06:11,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-11 12:06:11,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-11 12:06:11,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-11 12:06:11,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-11 12:06:11,924 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-11 12:06:11,951 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-11 12:06:11,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-11 12:06:11,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-11 12:06:11,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-11 12:06:11,957 INFO L138 SettingsManager]: * Use SBE=true [2020-09-11 12:06:11,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-11 12:06:11,957 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-11 12:06:11,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-11 12:06:11,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-11 12:06:11,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-11 12:06:11,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-11 12:06:11,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-11 12:06:11,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-11 12:06:11,962 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-11 12:06:11,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-11 12:06:11,963 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-11 12:06:11,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-11 12:06:11,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-11 12:06:11,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-11 12:06:11,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-11 12:06:11,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-11 12:06:11,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-11 12:06:11,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-11 12:06:11,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-11 12:06:11,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-11 12:06:11,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-11 12:06:11,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-11 12:06:11,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-11 12:06:11,965 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-11 12:06:11,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-11 12:06:12,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-11 12:06:12,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-11 12:06:12,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-11 12:06:12,486 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-11 12:06:12,487 INFO L275 PluginConnector]: CDTParser initialized [2020-09-11 12:06:12,488 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-11 12:06:12,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/986d452aa/5a77a55eb29e48ef95dcacca61596bd4/FLAGfa2c45b37 [2020-09-11 12:06:13,410 INFO L306 CDTParser]: Found 1 translation units. [2020-09-11 12:06:13,411 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread/singleton.i [2020-09-11 12:06:13,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/986d452aa/5a77a55eb29e48ef95dcacca61596bd4/FLAGfa2c45b37 [2020-09-11 12:06:13,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/986d452aa/5a77a55eb29e48ef95dcacca61596bd4 [2020-09-11 12:06:13,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-11 12:06:13,579 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-11 12:06:13,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-11 12:06:13,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-11 12:06:13,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-11 12:06:13,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 12:06:13" (1/1) ... [2020-09-11 12:06:13,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670d432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 12:06:13, skipping insertion in model container [2020-09-11 12:06:13,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 12:06:13" (1/1) ... [2020-09-11 12:06:13,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-11 12:06:13,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-11 12:06:14,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-11 12:06:14,384 INFO L203 MainTranslator]: Completed pre-run [2020-09-11 12:06:14,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-11 12:06:14,661 INFO L208 MainTranslator]: Completed translation [2020-09-11 12:06:14,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 12:06:14 WrapperNode [2020-09-11 12:06:14,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-11 12:06:14,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-11 12:06:14,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-11 12:06:14,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-11 12:06:14,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 12:06:14" (1/1) ... [2020-09-11 12:06:14,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 12:06:14" (1/1) ... [2020-09-11 12:06:14,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-11 12:06:14,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-11 12:06:14,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-11 12:06:14,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-11 12:06:14,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 12:06:14" (1/1) ... [2020-09-11 12:06:14,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 12:06:14" (1/1) ... [2020-09-11 12:06:14,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 12:06:14" (1/1) ... [2020-09-11 12:06:14,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 12:06:14" (1/1) ... [2020-09-11 12:06:14,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 12:06:14" (1/1) ... [2020-09-11 12:06:14,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 12:06:14" (1/1) ... [2020-09-11 12:06:14,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 12:06:14" (1/1) ... [2020-09-11 12:06:14,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-11 12:06:14,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-11 12:06:14,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-11 12:06:14,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-11 12:06:14,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 12:06:14" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-11 12:06:14,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-11 12:06:14,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-11 12:06:14,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-11 12:06:14,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-09-11 12:06:14,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-09-11 12:06:14,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-09-11 12:06:14,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-09-11 12:06:14,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-09-11 12:06:14,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-09-11 12:06:14,857 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-09-11 12:06:14,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-09-11 12:06:14,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-11 12:06:14,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-11 12:06:14,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-11 12:06:14,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-11 12:06:14,861 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-11 12:06:15,378 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-11 12:06:15,378 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-09-11 12:06:15,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 12:06:15 BoogieIcfgContainer [2020-09-11 12:06:15,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-11 12:06:15,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-11 12:06:15,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-11 12:06:15,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-11 12:06:15,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 12:06:13" (1/3) ... [2020-09-11 12:06:15,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a55f05c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 12:06:15, skipping insertion in model container [2020-09-11 12:06:15,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 12:06:14" (2/3) ... [2020-09-11 12:06:15,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a55f05c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 12:06:15, skipping insertion in model container [2020-09-11 12:06:15,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 12:06:15" (3/3) ... [2020-09-11 12:06:15,394 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-09-11 12:06:15,407 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-11 12:06:15,407 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-11 12:06:15,419 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-11 12:06:15,420 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-11 12:06:15,475 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,476 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,476 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,476 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,477 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,477 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,477 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,477 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,478 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,478 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,478 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,478 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,479 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,479 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,479 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,480 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,480 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,480 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,481 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,481 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,482 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,482 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,482 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,482 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,483 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,483 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,483 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,484 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,484 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,484 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,484 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,484 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,485 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,485 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,485 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,485 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,486 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,486 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,486 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,486 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,487 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,487 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,487 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,487 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,488 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,488 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,488 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,488 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,489 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,489 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,489 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,489 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,490 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,490 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,490 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,490 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,491 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,491 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,491 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,491 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,491 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,492 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,492 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,492 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,492 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,493 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,493 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,493 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,493 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,494 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,494 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,494 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,494 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,495 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,495 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,495 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,495 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,496 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,496 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,496 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,496 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,497 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,497 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,497 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,497 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,497 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,498 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,498 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,498 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,499 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,499 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,499 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,499 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,500 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,500 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,500 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,500 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,501 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,501 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,501 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,507 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,508 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,508 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,509 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,526 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,527 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,527 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,527 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,531 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,532 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,532 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,532 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,536 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,537 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,537 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,537 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,537 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,537 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,537 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,538 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,538 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,538 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,538 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,538 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,538 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,538 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,539 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,539 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,539 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,539 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,539 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,539 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,539 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,540 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,540 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,540 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,543 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,544 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,544 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,544 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,544 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,545 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,548 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,549 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,549 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,549 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,552 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,552 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,552 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,552 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,553 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,553 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,555 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,555 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,556 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,556 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,558 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,558 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,559 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,559 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,561 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,562 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,562 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,562 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,564 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,565 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,565 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,565 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 12:06:15,731 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-09-11 12:06:15,761 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 12:06:15,761 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 12:06:15,761 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-11 12:06:15,762 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 12:06:15,762 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 12:06:15,762 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 12:06:15,762 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 12:06:15,762 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 12:06:15,790 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions, 866 flow [2020-09-11 12:06:15,793 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-09-11 12:06:15,917 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-09-11 12:06:15,918 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-09-11 12:06:15,929 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-11 12:06:15,946 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-09-11 12:06:16,017 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-09-11 12:06:16,018 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-09-11 12:06:16,022 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-11 12:06:16,041 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4038 [2020-09-11 12:06:16,043 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-09-11 12:06:17,968 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-09-11 12:06:18,108 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-09-11 12:06:18,386 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2242 [2020-09-11 12:06:18,386 INFO L214 etLargeBlockEncoding]: Total number of compositions: 75 [2020-09-11 12:06:18,392 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 173 transitions, 726 flow [2020-09-11 12:06:19,042 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-09-11 12:06:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-09-11 12:06:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-11 12:06:19,057 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:19,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 12:06:19,060 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-11 12:06:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:19,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1069688068, now seen corresponding path program 1 times [2020-09-11 12:06:19,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:19,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102651821] [2020-09-11 12:06:19,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:19,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102651821] [2020-09-11 12:06:19,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:19,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 12:06:19,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165892302] [2020-09-11 12:06:19,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-11 12:06:19,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:19,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-11 12:06:19,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-11 12:06:19,574 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-09-11 12:06:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:20,024 INFO L93 Difference]: Finished difference Result 4760 states and 19900 transitions. [2020-09-11 12:06:20,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 12:06:20,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-09-11 12:06:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:20,101 INFO L225 Difference]: With dead ends: 4760 [2020-09-11 12:06:20,101 INFO L226 Difference]: Without dead ends: 4272 [2020-09-11 12:06:20,103 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-11 12:06:20,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2020-09-11 12:06:20,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3018. [2020-09-11 12:06:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-09-11 12:06:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-09-11 12:06:20,476 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-09-11 12:06:20,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:20,477 INFO L479 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-09-11 12:06:20,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-11 12:06:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-09-11 12:06:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-11 12:06:20,478 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:20,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 12:06:20,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-11 12:06:20,479 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-11 12:06:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1263032832, now seen corresponding path program 2 times [2020-09-11 12:06:20,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:20,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763709174] [2020-09-11 12:06:20,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:20,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763709174] [2020-09-11 12:06:20,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:20,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 12:06:20,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661043109] [2020-09-11 12:06:20,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-11 12:06:20,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:20,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-11 12:06:20,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-11 12:06:20,583 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-09-11 12:06:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:21,000 INFO L93 Difference]: Finished difference Result 5518 states and 23821 transitions. [2020-09-11 12:06:21,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-11 12:06:21,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-09-11 12:06:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:21,056 INFO L225 Difference]: With dead ends: 5518 [2020-09-11 12:06:21,057 INFO L226 Difference]: Without dead ends: 5518 [2020-09-11 12:06:21,058 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-11 12:06:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2020-09-11 12:06:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 3008. [2020-09-11 12:06:21,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-09-11 12:06:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-09-11 12:06:21,229 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-09-11 12:06:21,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:21,229 INFO L479 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-09-11 12:06:21,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-11 12:06:21,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-09-11 12:06:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-11 12:06:21,231 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:21,231 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 12:06:21,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-11 12:06:21,231 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-11 12:06:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:21,232 INFO L82 PathProgramCache]: Analyzing trace with hash -690496787, now seen corresponding path program 1 times [2020-09-11 12:06:21,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:21,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567352623] [2020-09-11 12:06:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:21,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567352623] [2020-09-11 12:06:21,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:21,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-11 12:06:21,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6597138] [2020-09-11 12:06:21,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 12:06:21,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:21,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 12:06:21,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 12:06:21,372 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-09-11 12:06:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:21,515 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-09-11 12:06:21,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 12:06:21,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-09-11 12:06:21,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:21,546 INFO L225 Difference]: With dead ends: 4848 [2020-09-11 12:06:21,546 INFO L226 Difference]: Without dead ends: 3558 [2020-09-11 12:06:21,547 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-11 12:06:21,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-09-11 12:06:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-09-11 12:06:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-09-11 12:06:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-09-11 12:06:21,778 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-09-11 12:06:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:21,778 INFO L479 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-09-11 12:06:21,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 12:06:21,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-09-11 12:06:21,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-11 12:06:21,781 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:21,781 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 12:06:21,781 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-11 12:06:21,781 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-11 12:06:21,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:21,782 INFO L82 PathProgramCache]: Analyzing trace with hash 69435085, now seen corresponding path program 1 times [2020-09-11 12:06:21,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:21,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823137538] [2020-09-11 12:06:21,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:21,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823137538] [2020-09-11 12:06:21,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:21,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 12:06:21,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609690149] [2020-09-11 12:06:21,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-11 12:06:21,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:21,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-11 12:06:21,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-11 12:06:21,904 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-09-11 12:06:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:22,149 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-09-11 12:06:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 12:06:22,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-09-11 12:06:22,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:22,172 INFO L225 Difference]: With dead ends: 4417 [2020-09-11 12:06:22,172 INFO L226 Difference]: Without dead ends: 4393 [2020-09-11 12:06:22,174 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-11 12:06:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-09-11 12:06:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-09-11 12:06:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-09-11 12:06:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-09-11 12:06:22,332 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-09-11 12:06:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:22,332 INFO L479 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-09-11 12:06:22,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-11 12:06:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-09-11 12:06:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-11 12:06:22,340 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:22,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 12:06:22,340 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-11 12:06:22,341 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-11 12:06:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash -954298863, now seen corresponding path program 2 times [2020-09-11 12:06:22,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:22,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520633656] [2020-09-11 12:06:22,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:22,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520633656] [2020-09-11 12:06:22,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:22,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 12:06:22,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169341459] [2020-09-11 12:06:22,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-11 12:06:22,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:22,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-11 12:06:22,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-11 12:06:22,499 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-09-11 12:06:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:22,629 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-09-11 12:06:22,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-11 12:06:22,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-09-11 12:06:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:22,650 INFO L225 Difference]: With dead ends: 4024 [2020-09-11 12:06:22,650 INFO L226 Difference]: Without dead ends: 4024 [2020-09-11 12:06:22,651 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-11 12:06:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-09-11 12:06:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-09-11 12:06:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-09-11 12:06:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-09-11 12:06:22,919 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-09-11 12:06:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:22,920 INFO L479 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-09-11 12:06:22,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-11 12:06:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-09-11 12:06:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 12:06:22,922 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:22,922 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-11 12:06:22,922 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-11 12:06:22,922 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-11 12:06:22,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash -687500069, now seen corresponding path program 1 times [2020-09-11 12:06:22,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:22,923 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363531431] [2020-09-11 12:06:22,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:23,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363531431] [2020-09-11 12:06:23,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:23,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 12:06:23,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823780061] [2020-09-11 12:06:23,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-11 12:06:23,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:23,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-11 12:06:23,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-11 12:06:23,014 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-09-11 12:06:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:23,262 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-09-11 12:06:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 12:06:23,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-09-11 12:06:23,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:23,287 INFO L225 Difference]: With dead ends: 4225 [2020-09-11 12:06:23,287 INFO L226 Difference]: Without dead ends: 4129 [2020-09-11 12:06:23,287 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-11 12:06:23,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-09-11 12:06:23,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-09-11 12:06:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-09-11 12:06:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-09-11 12:06:23,429 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-09-11 12:06:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:23,429 INFO L479 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-09-11 12:06:23,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-11 12:06:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-09-11 12:06:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 12:06:23,431 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:23,431 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-11 12:06:23,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-11 12:06:23,432 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-11 12:06:23,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:23,433 INFO L82 PathProgramCache]: Analyzing trace with hash -454402421, now seen corresponding path program 2 times [2020-09-11 12:06:23,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:23,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094479975] [2020-09-11 12:06:23,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:23,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094479975] [2020-09-11 12:06:23,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:23,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-11 12:06:23,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808651335] [2020-09-11 12:06:23,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 12:06:23,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:23,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 12:06:23,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-11 12:06:23,539 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 7 states. [2020-09-11 12:06:23,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:23,851 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-09-11 12:06:23,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 12:06:23,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-09-11 12:06:23,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:23,875 INFO L225 Difference]: With dead ends: 4979 [2020-09-11 12:06:23,875 INFO L226 Difference]: Without dead ends: 4905 [2020-09-11 12:06:23,876 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-11 12:06:23,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-09-11 12:06:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-09-11 12:06:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-09-11 12:06:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-09-11 12:06:24,493 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-09-11 12:06:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:24,494 INFO L479 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-09-11 12:06:24,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 12:06:24,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-09-11 12:06:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 12:06:24,496 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:24,496 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-11 12:06:24,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-11 12:06:24,496 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-11 12:06:24,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:24,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1254406997, now seen corresponding path program 3 times [2020-09-11 12:06:24,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:24,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302799229] [2020-09-11 12:06:24,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:24,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302799229] [2020-09-11 12:06:24,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:24,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 12:06:24,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748674296] [2020-09-11 12:06:24,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-11 12:06:24,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:24,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-11 12:06:24,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-11 12:06:24,675 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 8 states. [2020-09-11 12:06:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:25,012 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-09-11 12:06:25,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-11 12:06:25,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-09-11 12:06:25,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:25,040 INFO L225 Difference]: With dead ends: 6735 [2020-09-11 12:06:25,040 INFO L226 Difference]: Without dead ends: 6661 [2020-09-11 12:06:25,042 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-11 12:06:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-09-11 12:06:25,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-09-11 12:06:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-09-11 12:06:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-09-11 12:06:25,241 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-09-11 12:06:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:25,242 INFO L479 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-09-11 12:06:25,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-11 12:06:25,242 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-09-11 12:06:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 12:06:25,244 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:25,244 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-11 12:06:25,245 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-11 12:06:25,245 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-11 12:06:25,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:25,245 INFO L82 PathProgramCache]: Analyzing trace with hash -164095139, now seen corresponding path program 4 times [2020-09-11 12:06:25,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:25,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179874747] [2020-09-11 12:06:25,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:25,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179874747] [2020-09-11 12:06:25,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:25,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-11 12:06:25,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368156342] [2020-09-11 12:06:25,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-11 12:06:25,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:25,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-11 12:06:25,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-09-11 12:06:25,455 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 10 states. [2020-09-11 12:06:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:25,903 INFO L93 Difference]: Finished difference Result 5374 states and 21882 transitions. [2020-09-11 12:06:25,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-11 12:06:25,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-09-11 12:06:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:25,922 INFO L225 Difference]: With dead ends: 5374 [2020-09-11 12:06:25,922 INFO L226 Difference]: Without dead ends: 5300 [2020-09-11 12:06:25,923 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-09-11 12:06:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2020-09-11 12:06:26,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 4114. [2020-09-11 12:06:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2020-09-11 12:06:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 16572 transitions. [2020-09-11 12:06:26,145 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 16572 transitions. Word has length 18 [2020-09-11 12:06:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:26,152 INFO L479 AbstractCegarLoop]: Abstraction has 4114 states and 16572 transitions. [2020-09-11 12:06:26,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-11 12:06:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 16572 transitions. [2020-09-11 12:06:26,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 12:06:26,155 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:26,155 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-11 12:06:26,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-11 12:06:26,156 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-11 12:06:26,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:26,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2041625758, now seen corresponding path program 1 times [2020-09-11 12:06:26,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:26,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596116349] [2020-09-11 12:06:26,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:26,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596116349] [2020-09-11 12:06:26,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:26,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-11 12:06:26,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34781333] [2020-09-11 12:06:26,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 12:06:26,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:26,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 12:06:26,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-11 12:06:26,298 INFO L87 Difference]: Start difference. First operand 4114 states and 16572 transitions. Second operand 7 states. [2020-09-11 12:06:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:26,439 INFO L93 Difference]: Finished difference Result 4623 states and 18113 transitions. [2020-09-11 12:06:26,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-11 12:06:26,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-11 12:06:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:26,452 INFO L225 Difference]: With dead ends: 4623 [2020-09-11 12:06:26,452 INFO L226 Difference]: Without dead ends: 4623 [2020-09-11 12:06:26,453 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-11 12:06:26,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4623 states. [2020-09-11 12:06:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4623 to 4076. [2020-09-11 12:06:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2020-09-11 12:06:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 16430 transitions. [2020-09-11 12:06:26,576 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 16430 transitions. Word has length 19 [2020-09-11 12:06:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:26,576 INFO L479 AbstractCegarLoop]: Abstraction has 4076 states and 16430 transitions. [2020-09-11 12:06:26,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 12:06:26,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 16430 transitions. [2020-09-11 12:06:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 12:06:26,579 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:26,579 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-11 12:06:26,579 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-11 12:06:26,580 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-11 12:06:26,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:26,580 INFO L82 PathProgramCache]: Analyzing trace with hash 898872146, now seen corresponding path program 1 times [2020-09-11 12:06:26,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:26,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706820081] [2020-09-11 12:06:26,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:26,774 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706820081] [2020-09-11 12:06:26,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:26,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 12:06:26,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514352049] [2020-09-11 12:06:26,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 12:06:26,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:26,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 12:06:26,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-11 12:06:26,776 INFO L87 Difference]: Start difference. First operand 4076 states and 16430 transitions. Second operand 11 states. [2020-09-11 12:06:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:27,355 INFO L93 Difference]: Finished difference Result 5825 states and 24230 transitions. [2020-09-11 12:06:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 12:06:27,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-09-11 12:06:27,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:27,371 INFO L225 Difference]: With dead ends: 5825 [2020-09-11 12:06:27,372 INFO L226 Difference]: Without dead ends: 5751 [2020-09-11 12:06:27,372 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-09-11 12:06:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5751 states. [2020-09-11 12:06:27,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5751 to 4013. [2020-09-11 12:06:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2020-09-11 12:06:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16198 transitions. [2020-09-11 12:06:27,578 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16198 transitions. Word has length 19 [2020-09-11 12:06:27,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:27,579 INFO L479 AbstractCegarLoop]: Abstraction has 4013 states and 16198 transitions. [2020-09-11 12:06:27,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 12:06:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16198 transitions. [2020-09-11 12:06:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-11 12:06:27,581 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:27,582 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-11 12:06:27,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-11 12:06:27,582 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-11 12:06:27,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:27,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1134272272, now seen corresponding path program 1 times [2020-09-11 12:06:27,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:27,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233266920] [2020-09-11 12:06:27,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:27,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233266920] [2020-09-11 12:06:27,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:27,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-11 12:06:27,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634859896] [2020-09-11 12:06:27,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 12:06:27,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:27,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 12:06:27,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-09-11 12:06:27,721 INFO L87 Difference]: Start difference. First operand 4013 states and 16198 transitions. Second operand 9 states. [2020-09-11 12:06:28,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:28,136 INFO L93 Difference]: Finished difference Result 5428 states and 21853 transitions. [2020-09-11 12:06:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-11 12:06:28,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-09-11 12:06:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:28,151 INFO L225 Difference]: With dead ends: 5428 [2020-09-11 12:06:28,151 INFO L226 Difference]: Without dead ends: 5382 [2020-09-11 12:06:28,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-09-11 12:06:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5382 states. [2020-09-11 12:06:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5382 to 4166. [2020-09-11 12:06:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4166 states. [2020-09-11 12:06:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 16924 transitions. [2020-09-11 12:06:28,280 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 16924 transitions. Word has length 20 [2020-09-11 12:06:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:28,281 INFO L479 AbstractCegarLoop]: Abstraction has 4166 states and 16924 transitions. [2020-09-11 12:06:28,281 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 12:06:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 16924 transitions. [2020-09-11 12:06:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-11 12:06:28,284 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:28,284 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-11 12:06:28,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-11 12:06:28,285 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-11 12:06:28,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:28,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1058647793, now seen corresponding path program 1 times [2020-09-11 12:06:28,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:28,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148430575] [2020-09-11 12:06:28,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:28,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148430575] [2020-09-11 12:06:28,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:28,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-11 12:06:28,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048584659] [2020-09-11 12:06:28,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 12:06:28,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:28,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 12:06:28,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-11 12:06:28,450 INFO L87 Difference]: Start difference. First operand 4166 states and 16924 transitions. Second operand 9 states. [2020-09-11 12:06:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:28,812 INFO L93 Difference]: Finished difference Result 5500 states and 22434 transitions. [2020-09-11 12:06:28,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 12:06:28,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-09-11 12:06:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:28,827 INFO L225 Difference]: With dead ends: 5500 [2020-09-11 12:06:28,827 INFO L226 Difference]: Without dead ends: 5454 [2020-09-11 12:06:28,828 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-11 12:06:28,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5454 states. [2020-09-11 12:06:28,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5454 to 4012. [2020-09-11 12:06:28,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4012 states. [2020-09-11 12:06:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4012 states to 4012 states and 16195 transitions. [2020-09-11 12:06:28,957 INFO L78 Accepts]: Start accepts. Automaton has 4012 states and 16195 transitions. Word has length 20 [2020-09-11 12:06:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:28,957 INFO L479 AbstractCegarLoop]: Abstraction has 4012 states and 16195 transitions. [2020-09-11 12:06:28,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 12:06:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 4012 states and 16195 transitions. [2020-09-11 12:06:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-11 12:06:28,960 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:28,960 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-11 12:06:28,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-11 12:06:28,961 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-11 12:06:28,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:28,961 INFO L82 PathProgramCache]: Analyzing trace with hash 2045819536, now seen corresponding path program 2 times [2020-09-11 12:06:28,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:28,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716640294] [2020-09-11 12:06:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:29,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716640294] [2020-09-11 12:06:29,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:29,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-11 12:06:29,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624140703] [2020-09-11 12:06:29,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-11 12:06:29,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:29,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-11 12:06:29,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-09-11 12:06:29,148 INFO L87 Difference]: Start difference. First operand 4012 states and 16195 transitions. Second operand 10 states. [2020-09-11 12:06:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:29,705 INFO L93 Difference]: Finished difference Result 5781 states and 23394 transitions. [2020-09-11 12:06:29,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 12:06:29,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-09-11 12:06:29,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:29,721 INFO L225 Difference]: With dead ends: 5781 [2020-09-11 12:06:29,722 INFO L226 Difference]: Without dead ends: 5735 [2020-09-11 12:06:29,722 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-09-11 12:06:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5735 states. [2020-09-11 12:06:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5735 to 4148. [2020-09-11 12:06:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4148 states. [2020-09-11 12:06:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 16836 transitions. [2020-09-11 12:06:29,865 INFO L78 Accepts]: Start accepts. Automaton has 4148 states and 16836 transitions. Word has length 20 [2020-09-11 12:06:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:29,866 INFO L479 AbstractCegarLoop]: Abstraction has 4148 states and 16836 transitions. [2020-09-11 12:06:29,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-11 12:06:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4148 states and 16836 transitions. [2020-09-11 12:06:29,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-11 12:06:29,868 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:29,869 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-11 12:06:29,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-11 12:06:29,869 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-11 12:06:29,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:29,869 INFO L82 PathProgramCache]: Analyzing trace with hash 258643217, now seen corresponding path program 2 times [2020-09-11 12:06:29,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:29,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919599829] [2020-09-11 12:06:29,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:30,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919599829] [2020-09-11 12:06:30,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:30,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-11 12:06:30,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40674369] [2020-09-11 12:06:30,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-11 12:06:30,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:30,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-11 12:06:30,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-11 12:06:30,036 INFO L87 Difference]: Start difference. First operand 4148 states and 16836 transitions. Second operand 10 states. [2020-09-11 12:06:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:30,493 INFO L93 Difference]: Finished difference Result 6399 states and 26032 transitions. [2020-09-11 12:06:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-11 12:06:30,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-09-11 12:06:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:30,513 INFO L225 Difference]: With dead ends: 6399 [2020-09-11 12:06:30,513 INFO L226 Difference]: Without dead ends: 6353 [2020-09-11 12:06:30,516 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-11 12:06:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6353 states. [2020-09-11 12:06:30,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6353 to 3978. [2020-09-11 12:06:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2020-09-11 12:06:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 16074 transitions. [2020-09-11 12:06:30,650 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 16074 transitions. Word has length 20 [2020-09-11 12:06:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:30,650 INFO L479 AbstractCegarLoop]: Abstraction has 3978 states and 16074 transitions. [2020-09-11 12:06:30,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-11 12:06:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 16074 transitions. [2020-09-11 12:06:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-11 12:06:30,652 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:30,652 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-11 12:06:30,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-11 12:06:30,653 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-11 12:06:30,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:30,653 INFO L82 PathProgramCache]: Analyzing trace with hash 657525156, now seen corresponding path program 3 times [2020-09-11 12:06:30,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:30,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279099387] [2020-09-11 12:06:30,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:30,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279099387] [2020-09-11 12:06:30,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:30,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-11 12:06:30,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937398658] [2020-09-11 12:06:30,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 12:06:30,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:30,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 12:06:30,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-11 12:06:30,741 INFO L87 Difference]: Start difference. First operand 3978 states and 16074 transitions. Second operand 7 states. [2020-09-11 12:06:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:31,032 INFO L93 Difference]: Finished difference Result 6325 states and 25457 transitions. [2020-09-11 12:06:31,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-11 12:06:31,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-09-11 12:06:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:31,049 INFO L225 Difference]: With dead ends: 6325 [2020-09-11 12:06:31,049 INFO L226 Difference]: Without dead ends: 6279 [2020-09-11 12:06:31,050 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-09-11 12:06:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2020-09-11 12:06:31,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 3948. [2020-09-11 12:06:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2020-09-11 12:06:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 16005 transitions. [2020-09-11 12:06:31,155 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 16005 transitions. Word has length 20 [2020-09-11 12:06:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:31,155 INFO L479 AbstractCegarLoop]: Abstraction has 3948 states and 16005 transitions. [2020-09-11 12:06:31,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 12:06:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 16005 transitions. [2020-09-11 12:06:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 12:06:31,158 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:31,159 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-11 12:06:31,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-11 12:06:31,159 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-11 12:06:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1935934284, now seen corresponding path program 1 times [2020-09-11 12:06:31,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:31,160 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455943950] [2020-09-11 12:06:31,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:31,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455943950] [2020-09-11 12:06:31,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:31,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 12:06:31,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169610299] [2020-09-11 12:06:31,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-11 12:06:31,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:31,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-11 12:06:31,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-11 12:06:31,232 INFO L87 Difference]: Start difference. First operand 3948 states and 16005 transitions. Second operand 6 states. [2020-09-11 12:06:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:31,458 INFO L93 Difference]: Finished difference Result 4727 states and 18672 transitions. [2020-09-11 12:06:31,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 12:06:31,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-09-11 12:06:31,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:31,473 INFO L225 Difference]: With dead ends: 4727 [2020-09-11 12:06:31,473 INFO L226 Difference]: Without dead ends: 4652 [2020-09-11 12:06:31,474 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-11 12:06:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2020-09-11 12:06:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 4270. [2020-09-11 12:06:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4270 states. [2020-09-11 12:06:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 17192 transitions. [2020-09-11 12:06:31,593 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 17192 transitions. Word has length 21 [2020-09-11 12:06:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:31,595 INFO L479 AbstractCegarLoop]: Abstraction has 4270 states and 17192 transitions. [2020-09-11 12:06:31,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-11 12:06:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 17192 transitions. [2020-09-11 12:06:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 12:06:31,598 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:31,598 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-11 12:06:31,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-11 12:06:31,599 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-11 12:06:31,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:31,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1183087759, now seen corresponding path program 1 times [2020-09-11 12:06:31,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:31,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962447818] [2020-09-11 12:06:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:31,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962447818] [2020-09-11 12:06:31,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:31,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 12:06:31,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824422178] [2020-09-11 12:06:31,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-11 12:06:31,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:31,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-11 12:06:31,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-11 12:06:31,743 INFO L87 Difference]: Start difference. First operand 4270 states and 17192 transitions. Second operand 8 states. [2020-09-11 12:06:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:31,918 INFO L93 Difference]: Finished difference Result 4820 states and 18862 transitions. [2020-09-11 12:06:31,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-11 12:06:31,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-09-11 12:06:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:31,930 INFO L225 Difference]: With dead ends: 4820 [2020-09-11 12:06:31,930 INFO L226 Difference]: Without dead ends: 4296 [2020-09-11 12:06:31,930 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-11 12:06:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2020-09-11 12:06:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3680. [2020-09-11 12:06:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2020-09-11 12:06:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 14531 transitions. [2020-09-11 12:06:32,003 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 14531 transitions. Word has length 21 [2020-09-11 12:06:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:32,003 INFO L479 AbstractCegarLoop]: Abstraction has 3680 states and 14531 transitions. [2020-09-11 12:06:32,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-11 12:06:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 14531 transitions. [2020-09-11 12:06:32,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 12:06:32,006 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:32,006 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-11 12:06:32,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-11 12:06:32,006 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-11 12:06:32,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:32,007 INFO L82 PathProgramCache]: Analyzing trace with hash 558787563, now seen corresponding path program 1 times [2020-09-11 12:06:32,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:32,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957786912] [2020-09-11 12:06:32,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:32,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957786912] [2020-09-11 12:06:32,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:32,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 12:06:32,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462619187] [2020-09-11 12:06:32,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 12:06:32,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:32,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 12:06:32,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-09-11 12:06:32,211 INFO L87 Difference]: Start difference. First operand 3680 states and 14531 transitions. Second operand 11 states. [2020-09-11 12:06:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:32,674 INFO L93 Difference]: Finished difference Result 4556 states and 17623 transitions. [2020-09-11 12:06:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 12:06:32,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-09-11 12:06:32,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:32,685 INFO L225 Difference]: With dead ends: 4556 [2020-09-11 12:06:32,685 INFO L226 Difference]: Without dead ends: 4507 [2020-09-11 12:06:32,685 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-11 12:06:32,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2020-09-11 12:06:32,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3330. [2020-09-11 12:06:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3330 states. [2020-09-11 12:06:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 12802 transitions. [2020-09-11 12:06:32,755 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 12802 transitions. Word has length 21 [2020-09-11 12:06:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:32,755 INFO L479 AbstractCegarLoop]: Abstraction has 3330 states and 12802 transitions. [2020-09-11 12:06:32,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 12:06:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 12802 transitions. [2020-09-11 12:06:32,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 12:06:32,757 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:32,757 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-11 12:06:32,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-11 12:06:32,758 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-11 12:06:32,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:32,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2087336367, now seen corresponding path program 1 times [2020-09-11 12:06:32,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:32,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349565625] [2020-09-11 12:06:32,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:32,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349565625] [2020-09-11 12:06:32,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:32,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-11 12:06:32,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939388128] [2020-09-11 12:06:32,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 12:06:32,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:32,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 12:06:32,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-09-11 12:06:32,970 INFO L87 Difference]: Start difference. First operand 3330 states and 12802 transitions. Second operand 12 states. [2020-09-11 12:06:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:33,352 INFO L93 Difference]: Finished difference Result 3991 states and 15112 transitions. [2020-09-11 12:06:33,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-11 12:06:33,353 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-09-11 12:06:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:33,364 INFO L225 Difference]: With dead ends: 3991 [2020-09-11 12:06:33,364 INFO L226 Difference]: Without dead ends: 3835 [2020-09-11 12:06:33,365 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2020-09-11 12:06:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2020-09-11 12:06:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 2831. [2020-09-11 12:06:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-09-11 12:06:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-09-11 12:06:33,428 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-09-11 12:06:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:33,428 INFO L479 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-09-11 12:06:33,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 12:06:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-09-11 12:06:33,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 12:06:33,431 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:33,431 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-11 12:06:33,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-11 12:06:33,432 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-11 12:06:33,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:33,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1396456954, now seen corresponding path program 1 times [2020-09-11 12:06:33,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:33,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934900202] [2020-09-11 12:06:33,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:33,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934900202] [2020-09-11 12:06:33,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:33,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-11 12:06:33,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924612989] [2020-09-11 12:06:33,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 12:06:33,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:33,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 12:06:33,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-11 12:06:33,546 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 7 states. [2020-09-11 12:06:33,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:33,779 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2020-09-11 12:06:33,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 12:06:33,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-09-11 12:06:33,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:33,791 INFO L225 Difference]: With dead ends: 3550 [2020-09-11 12:06:33,791 INFO L226 Difference]: Without dead ends: 3490 [2020-09-11 12:06:33,793 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-11 12:06:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2020-09-11 12:06:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2020-09-11 12:06:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2020-09-11 12:06:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2020-09-11 12:06:33,909 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2020-09-11 12:06:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:33,910 INFO L479 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2020-09-11 12:06:33,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 12:06:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2020-09-11 12:06:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 12:06:33,913 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:33,913 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-11 12:06:33,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-11 12:06:33,913 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-11 12:06:33,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:33,914 INFO L82 PathProgramCache]: Analyzing trace with hash 644682778, now seen corresponding path program 2 times [2020-09-11 12:06:33,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:33,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58221395] [2020-09-11 12:06:33,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:34,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-11 12:06:34,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58221395] [2020-09-11 12:06:34,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:34,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 12:06:34,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964066222] [2020-09-11 12:06:34,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-11 12:06:34,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:34,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-11 12:06:34,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-11 12:06:34,023 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 8 states. [2020-09-11 12:06:34,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:34,350 INFO L93 Difference]: Finished difference Result 3540 states and 13065 transitions. [2020-09-11 12:06:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 12:06:34,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-09-11 12:06:34,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:34,358 INFO L225 Difference]: With dead ends: 3540 [2020-09-11 12:06:34,359 INFO L226 Difference]: Without dead ends: 3480 [2020-09-11 12:06:34,359 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-11 12:06:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2020-09-11 12:06:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 2822. [2020-09-11 12:06:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-09-11 12:06:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-09-11 12:06:34,406 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-09-11 12:06:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:34,407 INFO L479 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-09-11 12:06:34,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-11 12:06:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-09-11 12:06:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 12:06:34,410 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:34,410 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-11 12:06:34,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-11 12:06:34,410 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-11 12:06:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash -787433364, now seen corresponding path program 3 times [2020-09-11 12:06:34,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:34,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089265945] [2020-09-11 12:06:34,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:34,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089265945] [2020-09-11 12:06:34,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:34,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-11 12:06:34,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827116754] [2020-09-11 12:06:34,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 12:06:34,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:34,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 12:06:34,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 12:06:34,577 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 9 states. [2020-09-11 12:06:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:34,909 INFO L93 Difference]: Finished difference Result 3525 states and 13034 transitions. [2020-09-11 12:06:34,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-11 12:06:34,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-09-11 12:06:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:34,919 INFO L225 Difference]: With dead ends: 3525 [2020-09-11 12:06:34,919 INFO L226 Difference]: Without dead ends: 3465 [2020-09-11 12:06:34,919 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-11 12:06:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2020-09-11 12:06:34,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 2822. [2020-09-11 12:06:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-09-11 12:06:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-09-11 12:06:34,977 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-09-11 12:06:34,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:34,977 INFO L479 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-09-11 12:06:34,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 12:06:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-09-11 12:06:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 12:06:34,980 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:34,980 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-11 12:06:34,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-11 12:06:34,981 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-11 12:06:34,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:34,981 INFO L82 PathProgramCache]: Analyzing trace with hash -270857424, now seen corresponding path program 4 times [2020-09-11 12:06:34,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:34,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026729678] [2020-09-11 12:06:34,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:35,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026729678] [2020-09-11 12:06:35,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:35,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 12:06:35,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15318904] [2020-09-11 12:06:35,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 12:06:35,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:35,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 12:06:35,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-09-11 12:06:35,239 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 11 states. [2020-09-11 12:06:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:35,728 INFO L93 Difference]: Finished difference Result 3740 states and 13820 transitions. [2020-09-11 12:06:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-11 12:06:35,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-09-11 12:06:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:35,738 INFO L225 Difference]: With dead ends: 3740 [2020-09-11 12:06:35,738 INFO L226 Difference]: Without dead ends: 3680 [2020-09-11 12:06:35,739 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-11 12:06:35,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2020-09-11 12:06:35,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 2822. [2020-09-11 12:06:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-09-11 12:06:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10603 transitions. [2020-09-11 12:06:35,787 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10603 transitions. Word has length 22 [2020-09-11 12:06:35,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:35,788 INFO L479 AbstractCegarLoop]: Abstraction has 2822 states and 10603 transitions. [2020-09-11 12:06:35,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 12:06:35,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10603 transitions. [2020-09-11 12:06:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 12:06:35,790 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:35,790 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-11 12:06:35,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-11 12:06:35,790 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-11 12:06:35,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:35,790 INFO L82 PathProgramCache]: Analyzing trace with hash -503603988, now seen corresponding path program 5 times [2020-09-11 12:06:35,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:35,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261245703] [2020-09-11 12:06:35,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:35,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261245703] [2020-09-11 12:06:35,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:35,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-11 12:06:35,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027173464] [2020-09-11 12:06:35,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 12:06:35,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:35,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 12:06:35,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 12:06:35,947 INFO L87 Difference]: Start difference. First operand 2822 states and 10603 transitions. Second operand 9 states. [2020-09-11 12:06:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:36,235 INFO L93 Difference]: Finished difference Result 4237 states and 15414 transitions. [2020-09-11 12:06:36,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-11 12:06:36,235 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-09-11 12:06:36,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:36,245 INFO L225 Difference]: With dead ends: 4237 [2020-09-11 12:06:36,245 INFO L226 Difference]: Without dead ends: 4177 [2020-09-11 12:06:36,246 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-09-11 12:06:36,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2020-09-11 12:06:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 2670. [2020-09-11 12:06:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-09-11 12:06:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2020-09-11 12:06:36,298 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2020-09-11 12:06:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:36,298 INFO L479 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2020-09-11 12:06:36,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 12:06:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2020-09-11 12:06:36,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 12:06:36,300 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:36,300 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-11 12:06:36,300 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-11 12:06:36,301 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-11 12:06:36,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:36,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1684489160, now seen corresponding path program 1 times [2020-09-11 12:06:36,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:36,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136281019] [2020-09-11 12:06:36,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:36,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136281019] [2020-09-11 12:06:36,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:36,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-11 12:06:36,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368314198] [2020-09-11 12:06:36,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 12:06:36,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:36,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 12:06:36,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-09-11 12:06:36,612 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2020-09-11 12:06:37,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:37,019 INFO L93 Difference]: Finished difference Result 3103 states and 11113 transitions. [2020-09-11 12:06:37,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-11 12:06:37,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-09-11 12:06:37,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:37,027 INFO L225 Difference]: With dead ends: 3103 [2020-09-11 12:06:37,027 INFO L226 Difference]: Without dead ends: 3007 [2020-09-11 12:06:37,028 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-11 12:06:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2020-09-11 12:06:37,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2170. [2020-09-11 12:06:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2020-09-11 12:06:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2020-09-11 12:06:37,066 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 23 [2020-09-11 12:06:37,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:37,067 INFO L479 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2020-09-11 12:06:37,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 12:06:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2020-09-11 12:06:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 12:06:37,069 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:37,069 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-11 12:06:37,069 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-11 12:06:37,069 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-11 12:06:37,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:37,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1357008819, now seen corresponding path program 1 times [2020-09-11 12:06:37,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:37,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830940867] [2020-09-11 12:06:37,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:37,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830940867] [2020-09-11 12:06:37,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:37,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-11 12:06:37,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306301062] [2020-09-11 12:06:37,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-11 12:06:37,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:37,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-11 12:06:37,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-11 12:06:37,244 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 10 states. [2020-09-11 12:06:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:37,693 INFO L93 Difference]: Finished difference Result 3115 states and 11153 transitions. [2020-09-11 12:06:37,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-11 12:06:37,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-09-11 12:06:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:37,701 INFO L225 Difference]: With dead ends: 3115 [2020-09-11 12:06:37,702 INFO L226 Difference]: Without dead ends: 3058 [2020-09-11 12:06:37,702 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-11 12:06:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-09-11 12:06:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2130. [2020-09-11 12:06:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2020-09-11 12:06:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 7633 transitions. [2020-09-11 12:06:37,741 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 7633 transitions. Word has length 23 [2020-09-11 12:06:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:37,741 INFO L479 AbstractCegarLoop]: Abstraction has 2130 states and 7633 transitions. [2020-09-11 12:06:37,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-11 12:06:37,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 7633 transitions. [2020-09-11 12:06:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 12:06:37,743 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:37,744 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-11 12:06:37,744 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-09-11 12:06:37,744 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-11 12:06:37,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:37,744 INFO L82 PathProgramCache]: Analyzing trace with hash -840432879, now seen corresponding path program 2 times [2020-09-11 12:06:37,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:37,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996356376] [2020-09-11 12:06:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:37,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996356376] [2020-09-11 12:06:37,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:37,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-11 12:06:37,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491199041] [2020-09-11 12:06:37,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 12:06:37,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:37,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 12:06:37,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-09-11 12:06:37,976 INFO L87 Difference]: Start difference. First operand 2130 states and 7633 transitions. Second operand 12 states. [2020-09-11 12:06:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:38,374 INFO L93 Difference]: Finished difference Result 2799 states and 9853 transitions. [2020-09-11 12:06:38,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-11 12:06:38,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-09-11 12:06:38,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:38,382 INFO L225 Difference]: With dead ends: 2799 [2020-09-11 12:06:38,382 INFO L226 Difference]: Without dead ends: 2682 [2020-09-11 12:06:38,382 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2020-09-11 12:06:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2020-09-11 12:06:38,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 1794. [2020-09-11 12:06:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-09-11 12:06:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2020-09-11 12:06:38,413 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2020-09-11 12:06:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:38,413 INFO L479 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2020-09-11 12:06:38,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 12:06:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2020-09-11 12:06:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-11 12:06:38,414 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:38,415 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-11 12:06:38,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-09-11 12:06:38,415 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-11 12:06:38,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:38,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1309010247, now seen corresponding path program 1 times [2020-09-11 12:06:38,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:38,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819891843] [2020-09-11 12:06:38,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:38,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819891843] [2020-09-11 12:06:38,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:38,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 12:06:38,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835837605] [2020-09-11 12:06:38,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-11 12:06:38,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:38,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-11 12:06:38,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-11 12:06:38,503 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 6 states. [2020-09-11 12:06:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:38,705 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2020-09-11 12:06:38,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 12:06:38,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-09-11 12:06:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:38,711 INFO L225 Difference]: With dead ends: 2291 [2020-09-11 12:06:38,711 INFO L226 Difference]: Without dead ends: 2227 [2020-09-11 12:06:38,712 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-11 12:06:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2020-09-11 12:06:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2020-09-11 12:06:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-09-11 12:06:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2020-09-11 12:06:38,748 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2020-09-11 12:06:38,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:38,748 INFO L479 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2020-09-11 12:06:38,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-11 12:06:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2020-09-11 12:06:38,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-11 12:06:38,750 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:38,750 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-11 12:06:38,750 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-09-11 12:06:38,751 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-11 12:06:38,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:38,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1793125216, now seen corresponding path program 1 times [2020-09-11 12:06:38,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:38,751 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111318403] [2020-09-11 12:06:38,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:38,882 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111318403] [2020-09-11 12:06:38,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:38,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-11 12:06:38,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866461672] [2020-09-11 12:06:38,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 12:06:38,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:38,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 12:06:38,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-11 12:06:38,884 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 9 states. [2020-09-11 12:06:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:39,201 INFO L93 Difference]: Finished difference Result 2954 states and 10228 transitions. [2020-09-11 12:06:39,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 12:06:39,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-09-11 12:06:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:39,212 INFO L225 Difference]: With dead ends: 2954 [2020-09-11 12:06:39,212 INFO L226 Difference]: Without dead ends: 2930 [2020-09-11 12:06:39,213 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-11 12:06:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-09-11 12:06:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2105. [2020-09-11 12:06:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2020-09-11 12:06:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 7278 transitions. [2020-09-11 12:06:39,288 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 7278 transitions. Word has length 24 [2020-09-11 12:06:39,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:39,289 INFO L479 AbstractCegarLoop]: Abstraction has 2105 states and 7278 transitions. [2020-09-11 12:06:39,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 12:06:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 7278 transitions. [2020-09-11 12:06:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-11 12:06:39,293 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:39,294 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-11 12:06:39,294 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-09-11 12:06:39,294 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-11 12:06:39,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:39,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1041351040, now seen corresponding path program 2 times [2020-09-11 12:06:39,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:39,296 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580671514] [2020-09-11 12:06:39,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:39,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580671514] [2020-09-11 12:06:39,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:39,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-11 12:06:39,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735366778] [2020-09-11 12:06:39,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-11 12:06:39,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:39,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-11 12:06:39,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-11 12:06:39,491 INFO L87 Difference]: Start difference. First operand 2105 states and 7278 transitions. Second operand 10 states. [2020-09-11 12:06:39,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:39,895 INFO L93 Difference]: Finished difference Result 2941 states and 10205 transitions. [2020-09-11 12:06:39,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-11 12:06:39,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-09-11 12:06:39,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:39,908 INFO L225 Difference]: With dead ends: 2941 [2020-09-11 12:06:39,908 INFO L226 Difference]: Without dead ends: 2917 [2020-09-11 12:06:39,909 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-11 12:06:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-09-11 12:06:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2102. [2020-09-11 12:06:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-09-11 12:06:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7274 transitions. [2020-09-11 12:06:39,997 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7274 transitions. Word has length 24 [2020-09-11 12:06:39,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:39,998 INFO L479 AbstractCegarLoop]: Abstraction has 2102 states and 7274 transitions. [2020-09-11 12:06:39,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-11 12:06:39,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7274 transitions. [2020-09-11 12:06:40,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-11 12:06:40,003 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:40,003 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-11 12:06:40,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-09-11 12:06:40,004 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-11 12:06:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:40,004 INFO L82 PathProgramCache]: Analyzing trace with hash -106935726, now seen corresponding path program 3 times [2020-09-11 12:06:40,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:40,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346271480] [2020-09-11 12:06:40,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:40,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:40,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346271480] [2020-09-11 12:06:40,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:40,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-11 12:06:40,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888224408] [2020-09-11 12:06:40,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 12:06:40,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:40,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 12:06:40,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-09-11 12:06:40,269 INFO L87 Difference]: Start difference. First operand 2102 states and 7274 transitions. Second operand 11 states. [2020-09-11 12:06:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:40,747 INFO L93 Difference]: Finished difference Result 3197 states and 11098 transitions. [2020-09-11 12:06:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-11 12:06:40,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-09-11 12:06:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:40,756 INFO L225 Difference]: With dead ends: 3197 [2020-09-11 12:06:40,756 INFO L226 Difference]: Without dead ends: 3173 [2020-09-11 12:06:40,756 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-11 12:06:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2020-09-11 12:06:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 1742. [2020-09-11 12:06:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2020-09-11 12:06:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 5952 transitions. [2020-09-11 12:06:40,812 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 5952 transitions. Word has length 24 [2020-09-11 12:06:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:40,812 INFO L479 AbstractCegarLoop]: Abstraction has 1742 states and 5952 transitions. [2020-09-11 12:06:40,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 12:06:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 5952 transitions. [2020-09-11 12:06:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-11 12:06:40,816 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:40,816 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-11 12:06:40,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-09-11 12:06:40,816 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-11 12:06:40,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:40,817 INFO L82 PathProgramCache]: Analyzing trace with hash -408101783, now seen corresponding path program 2 times [2020-09-11 12:06:40,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:40,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373768014] [2020-09-11 12:06:40,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:40,909 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373768014] [2020-09-11 12:06:40,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:40,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-11 12:06:40,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732591875] [2020-09-11 12:06:40,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 12:06:40,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:40,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 12:06:40,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-11 12:06:40,910 INFO L87 Difference]: Start difference. First operand 1742 states and 5952 transitions. Second operand 7 states. [2020-09-11 12:06:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:41,109 INFO L93 Difference]: Finished difference Result 2236 states and 7383 transitions. [2020-09-11 12:06:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 12:06:41,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-09-11 12:06:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:41,115 INFO L225 Difference]: With dead ends: 2236 [2020-09-11 12:06:41,115 INFO L226 Difference]: Without dead ends: 2172 [2020-09-11 12:06:41,115 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-11 12:06:41,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2020-09-11 12:06:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 1739. [2020-09-11 12:06:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2020-09-11 12:06:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 5947 transitions. [2020-09-11 12:06:41,141 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 5947 transitions. Word has length 24 [2020-09-11 12:06:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:41,142 INFO L479 AbstractCegarLoop]: Abstraction has 1739 states and 5947 transitions. [2020-09-11 12:06:41,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 12:06:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 5947 transitions. [2020-09-11 12:06:41,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-11 12:06:41,144 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:41,144 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-11 12:06:41,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-09-11 12:06:41,144 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-11 12:06:41,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:41,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1308579191, now seen corresponding path program 3 times [2020-09-11 12:06:41,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:41,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551541080] [2020-09-11 12:06:41,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:41,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551541080] [2020-09-11 12:06:41,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:41,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 12:06:41,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325316025] [2020-09-11 12:06:41,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-11 12:06:41,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:41,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-11 12:06:41,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-11 12:06:41,277 INFO L87 Difference]: Start difference. First operand 1739 states and 5947 transitions. Second operand 8 states. [2020-09-11 12:06:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:41,525 INFO L93 Difference]: Finished difference Result 2226 states and 7363 transitions. [2020-09-11 12:06:41,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 12:06:41,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-09-11 12:06:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:41,531 INFO L225 Difference]: With dead ends: 2226 [2020-09-11 12:06:41,532 INFO L226 Difference]: Without dead ends: 2162 [2020-09-11 12:06:41,533 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-11 12:06:41,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2020-09-11 12:06:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1733. [2020-09-11 12:06:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2020-09-11 12:06:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2020-09-11 12:06:41,580 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2020-09-11 12:06:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:41,580 INFO L479 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2020-09-11 12:06:41,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-11 12:06:41,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2020-09-11 12:06:41,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-11 12:06:41,584 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:41,584 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-11 12:06:41,584 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-09-11 12:06:41,585 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-11 12:06:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1370549309, now seen corresponding path program 4 times [2020-09-11 12:06:41,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:41,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595070831] [2020-09-11 12:06:41,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:41,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595070831] [2020-09-11 12:06:41,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:41,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-11 12:06:41,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472886702] [2020-09-11 12:06:41,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-11 12:06:41,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:41,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-11 12:06:41,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-11 12:06:41,743 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 10 states. [2020-09-11 12:06:41,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:41,973 INFO L93 Difference]: Finished difference Result 2175 states and 7230 transitions. [2020-09-11 12:06:41,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-11 12:06:41,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-09-11 12:06:41,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:41,978 INFO L225 Difference]: With dead ends: 2175 [2020-09-11 12:06:41,978 INFO L226 Difference]: Without dead ends: 2111 [2020-09-11 12:06:41,979 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-11 12:06:41,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2020-09-11 12:06:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1733. [2020-09-11 12:06:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2020-09-11 12:06:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2020-09-11 12:06:42,015 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2020-09-11 12:06:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:42,016 INFO L479 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2020-09-11 12:06:42,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-11 12:06:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2020-09-11 12:06:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-11 12:06:42,018 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:42,019 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-11 12:06:42,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-09-11 12:06:42,019 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-11 12:06:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:42,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1607134461, now seen corresponding path program 5 times [2020-09-11 12:06:42,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:42,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815452800] [2020-09-11 12:06:42,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:42,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815452800] [2020-09-11 12:06:42,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:42,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-11 12:06:42,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305714205] [2020-09-11 12:06:42,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 12:06:42,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:42,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 12:06:42,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-09-11 12:06:42,265 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 12 states. [2020-09-11 12:06:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:42,593 INFO L93 Difference]: Finished difference Result 2400 states and 7955 transitions. [2020-09-11 12:06:42,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 12:06:42,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-09-11 12:06:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:42,599 INFO L225 Difference]: With dead ends: 2400 [2020-09-11 12:06:42,599 INFO L226 Difference]: Without dead ends: 2272 [2020-09-11 12:06:42,600 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-09-11 12:06:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2020-09-11 12:06:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1669. [2020-09-11 12:06:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2020-09-11 12:06:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 5719 transitions. [2020-09-11 12:06:42,629 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 5719 transitions. Word has length 24 [2020-09-11 12:06:42,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:42,630 INFO L479 AbstractCegarLoop]: Abstraction has 1669 states and 5719 transitions. [2020-09-11 12:06:42,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 12:06:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 5719 transitions. [2020-09-11 12:06:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-11 12:06:42,632 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:42,633 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-11 12:06:42,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-09-11 12:06:42,633 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-11 12:06:42,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:42,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1497656527, now seen corresponding path program 6 times [2020-09-11 12:06:42,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:42,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749131517] [2020-09-11 12:06:42,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:42,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749131517] [2020-09-11 12:06:42,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:42,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-11 12:06:42,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557130113] [2020-09-11 12:06:42,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-11 12:06:42,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:42,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-11 12:06:42,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-11 12:06:42,796 INFO L87 Difference]: Start difference. First operand 1669 states and 5719 transitions. Second operand 10 states. [2020-09-11 12:06:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:43,177 INFO L93 Difference]: Finished difference Result 2576 states and 8317 transitions. [2020-09-11 12:06:43,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-11 12:06:43,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-09-11 12:06:43,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:43,184 INFO L225 Difference]: With dead ends: 2576 [2020-09-11 12:06:43,184 INFO L226 Difference]: Without dead ends: 2512 [2020-09-11 12:06:43,185 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-11 12:06:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2020-09-11 12:06:43,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 1489. [2020-09-11 12:06:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1489 states. [2020-09-11 12:06:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 5033 transitions. [2020-09-11 12:06:43,213 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 5033 transitions. Word has length 24 [2020-09-11 12:06:43,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:43,214 INFO L479 AbstractCegarLoop]: Abstraction has 1489 states and 5033 transitions. [2020-09-11 12:06:43,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-11 12:06:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 5033 transitions. [2020-09-11 12:06:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-11 12:06:43,216 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:43,216 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-11 12:06:43,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-09-11 12:06:43,217 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-11 12:06:43,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:43,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1461991345, now seen corresponding path program 1 times [2020-09-11 12:06:43,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:43,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707673851] [2020-09-11 12:06:43,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:43,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707673851] [2020-09-11 12:06:43,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:43,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-11 12:06:43,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192520796] [2020-09-11 12:06:43,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 12:06:43,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:43,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 12:06:43,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-11 12:06:43,362 INFO L87 Difference]: Start difference. First operand 1489 states and 5033 transitions. Second operand 9 states. [2020-09-11 12:06:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:43,581 INFO L93 Difference]: Finished difference Result 2106 states and 6852 transitions. [2020-09-11 12:06:43,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-11 12:06:43,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-09-11 12:06:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:43,586 INFO L225 Difference]: With dead ends: 2106 [2020-09-11 12:06:43,586 INFO L226 Difference]: Without dead ends: 2084 [2020-09-11 12:06:43,586 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-11 12:06:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2020-09-11 12:06:43,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1488. [2020-09-11 12:06:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2020-09-11 12:06:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 5032 transitions. [2020-09-11 12:06:43,610 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 5032 transitions. Word has length 26 [2020-09-11 12:06:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:43,611 INFO L479 AbstractCegarLoop]: Abstraction has 1488 states and 5032 transitions. [2020-09-11 12:06:43,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 12:06:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 5032 transitions. [2020-09-11 12:06:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-11 12:06:43,613 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:43,613 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-11 12:06:43,613 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-09-11 12:06:43,613 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-11 12:06:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1932498543, now seen corresponding path program 2 times [2020-09-11 12:06:43,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:43,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103174729] [2020-09-11 12:06:43,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:43,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103174729] [2020-09-11 12:06:43,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:43,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-11 12:06:43,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71285015] [2020-09-11 12:06:43,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-11 12:06:43,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:43,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-11 12:06:43,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-11 12:06:43,826 INFO L87 Difference]: Start difference. First operand 1488 states and 5032 transitions. Second operand 10 states. [2020-09-11 12:06:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:44,154 INFO L93 Difference]: Finished difference Result 2093 states and 6829 transitions. [2020-09-11 12:06:44,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-11 12:06:44,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-09-11 12:06:44,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:44,159 INFO L225 Difference]: With dead ends: 2093 [2020-09-11 12:06:44,159 INFO L226 Difference]: Without dead ends: 2071 [2020-09-11 12:06:44,159 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-11 12:06:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2020-09-11 12:06:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1485. [2020-09-11 12:06:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2020-09-11 12:06:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 5028 transitions. [2020-09-11 12:06:44,180 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 5028 transitions. Word has length 26 [2020-09-11 12:06:44,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:44,180 INFO L479 AbstractCegarLoop]: Abstraction has 1485 states and 5028 transitions. [2020-09-11 12:06:44,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-11 12:06:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 5028 transitions. [2020-09-11 12:06:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-11 12:06:44,182 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:44,182 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-11 12:06:44,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-09-11 12:06:44,182 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-11 12:06:44,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:44,182 INFO L82 PathProgramCache]: Analyzing trace with hash 443766965, now seen corresponding path program 3 times [2020-09-11 12:06:44,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:44,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987972297] [2020-09-11 12:06:44,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:44,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987972297] [2020-09-11 12:06:44,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:44,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-11 12:06:44,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712561956] [2020-09-11 12:06:44,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-11 12:06:44,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:44,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-11 12:06:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-09-11 12:06:44,400 INFO L87 Difference]: Start difference. First operand 1485 states and 5028 transitions. Second operand 12 states. [2020-09-11 12:06:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:44,858 INFO L93 Difference]: Finished difference Result 1538 states and 4992 transitions. [2020-09-11 12:06:44,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-11 12:06:44,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-09-11 12:06:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:44,863 INFO L225 Difference]: With dead ends: 1538 [2020-09-11 12:06:44,863 INFO L226 Difference]: Without dead ends: 1494 [2020-09-11 12:06:44,864 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-09-11 12:06:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2020-09-11 12:06:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 885. [2020-09-11 12:06:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-09-11 12:06:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-09-11 12:06:44,879 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-09-11 12:06:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:44,879 INFO L479 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-09-11 12:06:44,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-11 12:06:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-09-11 12:06:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-11 12:06:44,881 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:44,881 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-11 12:06:44,881 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-09-11 12:06:44,881 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-11 12:06:44,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:44,881 INFO L82 PathProgramCache]: Analyzing trace with hash -416507732, now seen corresponding path program 1 times [2020-09-11 12:06:44,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:44,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440162628] [2020-09-11 12:06:44,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:45,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:45,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440162628] [2020-09-11 12:06:45,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:45,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-11 12:06:45,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987072668] [2020-09-11 12:06:45,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-11 12:06:45,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:45,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-11 12:06:45,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-11 12:06:45,036 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-09-11 12:06:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:45,202 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2020-09-11 12:06:45,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-11 12:06:45,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-09-11 12:06:45,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:45,205 INFO L225 Difference]: With dead ends: 885 [2020-09-11 12:06:45,205 INFO L226 Difference]: Without dead ends: 879 [2020-09-11 12:06:45,205 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-11 12:06:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2020-09-11 12:06:45,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2020-09-11 12:06:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2020-09-11 12:06:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2020-09-11 12:06:45,217 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2020-09-11 12:06:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:45,217 INFO L479 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2020-09-11 12:06:45,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-11 12:06:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2020-09-11 12:06:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-11 12:06:45,219 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:45,219 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-11 12:06:45,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-09-11 12:06:45,219 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-11 12:06:45,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:45,220 INFO L82 PathProgramCache]: Analyzing trace with hash 829092404, now seen corresponding path program 1 times [2020-09-11 12:06:45,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:45,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745371033] [2020-09-11 12:06:45,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 12:06:45,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 12:06:45,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745371033] [2020-09-11 12:06:45,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 12:06:45,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-11 12:06:45,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288155284] [2020-09-11 12:06:45,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-11 12:06:45,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 12:06:45,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-11 12:06:45,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-11 12:06:45,362 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 8 states. [2020-09-11 12:06:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 12:06:45,529 INFO L93 Difference]: Finished difference Result 879 states and 3006 transitions. [2020-09-11 12:06:45,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-11 12:06:45,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-09-11 12:06:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 12:06:45,532 INFO L225 Difference]: With dead ends: 879 [2020-09-11 12:06:45,532 INFO L226 Difference]: Without dead ends: 819 [2020-09-11 12:06:45,532 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-11 12:06:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2020-09-11 12:06:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2020-09-11 12:06:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-09-11 12:06:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2020-09-11 12:06:45,544 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2020-09-11 12:06:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 12:06:45,544 INFO L479 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2020-09-11 12:06:45,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-11 12:06:45,545 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2020-09-11 12:06:45,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-11 12:06:45,546 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 12:06:45,546 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-11 12:06:45,546 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-09-11 12:06:45,547 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-11 12:06:45,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 12:06:45,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1378914744, now seen corresponding path program 1 times [2020-09-11 12:06:45,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 12:06:45,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093176004] [2020-09-11 12:06:45,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 12:06:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 12:06:45,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 12:06:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 12:06:45,603 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 12:06:45,651 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-11 12:06:45,651 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-11 12:06:45,651 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-09-11 12:06:45,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 12:06:45 BasicIcfg [2020-09-11 12:06:45,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-11 12:06:45,773 INFO L168 Benchmark]: Toolchain (without parser) took 32199.11 ms. Allocated memory was 142.1 MB in the beginning and 943.7 MB in the end (delta: 801.6 MB). Free memory was 99.4 MB in the beginning and 561.6 MB in the end (delta: -462.2 MB). Peak memory consumption was 339.5 MB. Max. memory is 7.1 GB. [2020-09-11 12:06:45,773 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 142.1 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-11 12:06:45,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1080.95 ms. Allocated memory was 142.1 MB in the beginning and 201.9 MB in the end (delta: 59.8 MB). Free memory was 98.8 MB in the beginning and 120.7 MB in the end (delta: -21.9 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2020-09-11 12:06:45,774 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.13 ms. Allocated memory is still 201.9 MB. Free memory was 120.7 MB in the beginning and 117.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-09-11 12:06:45,775 INFO L168 Benchmark]: Boogie Preprocessor took 35.18 ms. Allocated memory is still 201.9 MB. Free memory was 117.9 MB in the beginning and 116.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-11 12:06:45,775 INFO L168 Benchmark]: RCFGBuilder took 616.42 ms. Allocated memory is still 201.9 MB. Free memory was 116.5 MB in the beginning and 89.5 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2020-09-11 12:06:45,776 INFO L168 Benchmark]: TraceAbstraction took 30386.44 ms. Allocated memory was 201.9 MB in the beginning and 943.7 MB in the end (delta: 741.9 MB). Free memory was 89.5 MB in the beginning and 561.6 MB in the end (delta: -472.2 MB). Peak memory consumption was 269.7 MB. Max. memory is 7.1 GB. [2020-09-11 12:06:45,778 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.29 ms. Allocated memory is still 142.1 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1080.95 ms. Allocated memory was 142.1 MB in the beginning and 201.9 MB in the end (delta: 59.8 MB). Free memory was 98.8 MB in the beginning and 120.7 MB in the end (delta: -21.9 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.13 ms. Allocated memory is still 201.9 MB. Free memory was 120.7 MB in the beginning and 117.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.18 ms. Allocated memory is still 201.9 MB. Free memory was 117.9 MB in the beginning and 116.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 616.42 ms. Allocated memory is still 201.9 MB. Free memory was 116.5 MB in the beginning and 89.5 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30386.44 ms. Allocated memory was 201.9 MB in the beginning and 943.7 MB in the end (delta: 741.9 MB). Free memory was 89.5 MB in the beginning and 561.6 MB in the end (delta: -472.2 MB). Peak memory consumption was 269.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.5s, 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: 29.8s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 4482 SDtfs, 7573 SDslu, 12200 SDs, 0 SdLazy, 7382 SolverSat, 970 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 6.2s 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: 4.5s AutomataMinimizationTime, 42 MinimizatonAttempts, 39550 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.6s 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...