/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/concurrent/pthreads/forkFork.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 12:53:54,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 12:53:54,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 12:53:54,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 12:53:54,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 12:53:54,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 12:53:54,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 12:53:54,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 12:53:54,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 12:53:54,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 12:53:54,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 12:53:54,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 12:53:54,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 12:53:54,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 12:53:54,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 12:53:54,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 12:53:54,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 12:53:54,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 12:53:54,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 12:53:54,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 12:53:54,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 12:53:54,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 12:53:54,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 12:53:54,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 12:53:54,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 12:53:54,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 12:53:54,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 12:53:54,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 12:53:54,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 12:53:54,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 12:53:54,732 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 12:53:54,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 12:53:54,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 12:53:54,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 12:53:54,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 12:53:54,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 12:53:54,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 12:53:54,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 12:53:54,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 12:53:54,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 12:53:54,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 12:53:54,744 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 12:53:54,804 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 12:53:54,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 12:53:54,805 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 12:53:54,805 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 12:53:54,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 12:53:54,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 12:53:54,808 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 12:53:54,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 12:53:54,808 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 12:53:54,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 12:53:54,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 12:53:54,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 12:53:54,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 12:53:54,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 12:53:54,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 12:53:54,810 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 12:53:54,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 12:53:54,810 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 12:53:54,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 12:53:54,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 12:53:54,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 12:53:54,810 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 12:53:54,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 12:53:54,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 12:53:54,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 12:53:54,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 12:53:54,811 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 12:53:54,811 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 12:53:54,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 12:53:54,811 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 12:53:54,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 12:53:54,811 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 12:53:54,812 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 12:53:55,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 12:53:55,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 12:53:55,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 12:53:55,137 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 12:53:55,137 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 12:53:55,138 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/pthreads/forkFork.c [2021-06-05 12:53:55,194 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ce5a2428/7b51fcafea69400e96bab4cc9c1a1c2e/FLAG93622366c [2021-06-05 12:53:55,577 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 12:53:55,578 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/concurrent/pthreads/forkFork.c [2021-06-05 12:53:55,578 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2021-06-05 12:53:55,578 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2021-06-05 12:53:55,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ce5a2428/7b51fcafea69400e96bab4cc9c1a1c2e/FLAG93622366c [2021-06-05 12:53:55,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ce5a2428/7b51fcafea69400e96bab4cc9c1a1c2e [2021-06-05 12:53:55,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 12:53:55,640 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 12:53:55,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 12:53:55,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 12:53:55,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 12:53:55,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:53:55" (1/1) ... [2021-06-05 12:53:55,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52516880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:53:55, skipping insertion in model container [2021-06-05 12:53:55,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:53:55" (1/1) ... [2021-06-05 12:53:55,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 12:53:55,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 12:53:55,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:53:55,871 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 12:53:55,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:53:55,902 INFO L208 MainTranslator]: Completed translation [2021-06-05 12:53:55,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:53:55 WrapperNode [2021-06-05 12:53:55,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 12:53:55,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 12:53:55,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 12:53:55,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 12:53:55,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:53:55" (1/1) ... [2021-06-05 12:53:55,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:53:55" (1/1) ... [2021-06-05 12:53:55,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 12:53:55,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 12:53:55,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 12:53:55,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 12:53:55,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:53:55" (1/1) ... [2021-06-05 12:53:55,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:53:55" (1/1) ... [2021-06-05 12:53:55,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:53:55" (1/1) ... [2021-06-05 12:53:55,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:53:55" (1/1) ... [2021-06-05 12:53:55,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:53:55" (1/1) ... [2021-06-05 12:53:55,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:53:55" (1/1) ... [2021-06-05 12:53:55,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:53:55" (1/1) ... [2021-06-05 12:53:55,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 12:53:55,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 12:53:55,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 12:53:55,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 12:53:55,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:53:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 12:53:56,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-06-05 12:53:56,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 12:53:56,049 INFO L130 BoogieDeclarations]: Found specification of procedure bar [2021-06-05 12:53:56,049 INFO L138 BoogieDeclarations]: Found implementation of procedure bar [2021-06-05 12:53:56,050 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2021-06-05 12:53:56,050 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2021-06-05 12:53:56,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 12:53:56,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 12:53:56,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 12:53:56,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 12:53:56,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-06-05 12:53:56,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 12:53:56,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 12:53:56,052 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 12:53:56,482 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 12:53:56,482 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-06-05 12:53:56,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:53:56 BoogieIcfgContainer [2021-06-05 12:53:56,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 12:53:56,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 12:53:56,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 12:53:56,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 12:53:56,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 12:53:55" (1/3) ... [2021-06-05 12:53:56,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa3ef70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:53:56, skipping insertion in model container [2021-06-05 12:53:56,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:53:55" (2/3) ... [2021-06-05 12:53:56,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa3ef70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:53:56, skipping insertion in model container [2021-06-05 12:53:56,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:53:56" (3/3) ... [2021-06-05 12:53:56,491 INFO L111 eAbstractionObserver]: Analyzing ICFG forkFork.c [2021-06-05 12:53:56,496 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 12:53:56,496 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 12:53:56,496 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 12:53:56,497 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 12:53:56,522 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#in~b.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,523 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#in~b.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,523 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,523 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,523 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#in~b.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,524 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#in~b.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,524 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,524 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,524 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,524 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,524 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,524 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,525 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,525 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,525 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,525 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,525 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,525 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,525 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,526 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,526 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,526 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,526 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,527 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,527 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,527 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,527 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,527 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,528 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,528 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,528 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,528 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,528 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,528 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,529 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,529 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,529 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,529 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,529 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,529 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,529 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,530 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,530 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,530 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,530 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,530 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,531 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,531 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,531 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,531 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,531 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,531 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,531 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,532 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,532 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#in~a.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,532 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#in~a.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,532 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,533 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,533 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#in~a.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,533 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#in~a.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,533 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,533 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,533 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,534 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,534 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,534 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,534 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,534 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,535 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,535 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,535 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,535 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,535 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,535 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,535 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,536 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,536 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,536 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,536 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,536 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,537 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,537 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,537 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,537 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,537 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,537 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,538 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,538 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,538 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,538 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,538 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,538 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,538 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,539 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,539 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,539 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,539 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,540 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,540 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,540 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,540 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,540 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,540 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,540 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,541 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,541 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,541 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,541 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,541 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,541 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,542 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,542 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,542 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,542 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,542 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,542 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,542 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,542 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,543 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,543 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,543 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,543 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,543 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,543 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,543 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,544 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,544 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,544 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,544 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,544 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,544 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,545 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,545 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,545 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,545 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,545 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,545 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,546 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,546 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,546 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,546 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,546 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,548 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,548 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,548 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,549 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,549 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,549 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,549 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,549 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,549 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,554 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,554 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,554 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,554 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,554 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~a.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,555 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_~param~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,555 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~pre2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,555 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,555 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,555 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,555 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_~#second_thread~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,555 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,556 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,556 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,556 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,556 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~mem6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,556 WARN L313 ript$VariableManager]: TermVariabe |fooThread1of1ForFork1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,558 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,559 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,559 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,559 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,559 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,559 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~c~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,559 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,560 WARN L313 ript$VariableManager]: TermVariabe barThread1of1ForFork0_~b.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,560 WARN L313 ript$VariableManager]: TermVariabe |barThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:53:56,579 INFO L149 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2021-06-05 12:53:56,599 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-05 12:53:56,615 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:53:56,615 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:53:56,615 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:53:56,615 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:53:56,616 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:53:56,616 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:53:56,616 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:53:56,616 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:53:56,626 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 89 transitions, 206 flow [2021-06-05 12:53:56,661 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 477 states, 472 states have (on average 2.1440677966101696) internal successors, (1012), 476 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:53:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 477 states, 472 states have (on average 2.1440677966101696) internal successors, (1012), 476 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:53:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-06-05 12:53:56,672 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:53:56,673 INFO L521 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] [2021-06-05 12:53:56,673 INFO L430 AbstractCegarLoop]: === Iteration 1 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:53:56,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:53:56,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1964643420, now seen corresponding path program 1 times [2021-06-05 12:53:56,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:53:56,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171437817] [2021-06-05 12:53:56,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:53:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:53:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:53:57,139 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:53:57,139 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171437817] [2021-06-05 12:53:57,140 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171437817] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:53:57,140 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:53:57,140 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 12:53:57,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030371508] [2021-06-05 12:53:57,144 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:53:57,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:53:57,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:53:57,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:53:57,164 INFO L87 Difference]: Start difference. First operand has 477 states, 472 states have (on average 2.1440677966101696) internal successors, (1012), 476 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:53:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:53:57,956 INFO L93 Difference]: Finished difference Result 457 states and 961 transitions. [2021-06-05 12:53:57,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 12:53:57,958 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-06-05 12:53:57,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:53:57,969 INFO L225 Difference]: With dead ends: 457 [2021-06-05 12:53:57,969 INFO L226 Difference]: Without dead ends: 407 [2021-06-05 12:53:57,971 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 626.2ms TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2021-06-05 12:53:57,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-06-05 12:53:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2021-06-05 12:53:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 405 states have (on average 2.1753086419753087) internal successors, (881), 406 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:53:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 881 transitions. [2021-06-05 12:53:58,046 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 881 transitions. Word has length 26 [2021-06-05 12:53:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:53:58,046 INFO L482 AbstractCegarLoop]: Abstraction has 407 states and 881 transitions. [2021-06-05 12:53:58,047 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:53:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 881 transitions. [2021-06-05 12:53:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-05 12:53:58,050 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:53:58,051 INFO L521 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, 1, 1, 1, 1, 1] [2021-06-05 12:53:58,051 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 12:53:58,051 INFO L430 AbstractCegarLoop]: === Iteration 2 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:53:58,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:53:58,052 INFO L82 PathProgramCache]: Analyzing trace with hash 982709772, now seen corresponding path program 1 times [2021-06-05 12:53:58,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:53:58,052 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585898134] [2021-06-05 12:53:58,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:53:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:53:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:53:58,493 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:53:58,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585898134] [2021-06-05 12:53:58,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585898134] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:53:58,494 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:53:58,494 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 12:53:58,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756501553] [2021-06-05 12:53:58,495 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 12:53:58,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:53:58,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 12:53:58,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-06-05 12:53:58,498 INFO L87 Difference]: Start difference. First operand 407 states and 881 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:53:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:53:58,706 INFO L93 Difference]: Finished difference Result 473 states and 981 transitions. [2021-06-05 12:53:58,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 12:53:58,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-05 12:53:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:53:58,710 INFO L225 Difference]: With dead ends: 473 [2021-06-05 12:53:58,710 INFO L226 Difference]: Without dead ends: 473 [2021-06-05 12:53:58,711 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 250.3ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 12:53:58,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-05 12:53:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 458. [2021-06-05 12:53:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 456 states have (on average 2.1184210526315788) internal successors, (966), 457 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:53:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 966 transitions. [2021-06-05 12:53:58,759 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 966 transitions. Word has length 46 [2021-06-05 12:53:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:53:58,759 INFO L482 AbstractCegarLoop]: Abstraction has 458 states and 966 transitions. [2021-06-05 12:53:58,759 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:53:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 966 transitions. [2021-06-05 12:53:58,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-05 12:53:58,763 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:53:58,763 INFO L521 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, 1, 1, 1, 1, 1] [2021-06-05 12:53:58,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 12:53:58,763 INFO L430 AbstractCegarLoop]: === Iteration 3 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:53:58,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:53:58,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1370098458, now seen corresponding path program 2 times [2021-06-05 12:53:58,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:53:58,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178052084] [2021-06-05 12:53:58,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:53:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:53:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:53:59,083 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:53:59,083 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178052084] [2021-06-05 12:53:59,083 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178052084] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:53:59,083 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:53:59,083 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 12:53:59,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882999662] [2021-06-05 12:53:59,084 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 12:53:59,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:53:59,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 12:53:59,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-06-05 12:53:59,088 INFO L87 Difference]: Start difference. First operand 458 states and 966 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:53:59,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:53:59,301 INFO L93 Difference]: Finished difference Result 522 states and 1064 transitions. [2021-06-05 12:53:59,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 12:53:59,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-05 12:53:59,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:53:59,305 INFO L225 Difference]: With dead ends: 522 [2021-06-05 12:53:59,306 INFO L226 Difference]: Without dead ends: 522 [2021-06-05 12:53:59,306 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 197.3ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-06-05 12:53:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-06-05 12:53:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2021-06-05 12:53:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 454 states have (on average 2.1233480176211454) internal successors, (964), 455 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:53:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 964 transitions. [2021-06-05 12:53:59,329 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 964 transitions. Word has length 46 [2021-06-05 12:53:59,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:53:59,329 INFO L482 AbstractCegarLoop]: Abstraction has 456 states and 964 transitions. [2021-06-05 12:53:59,330 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:53:59,330 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 964 transitions. [2021-06-05 12:53:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-05 12:53:59,337 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:53:59,337 INFO L521 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, 1, 1, 1, 1, 1] [2021-06-05 12:53:59,338 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 12:53:59,338 INFO L430 AbstractCegarLoop]: === Iteration 4 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:53:59,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:53:59,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1272071898, now seen corresponding path program 3 times [2021-06-05 12:53:59,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:53:59,339 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380292448] [2021-06-05 12:53:59,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:53:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:53:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:53:59,808 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:53:59,808 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380292448] [2021-06-05 12:53:59,809 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380292448] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:53:59,809 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:53:59,809 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 12:53:59,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233936262] [2021-06-05 12:53:59,809 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:53:59,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:53:59,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:53:59,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:53:59,810 INFO L87 Difference]: Start difference. First operand 456 states and 964 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:00,406 INFO L93 Difference]: Finished difference Result 584 states and 1176 transitions. [2021-06-05 12:54:00,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 12:54:00,407 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-05 12:54:00,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:00,409 INFO L225 Difference]: With dead ends: 584 [2021-06-05 12:54:00,409 INFO L226 Difference]: Without dead ends: 584 [2021-06-05 12:54:00,410 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 542.5ms TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2021-06-05 12:54:00,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-06-05 12:54:00,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 455. [2021-06-05 12:54:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 453 states have (on average 2.1258278145695364) internal successors, (963), 454 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 963 transitions. [2021-06-05 12:54:00,422 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 963 transitions. Word has length 46 [2021-06-05 12:54:00,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:00,423 INFO L482 AbstractCegarLoop]: Abstraction has 455 states and 963 transitions. [2021-06-05 12:54:00,423 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:00,424 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 963 transitions. [2021-06-05 12:54:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-05 12:54:00,425 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:00,426 INFO L521 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, 1, 1, 1, 1, 1] [2021-06-05 12:54:00,426 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 12:54:00,428 INFO L430 AbstractCegarLoop]: === Iteration 5 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:00,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:00,429 INFO L82 PathProgramCache]: Analyzing trace with hash 240206360, now seen corresponding path program 4 times [2021-06-05 12:54:00,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:00,440 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893996964] [2021-06-05 12:54:00,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:00,807 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:00,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893996964] [2021-06-05 12:54:00,807 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893996964] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:00,808 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:00,808 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 12:54:00,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360369067] [2021-06-05 12:54:00,808 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:54:00,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:00,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:54:00,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:54:00,809 INFO L87 Difference]: Start difference. First operand 455 states and 963 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:01,308 INFO L93 Difference]: Finished difference Result 486 states and 1004 transitions. [2021-06-05 12:54:01,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 12:54:01,313 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-05 12:54:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:01,315 INFO L225 Difference]: With dead ends: 486 [2021-06-05 12:54:01,315 INFO L226 Difference]: Without dead ends: 486 [2021-06-05 12:54:01,316 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 410.5ms TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2021-06-05 12:54:01,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-06-05 12:54:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 423. [2021-06-05 12:54:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 421 states have (on average 2.1543942992874108) internal successors, (907), 422 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 907 transitions. [2021-06-05 12:54:01,325 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 907 transitions. Word has length 46 [2021-06-05 12:54:01,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:01,326 INFO L482 AbstractCegarLoop]: Abstraction has 423 states and 907 transitions. [2021-06-05 12:54:01,326 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:01,326 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 907 transitions. [2021-06-05 12:54:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-05 12:54:01,327 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:01,327 INFO L521 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, 1, 1, 1, 1, 1] [2021-06-05 12:54:01,327 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 12:54:01,327 INFO L430 AbstractCegarLoop]: === Iteration 6 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:01,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:01,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1884213040, now seen corresponding path program 5 times [2021-06-05 12:54:01,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:01,328 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075847643] [2021-06-05 12:54:01,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:01,701 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:01,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075847643] [2021-06-05 12:54:01,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075847643] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:01,701 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:01,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-06-05 12:54:01,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998255070] [2021-06-05 12:54:01,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:54:01,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:01,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:54:01,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:54:01,703 INFO L87 Difference]: Start difference. First operand 423 states and 907 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:02,813 INFO L93 Difference]: Finished difference Result 442 states and 923 transitions. [2021-06-05 12:54:02,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-05 12:54:02,814 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-05 12:54:02,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:02,816 INFO L225 Difference]: With dead ends: 442 [2021-06-05 12:54:02,816 INFO L226 Difference]: Without dead ends: 442 [2021-06-05 12:54:02,817 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 892.6ms TimeCoverageRelationStatistics Valid=331, Invalid=1391, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 12:54:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-06-05 12:54:02,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 363. [2021-06-05 12:54:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 2.2099447513812156) internal successors, (800), 362 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 800 transitions. [2021-06-05 12:54:02,824 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 800 transitions. Word has length 46 [2021-06-05 12:54:02,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:02,824 INFO L482 AbstractCegarLoop]: Abstraction has 363 states and 800 transitions. [2021-06-05 12:54:02,825 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 800 transitions. [2021-06-05 12:54:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:02,826 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:02,826 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:02,826 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 12:54:02,826 INFO L430 AbstractCegarLoop]: === Iteration 7 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:02,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:02,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1424997685, now seen corresponding path program 1 times [2021-06-05 12:54:02,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:02,827 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473572420] [2021-06-05 12:54:02,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:03,240 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:03,240 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473572420] [2021-06-05 12:54:03,240 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473572420] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:03,240 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:03,240 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 12:54:03,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157358749] [2021-06-05 12:54:03,241 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 12:54:03,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:03,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 12:54:03,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2021-06-05 12:54:03,242 INFO L87 Difference]: Start difference. First operand 363 states and 800 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:04,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:04,775 INFO L93 Difference]: Finished difference Result 507 states and 1077 transitions. [2021-06-05 12:54:04,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 12:54:04,775 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:04,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:04,777 INFO L225 Difference]: With dead ends: 507 [2021-06-05 12:54:04,777 INFO L226 Difference]: Without dead ends: 361 [2021-06-05 12:54:04,778 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1303.6ms TimeCoverageRelationStatistics Valid=549, Invalid=2873, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 12:54:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-06-05 12:54:04,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2021-06-05 12:54:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 2.2111111111111112) internal successors, (796), 360 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 796 transitions. [2021-06-05 12:54:04,786 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 796 transitions. Word has length 61 [2021-06-05 12:54:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:04,787 INFO L482 AbstractCegarLoop]: Abstraction has 361 states and 796 transitions. [2021-06-05 12:54:04,787 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 796 transitions. [2021-06-05 12:54:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:04,788 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:04,788 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:04,788 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 12:54:04,788 INFO L430 AbstractCegarLoop]: === Iteration 8 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:04,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:04,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1323525531, now seen corresponding path program 2 times [2021-06-05 12:54:04,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:04,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991777766] [2021-06-05 12:54:04,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:05,229 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:05,229 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991777766] [2021-06-05 12:54:05,229 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991777766] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:05,229 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:05,229 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 12:54:05,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313102705] [2021-06-05 12:54:05,230 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 12:54:05,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:05,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 12:54:05,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2021-06-05 12:54:05,231 INFO L87 Difference]: Start difference. First operand 361 states and 796 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:06,559 INFO L93 Difference]: Finished difference Result 501 states and 1067 transitions. [2021-06-05 12:54:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 12:54:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:06,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:06,575 INFO L225 Difference]: With dead ends: 501 [2021-06-05 12:54:06,575 INFO L226 Difference]: Without dead ends: 357 [2021-06-05 12:54:06,576 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1152.8ms TimeCoverageRelationStatistics Valid=549, Invalid=2873, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 12:54:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-06-05 12:54:06,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-06-05 12:54:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.2134831460674156) internal successors, (788), 356 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:06,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 788 transitions. [2021-06-05 12:54:06,583 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 788 transitions. Word has length 61 [2021-06-05 12:54:06,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:06,583 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 788 transitions. [2021-06-05 12:54:06,584 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:06,584 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 788 transitions. [2021-06-05 12:54:06,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:06,585 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:06,585 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:06,585 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 12:54:06,585 INFO L430 AbstractCegarLoop]: === Iteration 9 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:06,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:06,585 INFO L82 PathProgramCache]: Analyzing trace with hash -823634075, now seen corresponding path program 3 times [2021-06-05 12:54:06,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:06,586 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779355954] [2021-06-05 12:54:06,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:06,984 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:06,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779355954] [2021-06-05 12:54:06,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779355954] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:06,984 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:06,984 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 12:54:06,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313116912] [2021-06-05 12:54:06,985 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 12:54:06,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:06,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 12:54:06,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-06-05 12:54:06,986 INFO L87 Difference]: Start difference. First operand 357 states and 788 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:08,743 INFO L93 Difference]: Finished difference Result 611 states and 1298 transitions. [2021-06-05 12:54:08,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 12:54:08,744 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:08,746 INFO L225 Difference]: With dead ends: 611 [2021-06-05 12:54:08,746 INFO L226 Difference]: Without dead ends: 473 [2021-06-05 12:54:08,747 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1539.7ms TimeCoverageRelationStatistics Valid=548, Invalid=2874, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 12:54:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-05 12:54:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 357. [2021-06-05 12:54:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.202247191011236) internal successors, (784), 356 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 784 transitions. [2021-06-05 12:54:08,755 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 784 transitions. Word has length 61 [2021-06-05 12:54:08,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:08,755 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 784 transitions. [2021-06-05 12:54:08,755 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 784 transitions. [2021-06-05 12:54:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:08,756 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:08,756 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:08,756 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 12:54:08,756 INFO L430 AbstractCegarLoop]: === Iteration 10 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:08,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:08,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2085424731, now seen corresponding path program 4 times [2021-06-05 12:54:08,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:08,757 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332412938] [2021-06-05 12:54:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:09,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:09,147 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:09,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332412938] [2021-06-05 12:54:09,147 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332412938] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:09,147 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:09,147 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 12:54:09,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056226828] [2021-06-05 12:54:09,148 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 12:54:09,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:09,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 12:54:09,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2021-06-05 12:54:09,149 INFO L87 Difference]: Start difference. First operand 357 states and 784 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:10,604 INFO L93 Difference]: Finished difference Result 471 states and 1004 transitions. [2021-06-05 12:54:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 12:54:10,604 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:10,606 INFO L225 Difference]: With dead ends: 471 [2021-06-05 12:54:10,606 INFO L226 Difference]: Without dead ends: 373 [2021-06-05 12:54:10,607 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1191.5ms TimeCoverageRelationStatistics Valid=569, Invalid=3091, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 12:54:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-06-05 12:54:10,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 357. [2021-06-05 12:54:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.1797752808988764) internal successors, (776), 356 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 776 transitions. [2021-06-05 12:54:10,614 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 776 transitions. Word has length 61 [2021-06-05 12:54:10,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:10,614 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 776 transitions. [2021-06-05 12:54:10,614 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 776 transitions. [2021-06-05 12:54:10,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:10,615 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:10,626 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:10,626 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 12:54:10,626 INFO L430 AbstractCegarLoop]: === Iteration 11 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:10,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:10,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1071374389, now seen corresponding path program 5 times [2021-06-05 12:54:10,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:10,627 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470898887] [2021-06-05 12:54:10,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:10,964 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:10,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470898887] [2021-06-05 12:54:10,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470898887] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:10,965 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:10,965 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 12:54:10,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310837985] [2021-06-05 12:54:10,965 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 12:54:10,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:10,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 12:54:10,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2021-06-05 12:54:10,966 INFO L87 Difference]: Start difference. First operand 357 states and 776 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:12,337 INFO L93 Difference]: Finished difference Result 447 states and 942 transitions. [2021-06-05 12:54:12,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 12:54:12,337 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:12,339 INFO L225 Difference]: With dead ends: 447 [2021-06-05 12:54:12,339 INFO L226 Difference]: Without dead ends: 365 [2021-06-05 12:54:12,340 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1127.5ms TimeCoverageRelationStatistics Valid=521, Invalid=2901, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 12:54:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-06-05 12:54:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2021-06-05 12:54:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.168539325842697) internal successors, (772), 356 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 772 transitions. [2021-06-05 12:54:12,345 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 772 transitions. Word has length 61 [2021-06-05 12:54:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:12,345 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 772 transitions. [2021-06-05 12:54:12,346 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 772 transitions. [2021-06-05 12:54:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:12,349 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:12,349 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:12,349 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 12:54:12,350 INFO L430 AbstractCegarLoop]: === Iteration 12 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:12,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:12,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1809708235, now seen corresponding path program 6 times [2021-06-05 12:54:12,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:12,350 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890537340] [2021-06-05 12:54:12,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:12,744 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:12,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890537340] [2021-06-05 12:54:12,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890537340] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:12,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:12,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 12:54:12,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283575766] [2021-06-05 12:54:12,744 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 12:54:12,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:12,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 12:54:12,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-06-05 12:54:12,745 INFO L87 Difference]: Start difference. First operand 357 states and 772 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:14,187 INFO L93 Difference]: Finished difference Result 439 states and 920 transitions. [2021-06-05 12:54:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 12:54:14,187 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:14,189 INFO L225 Difference]: With dead ends: 439 [2021-06-05 12:54:14,189 INFO L226 Difference]: Without dead ends: 365 [2021-06-05 12:54:14,190 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1236.3ms TimeCoverageRelationStatistics Valid=566, Invalid=3094, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 12:54:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-06-05 12:54:14,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2021-06-05 12:54:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.157303370786517) internal successors, (768), 356 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 768 transitions. [2021-06-05 12:54:14,197 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 768 transitions. Word has length 61 [2021-06-05 12:54:14,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:14,197 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 768 transitions. [2021-06-05 12:54:14,197 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:14,197 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 768 transitions. [2021-06-05 12:54:14,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:14,198 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:14,198 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:14,198 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 12:54:14,198 INFO L430 AbstractCegarLoop]: === Iteration 13 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:14,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:14,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1648857061, now seen corresponding path program 7 times [2021-06-05 12:54:14,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:14,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707442165] [2021-06-05 12:54:14,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:14,585 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:14,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707442165] [2021-06-05 12:54:14,586 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707442165] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:14,586 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:14,586 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 12:54:14,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372366949] [2021-06-05 12:54:14,586 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 12:54:14,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:14,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 12:54:14,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-06-05 12:54:14,587 INFO L87 Difference]: Start difference. First operand 357 states and 768 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:15,874 INFO L93 Difference]: Finished difference Result 459 states and 942 transitions. [2021-06-05 12:54:15,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 12:54:15,875 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:15,876 INFO L225 Difference]: With dead ends: 459 [2021-06-05 12:54:15,876 INFO L226 Difference]: Without dead ends: 393 [2021-06-05 12:54:15,877 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1121.0ms TimeCoverageRelationStatistics Valid=581, Invalid=3079, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 12:54:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-06-05 12:54:15,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 357. [2021-06-05 12:54:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.134831460674157) internal successors, (760), 356 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 760 transitions. [2021-06-05 12:54:15,884 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 760 transitions. Word has length 61 [2021-06-05 12:54:15,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:15,884 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 760 transitions. [2021-06-05 12:54:15,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:15,884 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 760 transitions. [2021-06-05 12:54:15,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:15,885 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:15,885 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:15,885 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 12:54:15,886 INFO L430 AbstractCegarLoop]: === Iteration 14 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:15,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:15,886 INFO L82 PathProgramCache]: Analyzing trace with hash 146013925, now seen corresponding path program 8 times [2021-06-05 12:54:15,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:15,886 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619861026] [2021-06-05 12:54:15,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:16,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:16,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619861026] [2021-06-05 12:54:16,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619861026] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:16,254 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:16,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 12:54:16,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136287286] [2021-06-05 12:54:16,255 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 12:54:16,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:16,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 12:54:16,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-06-05 12:54:16,255 INFO L87 Difference]: Start difference. First operand 357 states and 760 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:17,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:17,523 INFO L93 Difference]: Finished difference Result 427 states and 866 transitions. [2021-06-05 12:54:17,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 12:54:17,523 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:17,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:17,524 INFO L225 Difference]: With dead ends: 427 [2021-06-05 12:54:17,524 INFO L226 Difference]: Without dead ends: 377 [2021-06-05 12:54:17,525 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1113.8ms TimeCoverageRelationStatistics Valid=556, Invalid=2984, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 12:54:17,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-06-05 12:54:17,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 357. [2021-06-05 12:54:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.1123595505617976) internal successors, (752), 356 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 752 transitions. [2021-06-05 12:54:17,532 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 752 transitions. Word has length 61 [2021-06-05 12:54:17,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:17,532 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 752 transitions. [2021-06-05 12:54:17,532 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 752 transitions. [2021-06-05 12:54:17,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:17,533 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:17,533 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:17,533 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 12:54:17,534 INFO L430 AbstractCegarLoop]: === Iteration 15 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:17,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:17,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1525657893, now seen corresponding path program 9 times [2021-06-05 12:54:17,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:17,534 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290583001] [2021-06-05 12:54:17,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:17,880 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:17,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290583001] [2021-06-05 12:54:17,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290583001] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:17,880 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:17,880 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 12:54:17,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398633104] [2021-06-05 12:54:17,880 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 12:54:17,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:17,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 12:54:17,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-06-05 12:54:17,881 INFO L87 Difference]: Start difference. First operand 357 states and 752 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:19,155 INFO L93 Difference]: Finished difference Result 395 states and 802 transitions. [2021-06-05 12:54:19,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 12:54:19,155 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:19,156 INFO L225 Difference]: With dead ends: 395 [2021-06-05 12:54:19,157 INFO L226 Difference]: Without dead ends: 361 [2021-06-05 12:54:19,157 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1066.1ms TimeCoverageRelationStatistics Valid=547, Invalid=2993, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 12:54:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-06-05 12:54:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 357. [2021-06-05 12:54:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.109550561797753) internal successors, (751), 356 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 751 transitions. [2021-06-05 12:54:19,164 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 751 transitions. Word has length 61 [2021-06-05 12:54:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:19,165 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 751 transitions. [2021-06-05 12:54:19,165 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:19,165 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 751 transitions. [2021-06-05 12:54:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:19,166 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:19,166 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:19,166 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 12:54:19,166 INFO L430 AbstractCegarLoop]: === Iteration 16 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:19,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:19,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1243524661, now seen corresponding path program 10 times [2021-06-05 12:54:19,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:19,167 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758306404] [2021-06-05 12:54:19,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:19,490 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:19,491 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758306404] [2021-06-05 12:54:19,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758306404] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:19,491 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:19,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 12:54:19,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012302926] [2021-06-05 12:54:19,491 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 12:54:19,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:19,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 12:54:19,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-06-05 12:54:19,492 INFO L87 Difference]: Start difference. First operand 357 states and 751 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:20,763 INFO L93 Difference]: Finished difference Result 401 states and 810 transitions. [2021-06-05 12:54:20,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 12:54:20,763 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:20,765 INFO L225 Difference]: With dead ends: 401 [2021-06-05 12:54:20,765 INFO L226 Difference]: Without dead ends: 369 [2021-06-05 12:54:20,766 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1078.3ms TimeCoverageRelationStatistics Valid=580, Invalid=3080, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 12:54:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-06-05 12:54:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 357. [2021-06-05 12:54:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.101123595505618) internal successors, (748), 356 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 748 transitions. [2021-06-05 12:54:20,773 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 748 transitions. Word has length 61 [2021-06-05 12:54:20,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:20,773 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 748 transitions. [2021-06-05 12:54:20,773 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 748 transitions. [2021-06-05 12:54:20,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:20,774 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:20,774 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:20,774 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 12:54:20,774 INFO L430 AbstractCegarLoop]: === Iteration 17 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:20,775 INFO L82 PathProgramCache]: Analyzing trace with hash -666611931, now seen corresponding path program 11 times [2021-06-05 12:54:20,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:20,775 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760675504] [2021-06-05 12:54:20,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:21,123 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:21,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760675504] [2021-06-05 12:54:21,123 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760675504] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:21,123 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:21,123 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 12:54:21,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732576156] [2021-06-05 12:54:21,124 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 12:54:21,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:21,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 12:54:21,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-06-05 12:54:21,125 INFO L87 Difference]: Start difference. First operand 357 states and 748 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:22,351 INFO L93 Difference]: Finished difference Result 385 states and 783 transitions. [2021-06-05 12:54:22,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 12:54:22,352 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:22,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:22,353 INFO L225 Difference]: With dead ends: 385 [2021-06-05 12:54:22,353 INFO L226 Difference]: Without dead ends: 359 [2021-06-05 12:54:22,354 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1044.9ms TimeCoverageRelationStatistics Valid=543, Invalid=2879, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 12:54:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-06-05 12:54:22,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2021-06-05 12:54:22,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.098314606741573) internal successors, (747), 356 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 747 transitions. [2021-06-05 12:54:22,361 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 747 transitions. Word has length 61 [2021-06-05 12:54:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:22,361 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 747 transitions. [2021-06-05 12:54:22,361 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 747 transitions. [2021-06-05 12:54:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:22,362 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:22,362 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:22,362 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 12:54:22,363 INFO L430 AbstractCegarLoop]: === Iteration 18 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:22,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:22,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1258030027, now seen corresponding path program 12 times [2021-06-05 12:54:22,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:22,363 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856134138] [2021-06-05 12:54:22,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:22,730 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:22,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856134138] [2021-06-05 12:54:22,730 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856134138] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:22,730 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:22,730 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-06-05 12:54:22,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187145967] [2021-06-05 12:54:22,731 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 12:54:22,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:22,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 12:54:22,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2021-06-05 12:54:22,732 INFO L87 Difference]: Start difference. First operand 357 states and 747 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:23,987 INFO L93 Difference]: Finished difference Result 381 states and 776 transitions. [2021-06-05 12:54:23,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 12:54:23,987 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:23,988 INFO L225 Difference]: With dead ends: 381 [2021-06-05 12:54:23,988 INFO L226 Difference]: Without dead ends: 357 [2021-06-05 12:54:23,989 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1102.1ms TimeCoverageRelationStatistics Valid=572, Invalid=2968, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 12:54:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-06-05 12:54:23,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-06-05 12:54:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.092696629213483) internal successors, (745), 356 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 745 transitions. [2021-06-05 12:54:23,996 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 745 transitions. Word has length 61 [2021-06-05 12:54:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:23,996 INFO L482 AbstractCegarLoop]: Abstraction has 357 states and 745 transitions. [2021-06-05 12:54:23,997 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 745 transitions. [2021-06-05 12:54:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:23,997 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:23,998 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:23,998 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 12:54:23,998 INFO L430 AbstractCegarLoop]: === Iteration 19 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:23,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:23,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1564219701, now seen corresponding path program 13 times [2021-06-05 12:54:23,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:23,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449158526] [2021-06-05 12:54:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:24,382 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:24,382 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449158526] [2021-06-05 12:54:24,382 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449158526] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:24,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:24,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-06-05 12:54:24,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11033504] [2021-06-05 12:54:24,383 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 12:54:24,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:24,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 12:54:24,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2021-06-05 12:54:24,384 INFO L87 Difference]: Start difference. First operand 357 states and 745 transitions. Second operand has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:26,403 INFO L93 Difference]: Finished difference Result 377 states and 768 transitions. [2021-06-05 12:54:26,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 12:54:26,404 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:26,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:26,404 INFO L225 Difference]: With dead ends: 377 [2021-06-05 12:54:26,404 INFO L226 Difference]: Without dead ends: 225 [2021-06-05 12:54:26,405 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1819.5ms TimeCoverageRelationStatistics Valid=633, Invalid=3789, Unknown=0, NotChecked=0, Total=4422 [2021-06-05 12:54:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-06-05 12:54:26,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2021-06-05 12:54:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.9866071428571428) internal successors, (445), 224 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 445 transitions. [2021-06-05 12:54:26,409 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 445 transitions. Word has length 61 [2021-06-05 12:54:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:26,409 INFO L482 AbstractCegarLoop]: Abstraction has 225 states and 445 transitions. [2021-06-05 12:54:26,410 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 445 transitions. [2021-06-05 12:54:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:26,410 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:26,411 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:26,411 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 12:54:26,411 INFO L430 AbstractCegarLoop]: === Iteration 20 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:26,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:26,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1000025979, now seen corresponding path program 14 times [2021-06-05 12:54:26,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:26,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001965616] [2021-06-05 12:54:26,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:26,789 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:26,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001965616] [2021-06-05 12:54:26,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001965616] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:26,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:26,789 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 12:54:26,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100989540] [2021-06-05 12:54:26,790 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 12:54:26,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:26,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 12:54:26,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2021-06-05 12:54:26,790 INFO L87 Difference]: Start difference. First operand 225 states and 445 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:28,439 INFO L93 Difference]: Finished difference Result 331 states and 647 transitions. [2021-06-05 12:54:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 12:54:28,439 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:28,440 INFO L225 Difference]: With dead ends: 331 [2021-06-05 12:54:28,440 INFO L226 Difference]: Without dead ends: 213 [2021-06-05 12:54:28,440 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 1515.5ms TimeCoverageRelationStatistics Valid=516, Invalid=2906, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 12:54:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-06-05 12:54:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-06-05 12:54:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.9433962264150944) internal successors, (412), 212 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 412 transitions. [2021-06-05 12:54:28,444 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 412 transitions. Word has length 61 [2021-06-05 12:54:28,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:28,444 INFO L482 AbstractCegarLoop]: Abstraction has 213 states and 412 transitions. [2021-06-05 12:54:28,444 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 412 transitions. [2021-06-05 12:54:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:28,445 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:28,445 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:28,445 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 12:54:28,445 INFO L430 AbstractCegarLoop]: === Iteration 21 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:28,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:28,446 INFO L82 PathProgramCache]: Analyzing trace with hash -445291639, now seen corresponding path program 15 times [2021-06-05 12:54:28,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:28,446 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833784949] [2021-06-05 12:54:28,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:28,804 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:28,804 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833784949] [2021-06-05 12:54:28,804 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833784949] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:28,804 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:28,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 12:54:28,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598112244] [2021-06-05 12:54:28,804 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 12:54:28,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:28,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 12:54:28,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-06-05 12:54:28,805 INFO L87 Difference]: Start difference. First operand 213 states and 412 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:30,405 INFO L93 Difference]: Finished difference Result 327 states and 632 transitions. [2021-06-05 12:54:30,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 12:54:30,405 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:30,406 INFO L225 Difference]: With dead ends: 327 [2021-06-05 12:54:30,406 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 12:54:30,406 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1497.0ms TimeCoverageRelationStatistics Valid=545, Invalid=2877, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 12:54:30,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 12:54:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-06-05 12:54:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.895) internal successors, (379), 200 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 379 transitions. [2021-06-05 12:54:30,410 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 379 transitions. Word has length 61 [2021-06-05 12:54:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:30,410 INFO L482 AbstractCegarLoop]: Abstraction has 201 states and 379 transitions. [2021-06-05 12:54:30,410 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 379 transitions. [2021-06-05 12:54:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:30,411 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:30,411 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:30,411 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 12:54:30,411 INFO L430 AbstractCegarLoop]: === Iteration 22 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:30,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2088814595, now seen corresponding path program 16 times [2021-06-05 12:54:30,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:30,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545958640] [2021-06-05 12:54:30,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:30,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:30,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545958640] [2021-06-05 12:54:30,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545958640] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:30,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:30,768 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 12:54:30,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807792989] [2021-06-05 12:54:30,768 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 12:54:30,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:30,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 12:54:30,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-06-05 12:54:30,769 INFO L87 Difference]: Start difference. First operand 201 states and 379 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:32,243 INFO L93 Difference]: Finished difference Result 323 states and 617 transitions. [2021-06-05 12:54:32,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 12:54:32,243 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:32,244 INFO L225 Difference]: With dead ends: 323 [2021-06-05 12:54:32,244 INFO L226 Difference]: Without dead ends: 189 [2021-06-05 12:54:32,244 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1405.7ms TimeCoverageRelationStatistics Valid=546, Invalid=2876, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 12:54:32,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-06-05 12:54:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-06-05 12:54:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.8404255319148937) internal successors, (346), 188 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 346 transitions. [2021-06-05 12:54:32,248 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 346 transitions. Word has length 61 [2021-06-05 12:54:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:32,248 INFO L482 AbstractCegarLoop]: Abstraction has 189 states and 346 transitions. [2021-06-05 12:54:32,248 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 346 transitions. [2021-06-05 12:54:32,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:32,249 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:32,249 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:32,249 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-05 12:54:32,249 INFO L430 AbstractCegarLoop]: === Iteration 23 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:32,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:32,250 INFO L82 PathProgramCache]: Analyzing trace with hash 463712683, now seen corresponding path program 17 times [2021-06-05 12:54:32,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:32,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10832589] [2021-06-05 12:54:32,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:32,594 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:32,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10832589] [2021-06-05 12:54:32,594 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10832589] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:32,595 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:32,595 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 12:54:32,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583165230] [2021-06-05 12:54:32,595 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 12:54:32,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:32,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 12:54:32,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-06-05 12:54:32,596 INFO L87 Difference]: Start difference. First operand 189 states and 346 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:34,093 INFO L93 Difference]: Finished difference Result 319 states and 602 transitions. [2021-06-05 12:54:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 12:54:34,093 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:34,094 INFO L225 Difference]: With dead ends: 319 [2021-06-05 12:54:34,094 INFO L226 Difference]: Without dead ends: 165 [2021-06-05 12:54:34,095 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1412.6ms TimeCoverageRelationStatistics Valid=547, Invalid=2875, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 12:54:34,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-06-05 12:54:34,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-06-05 12:54:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.8414634146341464) internal successors, (302), 164 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 302 transitions. [2021-06-05 12:54:34,097 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 302 transitions. Word has length 61 [2021-06-05 12:54:34,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:34,098 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 302 transitions. [2021-06-05 12:54:34,098 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 302 transitions. [2021-06-05 12:54:34,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:54:34,098 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:54:34,099 INFO L521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:54:34,099 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 12:54:34,099 INFO L430 AbstractCegarLoop]: === Iteration 24 === [fooThread1of1ForFork1Err1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, fooErr0INUSE_VIOLATION, barErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 12:54:34,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:54:34,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1536955807, now seen corresponding path program 18 times [2021-06-05 12:54:34,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:54:34,100 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288702554] [2021-06-05 12:54:34,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:54:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:54:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:54:34,429 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:54:34,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288702554] [2021-06-05 12:54:34,429 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288702554] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:54:34,429 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:54:34,429 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-05 12:54:34,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555757207] [2021-06-05 12:54:34,429 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 12:54:34,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:54:34,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 12:54:34,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=646, Unknown=0, NotChecked=0, Total=702 [2021-06-05 12:54:34,430 INFO L87 Difference]: Start difference. First operand 165 states and 302 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:54:35,948 INFO L93 Difference]: Finished difference Result 164 states and 301 transitions. [2021-06-05 12:54:35,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 12:54:35,948 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-06-05 12:54:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:54:35,948 INFO L225 Difference]: With dead ends: 164 [2021-06-05 12:54:35,948 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 12:54:35,949 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1423.4ms TimeCoverageRelationStatistics Valid=548, Invalid=2874, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 12:54:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 12:54:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 12:54:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 12:54:35,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2021-06-05 12:54:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:54:35,949 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 12:54:35,949 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 27 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:54:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 12:54:35,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 12:54:35,949 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 12:54:35,951 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 12:54:35,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 12:54:35 BasicIcfg [2021-06-05 12:54:35,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 12:54:35,953 INFO L168 Benchmark]: Toolchain (without parser) took 40313.24 ms. Allocated memory was 367.0 MB in the beginning and 635.4 MB in the end (delta: 268.4 MB). Free memory was 329.6 MB in the beginning and 587.0 MB in the end (delta: -257.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:54:35,953 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 367.0 MB. Free memory was 348.3 MB in the beginning and 348.2 MB in the end (delta: 65.5 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 12:54:35,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.13 ms. Allocated memory is still 367.0 MB. Free memory was 329.4 MB in the beginning and 350.1 MB in the end (delta: -20.7 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. [2021-06-05 12:54:35,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.80 ms. Allocated memory is still 367.0 MB. Free memory was 350.1 MB in the beginning and 348.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:54:35,954 INFO L168 Benchmark]: Boogie Preprocessor took 30.24 ms. Allocated memory is still 367.0 MB. Free memory was 348.0 MB in the beginning and 347.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:54:35,954 INFO L168 Benchmark]: RCFGBuilder took 517.81 ms. Allocated memory is still 367.0 MB. Free memory was 347.0 MB in the beginning and 322.9 MB in the end (delta: 24.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:54:35,954 INFO L168 Benchmark]: TraceAbstraction took 39467.68 ms. Allocated memory was 367.0 MB in the beginning and 635.4 MB in the end (delta: 268.4 MB). Free memory was 322.9 MB in the beginning and 587.0 MB in the end (delta: -264.1 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.0 GB. [2021-06-05 12:54:35,954 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 367.0 MB. Free memory was 348.3 MB in the beginning and 348.2 MB in the end (delta: 65.5 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 261.13 ms. Allocated memory is still 367.0 MB. Free memory was 329.4 MB in the beginning and 350.1 MB in the end (delta: -20.7 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 29.80 ms. Allocated memory is still 367.0 MB. Free memory was 350.1 MB in the beginning and 348.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.24 ms. Allocated memory is still 367.0 MB. Free memory was 348.0 MB in the beginning and 347.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 517.81 ms. Allocated memory is still 367.0 MB. Free memory was 347.0 MB in the beginning and 322.9 MB in the end (delta: 24.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 39467.68 ms. Allocated memory was 367.0 MB in the beginning and 635.4 MB in the end (delta: 268.4 MB). Free memory was 322.9 MB in the beginning and 587.0 MB in the end (delta: -264.1 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 115 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 39337.0ms, OverallIterations: 24, TraceHistogramMax: 1, EmptinessCheckTime: 42.3ms, AutomataDifference: 29767.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 45.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1970 SDtfs, 7569 SDslu, 25168 SDs, 0 SdLazy, 21579 SolverSat, 1019 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7839.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1242 GetRequests, 50 SyntacticMatches, 10 SemanticMatches, 1182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9559 ImplicationChecksByTransitivity, 26071.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=0, InterpolantAutomatonStates: 777, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 261.4ms AutomataMinimizationTime, 24 MinimizatonAttempts, 574 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 58.3ms SsaConstructionTime, 356.8ms SatisfiabilityAnalysisTime, 8532.1ms InterpolantComputationTime, 1354 NumberOfCodeBlocks, 1354 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1330 ConstructedInterpolants, 0 QuantifiedInterpolants, 16146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...