/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-04 21:27:49,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-04 21:27:49,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-04 21:27:49,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-04 21:27:49,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-04 21:27:49,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-04 21:27:49,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-04 21:27:49,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-04 21:27:49,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-04 21:27:49,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-04 21:27:49,643 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-04 21:27:49,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-04 21:27:49,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-04 21:27:49,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-04 21:27:49,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-04 21:27:49,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-04 21:27:49,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-04 21:27:49,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-04 21:27:49,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-04 21:27:49,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-04 21:27:49,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-04 21:27:49,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-04 21:27:49,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-04 21:27:49,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-04 21:27:49,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-04 21:27:49,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-04 21:27:49,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-04 21:27:49,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-04 21:27:49,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-04 21:27:49,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-04 21:27:49,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-04 21:27:49,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-04 21:27:49,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-04 21:27:49,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-04 21:27:49,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-04 21:27:49,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-04 21:27:49,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-04 21:27:49,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-04 21:27:49,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-04 21:27:49,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-04 21:27:49,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-04 21:27:49,678 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.epf [2021-06-04 21:27:49,707 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-04 21:27:49,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-04 21:27:49,707 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-04 21:27:49,708 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-04 21:27:49,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-04 21:27:49,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-04 21:27:49,710 INFO L138 SettingsManager]: * Use SBE=true [2021-06-04 21:27:49,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-04 21:27:49,710 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-04 21:27:49,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-04 21:27:49,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-04 21:27:49,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-04 21:27:49,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-04 21:27:49,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-04 21:27:49,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-04 21:27:49,712 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-04 21:27:49,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-04 21:27:49,712 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-04 21:27:49,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-04 21:27:49,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-04 21:27:49,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-04 21:27:49,713 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-04 21:27:49,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-04 21:27:49,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-04 21:27:49,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-04 21:27:49,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-04 21:27:49,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-04 21:27:49,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-04 21:27:49,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-04 21:27:49,714 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-04 21:27:49,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-04 21:27:49,714 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-04 21:27:50,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-04 21:27:50,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-04 21:27:50,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-04 21:27:50,052 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-04 21:27:50,052 INFO L275 PluginConnector]: CDTParser initialized [2021-06-04 21:27:50,053 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2021-06-04 21:27:50,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1918285/661440b3daa64e4f823ab66aa7a6632a/FLAG657698483 [2021-06-04 21:27:50,657 INFO L306 CDTParser]: Found 1 translation units. [2021-06-04 21:27:50,658 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2021-06-04 21:27:50,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1918285/661440b3daa64e4f823ab66aa7a6632a/FLAG657698483 [2021-06-04 21:27:51,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1918285/661440b3daa64e4f823ab66aa7a6632a [2021-06-04 21:27:51,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-04 21:27:51,142 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-04 21:27:51,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-04 21:27:51,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-04 21:27:51,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-04 21:27:51,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 09:27:51" (1/1) ... [2021-06-04 21:27:51,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d6538c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:51, skipping insertion in model container [2021-06-04 21:27:51,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 09:27:51" (1/1) ... [2021-06-04 21:27:51,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-04 21:27:51,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-04 21:27:51,406 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-04 21:27:51,583 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2021-06-04 21:27:51,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 21:27:51,604 INFO L203 MainTranslator]: Completed pre-run [2021-06-04 21:27:51,616 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-04 21:27:51,639 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2021-06-04 21:27:51,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 21:27:51,799 INFO L208 MainTranslator]: Completed translation [2021-06-04 21:27:51,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:51 WrapperNode [2021-06-04 21:27:51,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-04 21:27:51,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-04 21:27:51,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-04 21:27:51,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-04 21:27:51,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:51" (1/1) ... [2021-06-04 21:27:51,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:51" (1/1) ... [2021-06-04 21:27:51,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-04 21:27:51,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-04 21:27:51,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-04 21:27:51,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-04 21:27:51,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:51" (1/1) ... [2021-06-04 21:27:51,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:51" (1/1) ... [2021-06-04 21:27:51,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:51" (1/1) ... [2021-06-04 21:27:51,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:51" (1/1) ... [2021-06-04 21:27:51,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:51" (1/1) ... [2021-06-04 21:27:51,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:51" (1/1) ... [2021-06-04 21:27:51,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:51" (1/1) ... [2021-06-04 21:27:51,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-04 21:27:51,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-04 21:27:51,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-04 21:27:51,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-04 21:27:51,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:51" (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-04 21:27:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-04 21:27:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-04 21:27:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-04 21:27:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-04 21:27:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-04 21:27:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-06-04 21:27:51,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-06-04 21:27:51,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-04 21:27:51,944 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-04 21:27:51,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-04 21:27:51,944 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-04 21:27:51,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-04 21:27:51,944 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-04 21:27:51,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-04 21:27:51,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-06-04 21:27:51,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-04 21:27:51,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-04 21:27:51,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-04 21:27:51,946 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-04 21:27:52,315 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-04 21:27:52,315 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-06-04 21:27:52,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 09:27:52 BoogieIcfgContainer [2021-06-04 21:27:52,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-04 21:27:52,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-04 21:27:52,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-04 21:27:52,324 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-04 21:27:52,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 09:27:51" (1/3) ... [2021-06-04 21:27:52,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b3a5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 09:27:52, skipping insertion in model container [2021-06-04 21:27:52,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:51" (2/3) ... [2021-06-04 21:27:52,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b3a5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 09:27:52, skipping insertion in model container [2021-06-04 21:27:52,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 09:27:52" (3/3) ... [2021-06-04 21:27:52,326 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2021-06-04 21:27:52,331 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-04 21:27:52,331 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-04 21:27:52,332 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-04 21:27:52,332 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-04 21:27:52,389 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,389 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,389 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,390 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,390 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,390 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,390 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,390 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,391 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,391 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,391 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,391 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,391 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,391 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,392 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,392 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,392 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,392 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,392 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,392 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,393 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,393 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,393 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,393 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,393 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,394 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,394 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,394 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,394 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,394 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,394 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,395 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,395 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,395 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,395 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,395 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,395 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,396 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,396 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,396 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,396 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,396 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,396 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,397 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,397 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,397 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,398 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,398 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,398 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,398 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,398 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,398 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,399 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,399 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,399 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,399 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,399 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,399 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,400 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,400 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,400 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,400 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,403 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,403 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,403 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,404 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,404 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,404 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,405 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,406 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,406 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,407 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,408 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,408 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,408 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,409 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,409 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,409 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,409 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,409 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,410 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,410 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,410 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,410 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,411 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,411 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,411 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,411 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,411 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,412 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,414 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,417 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,417 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,417 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,417 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,423 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,423 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,423 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,423 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,424 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,424 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,424 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,428 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,429 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,429 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,429 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,429 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,429 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,429 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,429 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,430 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,430 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,430 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,430 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,430 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,430 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,430 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,430 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,431 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,432 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,433 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,433 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,433 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,433 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,433 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,433 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,433 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,434 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,435 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,435 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,435 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,435 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,435 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,435 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,435 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,436 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,437 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,437 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,437 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,437 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,437 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,437 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,438 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,438 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,438 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,438 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,438 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,438 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,438 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,439 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,439 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,439 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,439 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,439 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,439 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,439 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,439 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,440 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,440 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,440 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,440 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,440 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,447 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,448 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,448 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,448 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,448 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,449 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,449 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,449 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,449 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,449 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,449 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,449 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,449 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,450 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,450 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,450 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,450 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,450 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,450 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,451 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,451 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,451 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,451 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,451 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,451 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,451 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,451 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,452 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,452 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,452 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,452 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,452 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,452 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,453 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,453 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,453 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,453 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,453 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,453 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,453 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,453 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,454 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,454 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,456 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,456 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,456 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,460 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,461 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,461 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,461 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,462 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,463 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,463 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,463 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,464 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,464 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,465 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,465 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,465 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,465 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,466 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,467 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,467 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,467 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,467 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,467 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,467 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,467 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,467 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,468 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,468 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,468 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,468 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,468 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,468 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,468 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,468 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,469 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,469 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,469 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~pre7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,469 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,469 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,469 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,469 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,469 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,470 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,470 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,470 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,470 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,472 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,472 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,472 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,472 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,474 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,474 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,474 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,474 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,474 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,474 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,476 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,477 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,477 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,477 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,480 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,481 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,481 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,481 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,488 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,489 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,489 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,489 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,491 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,491 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,492 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,492 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:52,714 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-06-04 21:27:52,734 INFO L255 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-06-04 21:27:52,760 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-04 21:27:52,761 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-04 21:27:52,761 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-04 21:27:52,761 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-04 21:27:52,761 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-04 21:27:52,761 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-04 21:27:52,761 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-04 21:27:52,761 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-04 21:27:52,781 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 197 places, 278 transitions, 936 flow [2021-06-04 21:27:59,038 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 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-04 21:27:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 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-04 21:27:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-04 21:27:59,138 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:59,139 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] [2021-06-04 21:27:59,140 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:27:59,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:59,144 INFO L82 PathProgramCache]: Analyzing trace with hash -811265628, now seen corresponding path program 1 times [2021-06-04 21:27:59,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:59,150 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313766729] [2021-06-04 21:27:59,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:59,902 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-04 21:27:59,903 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:59,903 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313766729] [2021-06-04 21:27:59,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313766729] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:59,904 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:59,904 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-04 21:27:59,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79935387] [2021-06-04 21:27:59,908 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-04 21:27:59,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:59,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-04 21:27:59,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-04 21:28:00,046 INFO L87 Difference]: Start difference. First operand has 70531 states, 70525 states have (on average 4.318397731300957) internal successors, (304555), 70530 states have internal predecessors, (304555), 0 states have call successors, (0), 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 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 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-04 21:28:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:02,019 INFO L93 Difference]: Finished difference Result 76010 states and 329094 transitions. [2021-06-04 21:28:02,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-04 21:28:02,020 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-06-04 21:28:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:02,563 INFO L225 Difference]: With dead ends: 76010 [2021-06-04 21:28:02,563 INFO L226 Difference]: Without dead ends: 54772 [2021-06-04 21:28:02,565 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 368.7ms TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2021-06-04 21:28:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54772 states. [2021-06-04 21:28:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54772 to 46283. [2021-06-04 21:28:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46283 states, 46280 states have (on average 4.362337942955921) internal successors, (201889), 46282 states have internal predecessors, (201889), 0 states have call successors, (0), 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-04 21:28:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46283 states to 46283 states and 201889 transitions. [2021-06-04 21:28:05,188 INFO L78 Accepts]: Start accepts. Automaton has 46283 states and 201889 transitions. Word has length 41 [2021-06-04 21:28:05,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:05,189 INFO L482 AbstractCegarLoop]: Abstraction has 46283 states and 201889 transitions. [2021-06-04 21:28:05,189 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 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-04 21:28:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 46283 states and 201889 transitions. [2021-06-04 21:28:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-04 21:28:05,197 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:05,197 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] [2021-06-04 21:28:05,197 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-04 21:28:05,198 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:05,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:05,201 INFO L82 PathProgramCache]: Analyzing trace with hash -589683484, now seen corresponding path program 2 times [2021-06-04 21:28:05,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:05,201 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194712821] [2021-06-04 21:28:05,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:05,738 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 18 [2021-06-04 21:28:05,834 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-04 21:28:05,834 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:05,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194712821] [2021-06-04 21:28:05,835 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194712821] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:05,835 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:05,835 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-04 21:28:05,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176564042] [2021-06-04 21:28:05,836 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-04 21:28:05,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:05,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-04 21:28:05,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-04 21:28:05,837 INFO L87 Difference]: Start difference. First operand 46283 states and 201889 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 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-04 21:28:07,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:07,087 INFO L93 Difference]: Finished difference Result 54799 states and 241924 transitions. [2021-06-04 21:28:07,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-04 21:28:07,088 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-06-04 21:28:07,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:07,522 INFO L225 Difference]: With dead ends: 54799 [2021-06-04 21:28:07,522 INFO L226 Difference]: Without dead ends: 54799 [2021-06-04 21:28:07,523 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 666.5ms TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2021-06-04 21:28:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54799 states. [2021-06-04 21:28:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54799 to 46286. [2021-06-04 21:28:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46286 states, 46283 states have (on average 4.362120000864248) internal successors, (201892), 46285 states have internal predecessors, (201892), 0 states have call successors, (0), 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-04 21:28:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46286 states to 46286 states and 201892 transitions. [2021-06-04 21:28:09,513 INFO L78 Accepts]: Start accepts. Automaton has 46286 states and 201892 transitions. Word has length 41 [2021-06-04 21:28:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:09,514 INFO L482 AbstractCegarLoop]: Abstraction has 46286 states and 201892 transitions. [2021-06-04 21:28:09,514 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 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-04 21:28:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 46286 states and 201892 transitions. [2021-06-04 21:28:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-04 21:28:09,515 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:09,515 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] [2021-06-04 21:28:09,516 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-04 21:28:09,516 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:09,516 INFO L82 PathProgramCache]: Analyzing trace with hash 325896192, now seen corresponding path program 3 times [2021-06-04 21:28:09,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:09,517 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069702952] [2021-06-04 21:28:09,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:09,772 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-04 21:28:09,772 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:09,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069702952] [2021-06-04 21:28:09,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069702952] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:09,773 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:09,773 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-04 21:28:09,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609175583] [2021-06-04 21:28:09,774 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-04 21:28:09,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:09,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-04 21:28:09,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-06-04 21:28:09,775 INFO L87 Difference]: Start difference. First operand 46286 states and 201892 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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-04 21:28:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:10,788 INFO L93 Difference]: Finished difference Result 54743 states and 241824 transitions. [2021-06-04 21:28:10,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-04 21:28:10,788 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-06-04 21:28:10,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:10,949 INFO L225 Difference]: With dead ends: 54743 [2021-06-04 21:28:10,949 INFO L226 Difference]: Without dead ends: 54743 [2021-06-04 21:28:10,950 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 206.9ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-04 21:28:11,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54743 states. [2021-06-04 21:28:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54743 to 46227. [2021-06-04 21:28:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46227 states, 46225 states have (on average 4.365365062195782) internal successors, (201789), 46226 states have internal predecessors, (201789), 0 states have call successors, (0), 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-04 21:28:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46227 states to 46227 states and 201789 transitions. [2021-06-04 21:28:12,691 INFO L78 Accepts]: Start accepts. Automaton has 46227 states and 201789 transitions. Word has length 41 [2021-06-04 21:28:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:12,691 INFO L482 AbstractCegarLoop]: Abstraction has 46227 states and 201789 transitions. [2021-06-04 21:28:12,691 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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-04 21:28:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 46227 states and 201789 transitions. [2021-06-04 21:28:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-06-04 21:28:12,694 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:12,694 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] [2021-06-04 21:28:12,694 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-04 21:28:12,694 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:12,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2119961237, now seen corresponding path program 1 times [2021-06-04 21:28:12,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:12,695 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756174902] [2021-06-04 21:28:12,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:12,784 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-04 21:28:12,784 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:12,784 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756174902] [2021-06-04 21:28:12,784 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756174902] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:12,784 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:12,784 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-04 21:28:12,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130114981] [2021-06-04 21:28:12,785 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-04 21:28:12,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:12,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-04 21:28:12,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-04 21:28:12,786 INFO L87 Difference]: Start difference. First operand 46227 states and 201789 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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-04 21:28:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:13,810 INFO L93 Difference]: Finished difference Result 96773 states and 411557 transitions. [2021-06-04 21:28:13,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 21:28:13,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-06-04 21:28:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:14,013 INFO L225 Difference]: With dead ends: 96773 [2021-06-04 21:28:14,013 INFO L226 Difference]: Without dead ends: 61407 [2021-06-04 21:28:14,013 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 47.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-04 21:28:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61407 states. [2021-06-04 21:28:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61407 to 49089. [2021-06-04 21:28:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49089 states, 49087 states have (on average 4.207203536577913) internal successors, (206519), 49088 states have internal predecessors, (206519), 0 states have call successors, (0), 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-04 21:28:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49089 states to 49089 states and 206519 transitions. [2021-06-04 21:28:15,950 INFO L78 Accepts]: Start accepts. Automaton has 49089 states and 206519 transitions. Word has length 54 [2021-06-04 21:28:15,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:15,950 INFO L482 AbstractCegarLoop]: Abstraction has 49089 states and 206519 transitions. [2021-06-04 21:28:15,950 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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-04 21:28:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 49089 states and 206519 transitions. [2021-06-04 21:28:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-04 21:28:15,958 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:15,958 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] [2021-06-04 21:28:15,958 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-04 21:28:15,958 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:15,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:15,958 INFO L82 PathProgramCache]: Analyzing trace with hash 319566966, now seen corresponding path program 1 times [2021-06-04 21:28:15,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:15,958 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717731547] [2021-06-04 21:28:15,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:16,057 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-04 21:28:16,057 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:16,057 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717731547] [2021-06-04 21:28:16,057 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717731547] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:16,057 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:16,057 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 21:28:16,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108784118] [2021-06-04 21:28:16,058 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 21:28:16,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:16,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 21:28:16,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-04 21:28:16,059 INFO L87 Difference]: Start difference. First operand 49089 states and 206519 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 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-04 21:28:17,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:17,145 INFO L93 Difference]: Finished difference Result 67425 states and 276590 transitions. [2021-06-04 21:28:17,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 21:28:17,146 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-06-04 21:28:17,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:17,388 INFO L225 Difference]: With dead ends: 67425 [2021-06-04 21:28:17,389 INFO L226 Difference]: Without dead ends: 61341 [2021-06-04 21:28:17,389 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 151.7ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-06-04 21:28:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61341 states. [2021-06-04 21:28:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61341 to 48869. [2021-06-04 21:28:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48869 states, 48867 states have (on average 4.211697055272475) internal successors, (205813), 48868 states have internal predecessors, (205813), 0 states have call successors, (0), 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-04 21:28:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48869 states to 48869 states and 205813 transitions. [2021-06-04 21:28:18,901 INFO L78 Accepts]: Start accepts. Automaton has 48869 states and 205813 transitions. Word has length 59 [2021-06-04 21:28:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:18,901 INFO L482 AbstractCegarLoop]: Abstraction has 48869 states and 205813 transitions. [2021-06-04 21:28:18,901 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 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-04 21:28:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 48869 states and 205813 transitions. [2021-06-04 21:28:18,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-04 21:28:18,910 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:18,910 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] [2021-06-04 21:28:18,911 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-04 21:28:18,911 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:18,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:18,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1864004856, now seen corresponding path program 1 times [2021-06-04 21:28:18,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:18,912 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751070005] [2021-06-04 21:28:18,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:19,513 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-04 21:28:19,513 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:19,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751070005] [2021-06-04 21:28:19,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751070005] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:19,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:19,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-04 21:28:19,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385119085] [2021-06-04 21:28:19,514 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-04 21:28:19,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:19,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-04 21:28:19,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-04 21:28:19,515 INFO L87 Difference]: Start difference. First operand 48869 states and 205813 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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-04 21:28:21,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:21,431 INFO L93 Difference]: Finished difference Result 57826 states and 244284 transitions. [2021-06-04 21:28:21,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-04 21:28:21,431 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2021-06-04 21:28:21,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:21,596 INFO L225 Difference]: With dead ends: 57826 [2021-06-04 21:28:21,596 INFO L226 Difference]: Without dead ends: 57556 [2021-06-04 21:28:21,597 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 935.8ms TimeCoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2021-06-04 21:28:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57556 states. [2021-06-04 21:28:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57556 to 54249. [2021-06-04 21:28:22,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54249 states, 54247 states have (on average 4.2520139362545395) internal successors, (230659), 54248 states have internal predecessors, (230659), 0 states have call successors, (0), 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-04 21:28:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54249 states to 54249 states and 230659 transitions. [2021-06-04 21:28:23,498 INFO L78 Accepts]: Start accepts. Automaton has 54249 states and 230659 transitions. Word has length 60 [2021-06-04 21:28:23,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:23,499 INFO L482 AbstractCegarLoop]: Abstraction has 54249 states and 230659 transitions. [2021-06-04 21:28:23,499 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 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-04 21:28:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 54249 states and 230659 transitions. [2021-06-04 21:28:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-04 21:28:23,510 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:23,510 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] [2021-06-04 21:28:23,510 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-04 21:28:23,510 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:23,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:23,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1211952212, now seen corresponding path program 2 times [2021-06-04 21:28:23,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:23,511 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304924847] [2021-06-04 21:28:23,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:23,956 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-04 21:28:23,956 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:23,956 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304924847] [2021-06-04 21:28:23,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304924847] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:23,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:23,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-06-04 21:28:23,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637604979] [2021-06-04 21:28:23,957 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-04 21:28:23,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:23,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-04 21:28:23,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-04 21:28:23,958 INFO L87 Difference]: Start difference. First operand 54249 states and 230659 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 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-04 21:28:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:25,763 INFO L93 Difference]: Finished difference Result 63300 states and 269393 transitions. [2021-06-04 21:28:25,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-04 21:28:25,763 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2021-06-04 21:28:25,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:25,979 INFO L225 Difference]: With dead ends: 63300 [2021-06-04 21:28:25,979 INFO L226 Difference]: Without dead ends: 63030 [2021-06-04 21:28:25,980 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 691.4ms TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2021-06-04 21:28:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63030 states. [2021-06-04 21:28:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63030 to 54264. [2021-06-04 21:28:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54264 states, 54262 states have (on average 4.2514466846043275) internal successors, (230692), 54263 states have internal predecessors, (230692), 0 states have call successors, (0), 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-04 21:28:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54264 states to 54264 states and 230692 transitions. [2021-06-04 21:28:27,450 INFO L78 Accepts]: Start accepts. Automaton has 54264 states and 230692 transitions. Word has length 60 [2021-06-04 21:28:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:27,450 INFO L482 AbstractCegarLoop]: Abstraction has 54264 states and 230692 transitions. [2021-06-04 21:28:27,450 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 0 states have call successors, (0), 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-04 21:28:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 54264 states and 230692 transitions. [2021-06-04 21:28:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-04 21:28:27,460 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:27,461 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] [2021-06-04 21:28:27,461 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-04 21:28:27,461 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:27,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:27,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1520073798, now seen corresponding path program 3 times [2021-06-04 21:28:27,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:27,462 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648857764] [2021-06-04 21:28:27,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:27,824 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-04 21:28:27,824 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:27,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648857764] [2021-06-04 21:28:27,824 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648857764] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:27,824 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:27,824 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-04 21:28:27,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532705301] [2021-06-04 21:28:27,825 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-04 21:28:27,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:27,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-04 21:28:27,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-04 21:28:27,826 INFO L87 Difference]: Start difference. First operand 54264 states and 230692 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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-04 21:28:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:29,387 INFO L93 Difference]: Finished difference Result 63260 states and 269245 transitions. [2021-06-04 21:28:29,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-04 21:28:29,388 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2021-06-04 21:28:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:29,574 INFO L225 Difference]: With dead ends: 63260 [2021-06-04 21:28:29,575 INFO L226 Difference]: Without dead ends: 62990 [2021-06-04 21:28:29,575 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 499.7ms TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2021-06-04 21:28:29,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62990 states. [2021-06-04 21:28:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62990 to 54281. [2021-06-04 21:28:31,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54281 states, 54279 states have (on average 4.250759962416404) internal successors, (230727), 54280 states have internal predecessors, (230727), 0 states have call successors, (0), 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-04 21:28:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54281 states to 54281 states and 230727 transitions. [2021-06-04 21:28:31,303 INFO L78 Accepts]: Start accepts. Automaton has 54281 states and 230727 transitions. Word has length 60 [2021-06-04 21:28:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:31,303 INFO L482 AbstractCegarLoop]: Abstraction has 54281 states and 230727 transitions. [2021-06-04 21:28:31,303 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 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-04 21:28:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 54281 states and 230727 transitions. [2021-06-04 21:28:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-04 21:28:31,311 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:31,311 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] [2021-06-04 21:28:31,311 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-04 21:28:31,311 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:31,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:31,312 INFO L82 PathProgramCache]: Analyzing trace with hash -181639794, now seen corresponding path program 4 times [2021-06-04 21:28:31,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:31,312 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425684899] [2021-06-04 21:28:31,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:32,120 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-04 21:28:32,120 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:32,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425684899] [2021-06-04 21:28:32,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425684899] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:32,120 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:32,120 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-04 21:28:32,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502448621] [2021-06-04 21:28:32,121 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-04 21:28:32,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:32,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-04 21:28:32,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-06-04 21:28:32,121 INFO L87 Difference]: Start difference. First operand 54281 states and 230727 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 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-04 21:28:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:33,134 INFO L93 Difference]: Finished difference Result 63305 states and 269323 transitions. [2021-06-04 21:28:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-04 21:28:33,134 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2021-06-04 21:28:33,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:33,327 INFO L225 Difference]: With dead ends: 63305 [2021-06-04 21:28:33,327 INFO L226 Difference]: Without dead ends: 63035 [2021-06-04 21:28:33,327 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 949.8ms TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2021-06-04 21:28:33,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63035 states. [2021-06-04 21:28:34,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63035 to 54310. [2021-06-04 21:28:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54310 states, 54308 states have (on average 4.249318700743905) internal successors, (230772), 54309 states have internal predecessors, (230772), 0 states have call successors, (0), 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-04 21:28:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54310 states to 54310 states and 230772 transitions. [2021-06-04 21:28:35,479 INFO L78 Accepts]: Start accepts. Automaton has 54310 states and 230772 transitions. Word has length 60 [2021-06-04 21:28:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:35,479 INFO L482 AbstractCegarLoop]: Abstraction has 54310 states and 230772 transitions. [2021-06-04 21:28:35,479 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 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-04 21:28:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 54310 states and 230772 transitions. [2021-06-04 21:28:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-04 21:28:35,490 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:35,490 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] [2021-06-04 21:28:35,490 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-04 21:28:35,490 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:35,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:35,490 INFO L82 PathProgramCache]: Analyzing trace with hash -994232682, now seen corresponding path program 5 times [2021-06-04 21:28:35,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:35,491 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168970207] [2021-06-04 21:28:35,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:35,792 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-04 21:28:35,793 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:35,793 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168970207] [2021-06-04 21:28:35,793 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168970207] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:35,793 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:35,793 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 21:28:35,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741938559] [2021-06-04 21:28:35,793 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 21:28:35,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:35,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 21:28:35,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-06-04 21:28:35,794 INFO L87 Difference]: Start difference. First operand 54310 states and 230772 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 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-04 21:28:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:36,443 INFO L93 Difference]: Finished difference Result 63086 states and 268677 transitions. [2021-06-04 21:28:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-04 21:28:36,444 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2021-06-04 21:28:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:36,623 INFO L225 Difference]: With dead ends: 63086 [2021-06-04 21:28:36,623 INFO L226 Difference]: Without dead ends: 62816 [2021-06-04 21:28:36,624 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 257.2ms TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-04 21:28:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62816 states. [2021-06-04 21:28:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62816 to 54062. [2021-06-04 21:28:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54062 states, 54060 states have (on average 4.256030336662967) internal successors, (230081), 54061 states have internal predecessors, (230081), 0 states have call successors, (0), 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-04 21:28:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54062 states to 54062 states and 230081 transitions. [2021-06-04 21:28:38,877 INFO L78 Accepts]: Start accepts. Automaton has 54062 states and 230081 transitions. Word has length 60 [2021-06-04 21:28:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:38,877 INFO L482 AbstractCegarLoop]: Abstraction has 54062 states and 230081 transitions. [2021-06-04 21:28:38,878 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 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-04 21:28:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 54062 states and 230081 transitions. [2021-06-04 21:28:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-04 21:28:38,893 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:38,893 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, 1] [2021-06-04 21:28:38,893 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-04 21:28:38,893 INFO L430 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:38,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:38,894 INFO L82 PathProgramCache]: Analyzing trace with hash -114684342, now seen corresponding path program 1 times [2021-06-04 21:28:38,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:38,894 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359024109] [2021-06-04 21:28:38,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:39,448 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-04 21:28:39,448 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:39,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359024109] [2021-06-04 21:28:39,448 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359024109] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:39,448 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:39,448 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-04 21:28:39,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679231799] [2021-06-04 21:28:39,448 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-04 21:28:39,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:39,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-04 21:28:39,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-04 21:28:39,449 INFO L87 Difference]: Start difference. First operand 54062 states and 230081 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 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-04 21:28:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:41,439 INFO L93 Difference]: Finished difference Result 65701 states and 278957 transitions. [2021-06-04 21:28:41,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-04 21:28:41,440 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-06-04 21:28:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:41,669 INFO L225 Difference]: With dead ends: 65701 [2021-06-04 21:28:41,669 INFO L226 Difference]: Without dead ends: 65359 [2021-06-04 21:28:41,669 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 911.7ms TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2021-06-04 21:28:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65359 states. [2021-06-04 21:28:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65359 to 60588. [2021-06-04 21:28:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60588 states, 60586 states have (on average 4.283184233981448) internal successors, (259501), 60587 states have internal predecessors, (259501), 0 states have call successors, (0), 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-04 21:28:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60588 states to 60588 states and 259501 transitions. [2021-06-04 21:28:43,228 INFO L78 Accepts]: Start accepts. Automaton has 60588 states and 259501 transitions. Word has length 62 [2021-06-04 21:28:43,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:43,229 INFO L482 AbstractCegarLoop]: Abstraction has 60588 states and 259501 transitions. [2021-06-04 21:28:43,229 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 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-04 21:28:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 60588 states and 259501 transitions. [2021-06-04 21:28:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-04 21:28:43,242 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:43,242 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, 1] [2021-06-04 21:28:43,242 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-04 21:28:43,243 INFO L430 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:43,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:43,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1301917267, now seen corresponding path program 1 times [2021-06-04 21:28:43,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:43,243 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079066170] [2021-06-04 21:28:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:43,852 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-04 21:28:43,852 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:43,852 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079066170] [2021-06-04 21:28:43,852 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079066170] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:43,853 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:43,853 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-04 21:28:43,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492892124] [2021-06-04 21:28:43,853 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-04 21:28:43,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:43,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-04 21:28:43,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-06-04 21:28:43,854 INFO L87 Difference]: Start difference. First operand 60588 states and 259501 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 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-04 21:28:44,995 WARN L205 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2021-06-04 21:28:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:45,788 INFO L93 Difference]: Finished difference Result 71101 states and 302938 transitions. [2021-06-04 21:28:45,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-04 21:28:45,788 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-06-04 21:28:45,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:45,999 INFO L225 Difference]: With dead ends: 71101 [2021-06-04 21:28:45,999 INFO L226 Difference]: Without dead ends: 70759 [2021-06-04 21:28:45,999 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1335.9ms TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2021-06-04 21:28:46,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70759 states. [2021-06-04 21:28:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70759 to 60588. [2021-06-04 21:28:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60588 states, 60586 states have (on average 4.283184233981448) internal successors, (259501), 60587 states have internal predecessors, (259501), 0 states have call successors, (0), 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-04 21:28:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60588 states to 60588 states and 259501 transitions. [2021-06-04 21:28:48,171 INFO L78 Accepts]: Start accepts. Automaton has 60588 states and 259501 transitions. Word has length 62 [2021-06-04 21:28:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:48,171 INFO L482 AbstractCegarLoop]: Abstraction has 60588 states and 259501 transitions. [2021-06-04 21:28:48,171 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 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-04 21:28:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 60588 states and 259501 transitions. [2021-06-04 21:28:48,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-04 21:28:48,189 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:48,189 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, 1] [2021-06-04 21:28:48,189 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-04 21:28:48,189 INFO L430 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:48,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:48,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1765911259, now seen corresponding path program 2 times [2021-06-04 21:28:48,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:48,190 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307995326] [2021-06-04 21:28:48,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:48,697 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-04 21:28:48,698 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:48,698 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307995326] [2021-06-04 21:28:48,698 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307995326] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:48,698 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:48,698 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-04 21:28:48,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297508337] [2021-06-04 21:28:48,698 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-04 21:28:48,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:48,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-04 21:28:48,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-04 21:28:48,699 INFO L87 Difference]: Start difference. First operand 60588 states and 259501 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 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-04 21:28:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:50,086 INFO L93 Difference]: Finished difference Result 73658 states and 314685 transitions. [2021-06-04 21:28:50,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-04 21:28:50,086 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-06-04 21:28:50,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:50,767 INFO L225 Difference]: With dead ends: 73658 [2021-06-04 21:28:50,767 INFO L226 Difference]: Without dead ends: 73316 [2021-06-04 21:28:50,767 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 735.3ms TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2021-06-04 21:28:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73316 states. [2021-06-04 21:28:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73316 to 57618. [2021-06-04 21:28:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57618 states, 57616 states have (on average 4.267998472646487) internal successors, (245905), 57617 states have internal predecessors, (245905), 0 states have call successors, (0), 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-04 21:28:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57618 states to 57618 states and 245905 transitions. [2021-06-04 21:28:52,402 INFO L78 Accepts]: Start accepts. Automaton has 57618 states and 245905 transitions. Word has length 62 [2021-06-04 21:28:52,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:52,403 INFO L482 AbstractCegarLoop]: Abstraction has 57618 states and 245905 transitions. [2021-06-04 21:28:52,403 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 0 states have call successors, (0), 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-04 21:28:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 57618 states and 245905 transitions. [2021-06-04 21:28:52,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-04 21:28:52,416 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:52,417 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, 1] [2021-06-04 21:28:52,417 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-04 21:28:52,417 INFO L430 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:52,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1261621970, now seen corresponding path program 2 times [2021-06-04 21:28:52,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:52,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263513559] [2021-06-04 21:28:52,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:52,709 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-04 21:28:52,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:52,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263513559] [2021-06-04 21:28:52,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263513559] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:52,710 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:52,710 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-04 21:28:52,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788167320] [2021-06-04 21:28:52,710 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-04 21:28:52,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:52,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-04 21:28:52,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-06-04 21:28:52,711 INFO L87 Difference]: Start difference. First operand 57618 states and 245905 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 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-04 21:28:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:54,185 INFO L93 Difference]: Finished difference Result 65381 states and 277424 transitions. [2021-06-04 21:28:54,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-04 21:28:54,186 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-06-04 21:28:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:54,421 INFO L225 Difference]: With dead ends: 65381 [2021-06-04 21:28:54,421 INFO L226 Difference]: Without dead ends: 65039 [2021-06-04 21:28:54,422 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 517.8ms TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2021-06-04 21:28:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65039 states. [2021-06-04 21:28:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65039 to 57621. [2021-06-04 21:28:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57621 states, 57619 states have (on average 4.267828320519273) internal successors, (245908), 57620 states have internal predecessors, (245908), 0 states have call successors, (0), 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-04 21:28:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57621 states to 57621 states and 245908 transitions. [2021-06-04 21:28:56,026 INFO L78 Accepts]: Start accepts. Automaton has 57621 states and 245908 transitions. Word has length 62 [2021-06-04 21:28:56,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:56,026 INFO L482 AbstractCegarLoop]: Abstraction has 57621 states and 245908 transitions. [2021-06-04 21:28:56,026 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 0 states have call successors, (0), 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-04 21:28:56,027 INFO L276 IsEmpty]: Start isEmpty. Operand 57621 states and 245908 transitions. [2021-06-04 21:28:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-04 21:28:56,040 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:56,040 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, 1] [2021-06-04 21:28:56,041 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-04 21:28:56,041 INFO L430 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1971465376, now seen corresponding path program 3 times [2021-06-04 21:28:56,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:56,041 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429912296] [2021-06-04 21:28:56,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:56,294 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-04 21:28:56,294 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:56,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429912296] [2021-06-04 21:28:56,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429912296] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:56,294 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:56,294 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-04 21:28:56,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864493957] [2021-06-04 21:28:56,295 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-04 21:28:56,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:56,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-04 21:28:56,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-04 21:28:56,295 INFO L87 Difference]: Start difference. First operand 57621 states and 245908 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 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-04 21:28:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:57,761 INFO L93 Difference]: Finished difference Result 65409 states and 277466 transitions. [2021-06-04 21:28:57,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-04 21:28:57,762 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-06-04 21:28:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:58,003 INFO L225 Difference]: With dead ends: 65409 [2021-06-04 21:28:58,003 INFO L226 Difference]: Without dead ends: 65067 [2021-06-04 21:28:58,003 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 362.0ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-06-04 21:28:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65067 states. [2021-06-04 21:28:59,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65067 to 57649. [2021-06-04 21:28:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57649 states, 57647 states have (on average 4.266518639304734) internal successors, (245952), 57648 states have internal predecessors, (245952), 0 states have call successors, (0), 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-04 21:28:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57649 states to 57649 states and 245952 transitions. [2021-06-04 21:28:59,630 INFO L78 Accepts]: Start accepts. Automaton has 57649 states and 245952 transitions. Word has length 62 [2021-06-04 21:28:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:59,631 INFO L482 AbstractCegarLoop]: Abstraction has 57649 states and 245952 transitions. [2021-06-04 21:28:59,631 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 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-04 21:28:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 57649 states and 245952 transitions. [2021-06-04 21:28:59,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-04 21:28:59,644 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:59,644 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, 1] [2021-06-04 21:28:59,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-04 21:28:59,644 INFO L430 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:28:59,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:59,644 INFO L82 PathProgramCache]: Analyzing trace with hash 116713492, now seen corresponding path program 4 times [2021-06-04 21:28:59,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:59,644 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793192009] [2021-06-04 21:28:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:59,844 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-04 21:28:59,844 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:59,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793192009] [2021-06-04 21:28:59,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793192009] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:28:59,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:28:59,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-04 21:28:59,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710471645] [2021-06-04 21:28:59,844 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-04 21:28:59,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:59,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-04 21:28:59,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-06-04 21:28:59,845 INFO L87 Difference]: Start difference. First operand 57649 states and 245952 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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-04 21:29:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:00,370 INFO L93 Difference]: Finished difference Result 60948 states and 256662 transitions. [2021-06-04 21:29:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 21:29:00,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2021-06-04 21:29:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:01,079 INFO L225 Difference]: With dead ends: 60948 [2021-06-04 21:29:01,080 INFO L226 Difference]: Without dead ends: 60606 [2021-06-04 21:29:01,080 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 206.9ms TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-04 21:29:01,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60606 states. [2021-06-04 21:29:02,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60606 to 53160. [2021-06-04 21:29:02,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53160 states, 53158 states have (on average 4.234621317581549) internal successors, (225104), 53159 states have internal predecessors, (225104), 0 states have call successors, (0), 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-04 21:29:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53160 states to 53160 states and 225104 transitions. [2021-06-04 21:29:02,695 INFO L78 Accepts]: Start accepts. Automaton has 53160 states and 225104 transitions. Word has length 62 [2021-06-04 21:29:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:02,695 INFO L482 AbstractCegarLoop]: Abstraction has 53160 states and 225104 transitions. [2021-06-04 21:29:02,695 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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-04 21:29:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 53160 states and 225104 transitions. [2021-06-04 21:29:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-04 21:29:02,713 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:02,713 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, 1, 1, 1, 1] [2021-06-04 21:29:02,714 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-04 21:29:02,714 INFO L430 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:02,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:02,714 INFO L82 PathProgramCache]: Analyzing trace with hash -27681967, now seen corresponding path program 1 times [2021-06-04 21:29:02,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:02,714 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007733280] [2021-06-04 21:29:02,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:03,225 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-04 21:29:03,225 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:03,225 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007733280] [2021-06-04 21:29:03,225 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007733280] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:03,225 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:03,225 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-04 21:29:03,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130890851] [2021-06-04 21:29:03,226 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-04 21:29:03,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:03,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-04 21:29:03,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-06-04 21:29:03,226 INFO L87 Difference]: Start difference. First operand 53160 states and 225104 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 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-04 21:29:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:05,282 INFO L93 Difference]: Finished difference Result 64389 states and 274500 transitions. [2021-06-04 21:29:05,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-04 21:29:05,283 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2021-06-04 21:29:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:05,487 INFO L225 Difference]: With dead ends: 64389 [2021-06-04 21:29:05,487 INFO L226 Difference]: Without dead ends: 64119 [2021-06-04 21:29:05,488 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 913.7ms TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2021-06-04 21:29:05,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64119 states. [2021-06-04 21:29:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64119 to 54940. [2021-06-04 21:29:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54940 states, 54938 states have (on average 4.293439877680294) internal successors, (235873), 54939 states have internal predecessors, (235873), 0 states have call successors, (0), 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-04 21:29:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54940 states to 54940 states and 235873 transitions. [2021-06-04 21:29:07,038 INFO L78 Accepts]: Start accepts. Automaton has 54940 states and 235873 transitions. Word has length 65 [2021-06-04 21:29:07,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:07,039 INFO L482 AbstractCegarLoop]: Abstraction has 54940 states and 235873 transitions. [2021-06-04 21:29:07,039 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 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-04 21:29:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 54940 states and 235873 transitions. [2021-06-04 21:29:07,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-04 21:29:07,058 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:07,058 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, 1, 1, 1, 1] [2021-06-04 21:29:07,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-04 21:29:07,059 INFO L430 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:07,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:07,059 INFO L82 PathProgramCache]: Analyzing trace with hash 225742194, now seen corresponding path program 1 times [2021-06-04 21:29:07,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:07,059 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765215892] [2021-06-04 21:29:07,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:07,130 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-04 21:29:07,130 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:07,130 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765215892] [2021-06-04 21:29:07,130 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765215892] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:07,130 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:07,130 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 21:29:07,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668263681] [2021-06-04 21:29:07,131 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 21:29:07,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:07,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 21:29:07,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-04 21:29:07,131 INFO L87 Difference]: Start difference. First operand 54940 states and 235873 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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-04 21:29:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:08,463 INFO L93 Difference]: Finished difference Result 74107 states and 309485 transitions. [2021-06-04 21:29:08,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-04 21:29:08,465 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2021-06-04 21:29:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:08,763 INFO L225 Difference]: With dead ends: 74107 [2021-06-04 21:29:08,763 INFO L226 Difference]: Without dead ends: 67995 [2021-06-04 21:29:08,763 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 138.9ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-06-04 21:29:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67995 states. [2021-06-04 21:29:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67995 to 55174. [2021-06-04 21:29:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55174 states, 55172 states have (on average 4.289802798520989) internal successors, (236677), 55173 states have internal predecessors, (236677), 0 states have call successors, (0), 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-04 21:29:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55174 states to 55174 states and 236677 transitions. [2021-06-04 21:29:10,559 INFO L78 Accepts]: Start accepts. Automaton has 55174 states and 236677 transitions. Word has length 65 [2021-06-04 21:29:10,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:10,559 INFO L482 AbstractCegarLoop]: Abstraction has 55174 states and 236677 transitions. [2021-06-04 21:29:10,559 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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-04 21:29:10,559 INFO L276 IsEmpty]: Start isEmpty. Operand 55174 states and 236677 transitions. [2021-06-04 21:29:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-04 21:29:10,588 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:10,588 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, 1, 1, 1, 1] [2021-06-04 21:29:10,588 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-04 21:29:10,596 INFO L430 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:10,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:10,597 INFO L82 PathProgramCache]: Analyzing trace with hash -405027412, now seen corresponding path program 2 times [2021-06-04 21:29:10,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:10,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970946547] [2021-06-04 21:29:10,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:10,756 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-04 21:29:10,756 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:10,756 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970946547] [2021-06-04 21:29:10,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970946547] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:10,756 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:10,756 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-04 21:29:10,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470064620] [2021-06-04 21:29:10,758 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-04 21:29:10,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:10,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-04 21:29:10,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-04 21:29:10,759 INFO L87 Difference]: Start difference. First operand 55174 states and 236677 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 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-04 21:29:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:11,678 INFO L93 Difference]: Finished difference Result 72794 states and 304360 transitions. [2021-06-04 21:29:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-04 21:29:11,679 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2021-06-04 21:29:11,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:12,444 INFO L225 Difference]: With dead ends: 72794 [2021-06-04 21:29:12,444 INFO L226 Difference]: Without dead ends: 66814 [2021-06-04 21:29:12,445 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 257.6ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-06-04 21:29:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66814 states. [2021-06-04 21:29:14,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66814 to 54455. [2021-06-04 21:29:14,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54455 states, 54453 states have (on average 4.294363946889979) internal successors, (233841), 54454 states have internal predecessors, (233841), 0 states have call successors, (0), 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-04 21:29:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54455 states to 54455 states and 233841 transitions. [2021-06-04 21:29:14,378 INFO L78 Accepts]: Start accepts. Automaton has 54455 states and 233841 transitions. Word has length 65 [2021-06-04 21:29:14,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:14,379 INFO L482 AbstractCegarLoop]: Abstraction has 54455 states and 233841 transitions. [2021-06-04 21:29:14,379 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 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-04 21:29:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 54455 states and 233841 transitions. [2021-06-04 21:29:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-04 21:29:14,405 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:14,405 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, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:14,405 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-04 21:29:14,406 INFO L430 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:14,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:14,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1600315377, now seen corresponding path program 1 times [2021-06-04 21:29:14,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:14,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412720068] [2021-06-04 21:29:14,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:14,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-04 21:29:14,965 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:14,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412720068] [2021-06-04 21:29:14,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412720068] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:14,965 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:14,965 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-04 21:29:14,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349776409] [2021-06-04 21:29:14,965 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-04 21:29:14,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:14,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-04 21:29:14,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-06-04 21:29:14,966 INFO L87 Difference]: Start difference. First operand 54455 states and 233841 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 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-04 21:29:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:16,868 INFO L93 Difference]: Finished difference Result 60956 states and 259147 transitions. [2021-06-04 21:29:16,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-04 21:29:16,868 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-06-04 21:29:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:17,042 INFO L225 Difference]: With dead ends: 60956 [2021-06-04 21:29:17,042 INFO L226 Difference]: Without dead ends: 60614 [2021-06-04 21:29:17,043 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 982.6ms TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2021-06-04 21:29:17,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60614 states. [2021-06-04 21:29:18,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60614 to 49129. [2021-06-04 21:29:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49129 states, 49127 states have (on average 4.269749832067905) internal successors, (209760), 49128 states have internal predecessors, (209760), 0 states have call successors, (0), 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-04 21:29:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49129 states to 49129 states and 209760 transitions. [2021-06-04 21:29:18,447 INFO L78 Accepts]: Start accepts. Automaton has 49129 states and 209760 transitions. Word has length 67 [2021-06-04 21:29:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:18,447 INFO L482 AbstractCegarLoop]: Abstraction has 49129 states and 209760 transitions. [2021-06-04 21:29:18,447 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 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-04 21:29:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 49129 states and 209760 transitions. [2021-06-04 21:29:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-04 21:29:18,479 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:18,479 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:18,479 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-04 21:29:18,479 INFO L430 AbstractCegarLoop]: === Iteration 21 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:18,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:18,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1860189259, now seen corresponding path program 1 times [2021-06-04 21:29:18,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:18,480 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642253270] [2021-06-04 21:29:18,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:19,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-04 21:29:19,082 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:19,082 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642253270] [2021-06-04 21:29:19,083 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642253270] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:19,083 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:19,083 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-04 21:29:19,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732749013] [2021-06-04 21:29:19,083 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-04 21:29:19,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:19,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-04 21:29:19,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2021-06-04 21:29:19,084 INFO L87 Difference]: Start difference. First operand 49129 states and 209760 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 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-04 21:29:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:21,036 INFO L93 Difference]: Finished difference Result 55018 states and 232303 transitions. [2021-06-04 21:29:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-04 21:29:21,037 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-06-04 21:29:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:21,189 INFO L225 Difference]: With dead ends: 55018 [2021-06-04 21:29:21,189 INFO L226 Difference]: Without dead ends: 53779 [2021-06-04 21:29:21,189 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1110.1ms TimeCoverageRelationStatistics Valid=213, Invalid=1593, Unknown=0, NotChecked=0, Total=1806 [2021-06-04 21:29:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53779 states. [2021-06-04 21:29:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53779 to 51011. [2021-06-04 21:29:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51011 states, 51009 states have (on average 4.255660765747221) internal successors, (217077), 51010 states have internal predecessors, (217077), 0 states have call successors, (0), 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-04 21:29:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51011 states to 51011 states and 217077 transitions. [2021-06-04 21:29:22,607 INFO L78 Accepts]: Start accepts. Automaton has 51011 states and 217077 transitions. Word has length 68 [2021-06-04 21:29:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:22,608 INFO L482 AbstractCegarLoop]: Abstraction has 51011 states and 217077 transitions. [2021-06-04 21:29:22,608 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 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-04 21:29:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 51011 states and 217077 transitions. [2021-06-04 21:29:22,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-04 21:29:22,641 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:22,641 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:22,641 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-04 21:29:22,641 INFO L430 AbstractCegarLoop]: === Iteration 22 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:22,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:22,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1722827065, now seen corresponding path program 2 times [2021-06-04 21:29:22,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:22,642 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690009115] [2021-06-04 21:29:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:23,119 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-04 21:29:23,119 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:23,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690009115] [2021-06-04 21:29:23,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690009115] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:23,120 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:23,120 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-04 21:29:23,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207356057] [2021-06-04 21:29:23,120 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-04 21:29:23,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:23,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-04 21:29:23,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-04 21:29:23,121 INFO L87 Difference]: Start difference. First operand 51011 states and 217077 transitions. Second operand has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 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-04 21:29:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:24,986 INFO L93 Difference]: Finished difference Result 57059 states and 240069 transitions. [2021-06-04 21:29:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-04 21:29:24,986 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-06-04 21:29:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:25,148 INFO L225 Difference]: With dead ends: 57059 [2021-06-04 21:29:25,148 INFO L226 Difference]: Without dead ends: 55775 [2021-06-04 21:29:25,149 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 818.9ms TimeCoverageRelationStatistics Valid=190, Invalid=1216, Unknown=0, NotChecked=0, Total=1406 [2021-06-04 21:29:25,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55775 states. [2021-06-04 21:29:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55775 to 51041. [2021-06-04 21:29:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51041 states, 51039 states have (on average 4.254511256098278) internal successors, (217146), 51040 states have internal predecessors, (217146), 0 states have call successors, (0), 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-04 21:29:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51041 states to 51041 states and 217146 transitions. [2021-06-04 21:29:26,583 INFO L78 Accepts]: Start accepts. Automaton has 51041 states and 217146 transitions. Word has length 68 [2021-06-04 21:29:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:26,583 INFO L482 AbstractCegarLoop]: Abstraction has 51041 states and 217146 transitions. [2021-06-04 21:29:26,583 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.4) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 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-04 21:29:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 51041 states and 217146 transitions. [2021-06-04 21:29:26,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-04 21:29:26,610 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:26,610 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:26,610 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-04 21:29:26,610 INFO L430 AbstractCegarLoop]: === Iteration 23 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:26,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:26,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1587679323, now seen corresponding path program 3 times [2021-06-04 21:29:26,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:26,611 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998402537] [2021-06-04 21:29:26,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:27,021 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-04 21:29:27,022 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:27,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998402537] [2021-06-04 21:29:27,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998402537] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:27,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:27,022 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-04 21:29:27,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139015875] [2021-06-04 21:29:27,022 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-04 21:29:27,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:27,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-04 21:29:27,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-04 21:29:27,023 INFO L87 Difference]: Start difference. First operand 51041 states and 217146 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 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-04 21:29:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:28,643 INFO L93 Difference]: Finished difference Result 57090 states and 240097 transitions. [2021-06-04 21:29:28,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-04 21:29:28,643 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-06-04 21:29:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:28,817 INFO L225 Difference]: With dead ends: 57090 [2021-06-04 21:29:28,818 INFO L226 Difference]: Without dead ends: 55761 [2021-06-04 21:29:28,818 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 700.3ms TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2021-06-04 21:29:29,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55761 states. [2021-06-04 21:29:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55761 to 51081. [2021-06-04 21:29:30,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51081 states, 51079 states have (on average 4.252882789404648) internal successors, (217233), 51080 states have internal predecessors, (217233), 0 states have call successors, (0), 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-04 21:29:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51081 states to 51081 states and 217233 transitions. [2021-06-04 21:29:30,287 INFO L78 Accepts]: Start accepts. Automaton has 51081 states and 217233 transitions. Word has length 68 [2021-06-04 21:29:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:30,287 INFO L482 AbstractCegarLoop]: Abstraction has 51081 states and 217233 transitions. [2021-06-04 21:29:30,287 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 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-04 21:29:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 51081 states and 217233 transitions. [2021-06-04 21:29:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-04 21:29:30,314 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:30,314 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:30,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-04 21:29:30,314 INFO L430 AbstractCegarLoop]: === Iteration 24 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:30,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:30,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1285672051, now seen corresponding path program 4 times [2021-06-04 21:29:30,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:30,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426920915] [2021-06-04 21:29:30,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:30,848 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-04 21:29:30,848 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:30,848 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426920915] [2021-06-04 21:29:30,848 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426920915] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:30,848 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:30,848 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-04 21:29:30,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605551820] [2021-06-04 21:29:30,849 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-04 21:29:30,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:30,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-04 21:29:30,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-04 21:29:30,849 INFO L87 Difference]: Start difference. First operand 51081 states and 217233 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 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-04 21:29:32,344 WARN L205 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-06-04 21:29:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:32,991 INFO L93 Difference]: Finished difference Result 57180 states and 240266 transitions. [2021-06-04 21:29:32,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-04 21:29:32,991 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-06-04 21:29:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:33,156 INFO L225 Difference]: With dead ends: 57180 [2021-06-04 21:29:33,157 INFO L226 Difference]: Without dead ends: 55851 [2021-06-04 21:29:33,157 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1595.1ms TimeCoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2021-06-04 21:29:33,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55851 states. [2021-06-04 21:29:34,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55851 to 51102. [2021-06-04 21:29:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51102 states, 51100 states have (on average 4.251859099804305) internal successors, (217270), 51101 states have internal predecessors, (217270), 0 states have call successors, (0), 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-04 21:29:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51102 states to 51102 states and 217270 transitions. [2021-06-04 21:29:34,578 INFO L78 Accepts]: Start accepts. Automaton has 51102 states and 217270 transitions. Word has length 68 [2021-06-04 21:29:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:34,578 INFO L482 AbstractCegarLoop]: Abstraction has 51102 states and 217270 transitions. [2021-06-04 21:29:34,578 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 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-04 21:29:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 51102 states and 217270 transitions. [2021-06-04 21:29:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-04 21:29:34,607 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:34,607 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:34,607 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-04 21:29:34,607 INFO L430 AbstractCegarLoop]: === Iteration 25 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:34,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:34,607 INFO L82 PathProgramCache]: Analyzing trace with hash -747687525, now seen corresponding path program 5 times [2021-06-04 21:29:34,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:34,608 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520765493] [2021-06-04 21:29:34,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:34,897 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-04 21:29:34,897 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:34,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520765493] [2021-06-04 21:29:34,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520765493] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:34,897 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:34,897 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-04 21:29:34,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570559363] [2021-06-04 21:29:34,897 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-04 21:29:34,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:34,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-04 21:29:34,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-04 21:29:34,898 INFO L87 Difference]: Start difference. First operand 51102 states and 217270 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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-04 21:29:36,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:36,322 INFO L93 Difference]: Finished difference Result 57173 states and 240259 transitions. [2021-06-04 21:29:36,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-04 21:29:36,322 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-06-04 21:29:36,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:36,497 INFO L225 Difference]: With dead ends: 57173 [2021-06-04 21:29:36,497 INFO L226 Difference]: Without dead ends: 55844 [2021-06-04 21:29:36,497 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 455.0ms TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-06-04 21:29:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55844 states. [2021-06-04 21:29:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55844 to 51103. [2021-06-04 21:29:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51103 states, 51101 states have (on average 4.251795463885247) internal successors, (217271), 51102 states have internal predecessors, (217271), 0 states have call successors, (0), 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-04 21:29:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51103 states to 51103 states and 217271 transitions. [2021-06-04 21:29:38,009 INFO L78 Accepts]: Start accepts. Automaton has 51103 states and 217271 transitions. Word has length 68 [2021-06-04 21:29:38,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:38,009 INFO L482 AbstractCegarLoop]: Abstraction has 51103 states and 217271 transitions. [2021-06-04 21:29:38,009 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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-04 21:29:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 51103 states and 217271 transitions. [2021-06-04 21:29:38,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-04 21:29:38,036 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:38,037 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:38,037 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-04 21:29:38,037 INFO L430 AbstractCegarLoop]: === Iteration 26 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:38,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:38,037 INFO L82 PathProgramCache]: Analyzing trace with hash 229412969, now seen corresponding path program 6 times [2021-06-04 21:29:38,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:38,037 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829218859] [2021-06-04 21:29:38,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:38,317 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-04 21:29:38,317 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:38,317 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829218859] [2021-06-04 21:29:38,317 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829218859] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:38,317 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:38,317 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-04 21:29:38,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004534311] [2021-06-04 21:29:38,318 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-04 21:29:38,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:38,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-04 21:29:38,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-04 21:29:38,318 INFO L87 Difference]: Start difference. First operand 51103 states and 217271 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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-04 21:29:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:39,151 INFO L93 Difference]: Finished difference Result 57203 states and 240305 transitions. [2021-06-04 21:29:39,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-04 21:29:39,151 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-06-04 21:29:39,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:39,808 INFO L225 Difference]: With dead ends: 57203 [2021-06-04 21:29:39,808 INFO L226 Difference]: Without dead ends: 55874 [2021-06-04 21:29:39,809 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 408.7ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-06-04 21:29:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55874 states. [2021-06-04 21:29:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55874 to 51132. [2021-06-04 21:29:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51132 states, 51130 states have (on average 4.250264032857422) internal successors, (217316), 51131 states have internal predecessors, (217316), 0 states have call successors, (0), 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-04 21:29:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51132 states to 51132 states and 217316 transitions. [2021-06-04 21:29:41,353 INFO L78 Accepts]: Start accepts. Automaton has 51132 states and 217316 transitions. Word has length 68 [2021-06-04 21:29:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:41,353 INFO L482 AbstractCegarLoop]: Abstraction has 51132 states and 217316 transitions. [2021-06-04 21:29:41,353 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 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-04 21:29:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 51132 states and 217316 transitions. [2021-06-04 21:29:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-04 21:29:41,383 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:41,383 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, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:41,383 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-04 21:29:41,383 INFO L430 AbstractCegarLoop]: === Iteration 27 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:41,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:41,384 INFO L82 PathProgramCache]: Analyzing trace with hash -838870671, now seen corresponding path program 7 times [2021-06-04 21:29:41,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:41,384 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100780449] [2021-06-04 21:29:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:41,622 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-04 21:29:41,623 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:41,623 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100780449] [2021-06-04 21:29:41,623 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100780449] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:41,623 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:41,623 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-04 21:29:41,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910903325] [2021-06-04 21:29:41,623 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-04 21:29:41,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:41,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-04 21:29:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-06-04 21:29:41,624 INFO L87 Difference]: Start difference. First operand 51132 states and 217316 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 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-04 21:29:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:42,214 INFO L93 Difference]: Finished difference Result 55837 states and 234184 transitions. [2021-06-04 21:29:42,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-04 21:29:42,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-06-04 21:29:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:42,372 INFO L225 Difference]: With dead ends: 55837 [2021-06-04 21:29:42,372 INFO L226 Difference]: Without dead ends: 54508 [2021-06-04 21:29:42,372 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 275.4ms TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-04 21:29:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54508 states. [2021-06-04 21:29:43,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54508 to 49737. [2021-06-04 21:29:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49737 states, 49735 states have (on average 4.245501156127475) internal successors, (211150), 49736 states have internal predecessors, (211150), 0 states have call successors, (0), 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-04 21:29:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49737 states to 49737 states and 211150 transitions. [2021-06-04 21:29:43,881 INFO L78 Accepts]: Start accepts. Automaton has 49737 states and 211150 transitions. Word has length 68 [2021-06-04 21:29:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:43,881 INFO L482 AbstractCegarLoop]: Abstraction has 49737 states and 211150 transitions. [2021-06-04 21:29:43,882 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 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-04 21:29:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 49737 states and 211150 transitions. [2021-06-04 21:29:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-04 21:29:43,916 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:43,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:43,916 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-04 21:29:43,916 INFO L430 AbstractCegarLoop]: === Iteration 28 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:43,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash 834173378, now seen corresponding path program 1 times [2021-06-04 21:29:43,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:43,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243058435] [2021-06-04 21:29:43,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:44,733 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2021-06-04 21:29:44,829 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-04 21:29:44,830 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:44,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243058435] [2021-06-04 21:29:44,830 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243058435] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:44,830 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:44,830 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-04 21:29:44,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577996833] [2021-06-04 21:29:44,830 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-04 21:29:44,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:44,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-04 21:29:44,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2021-06-04 21:29:44,831 INFO L87 Difference]: Start difference. First operand 49737 states and 211150 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 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-04 21:29:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:46,619 INFO L93 Difference]: Finished difference Result 57256 states and 239996 transitions. [2021-06-04 21:29:46,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-04 21:29:46,619 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-06-04 21:29:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:46,778 INFO L225 Difference]: With dead ends: 57256 [2021-06-04 21:29:46,778 INFO L226 Difference]: Without dead ends: 56134 [2021-06-04 21:29:46,779 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1045.9ms TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2021-06-04 21:29:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56134 states. [2021-06-04 21:29:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56134 to 49737. [2021-06-04 21:29:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49737 states, 49735 states have (on average 4.244596360711772) internal successors, (211105), 49736 states have internal predecessors, (211105), 0 states have call successors, (0), 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-04 21:29:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49737 states to 49737 states and 211105 transitions. [2021-06-04 21:29:48,222 INFO L78 Accepts]: Start accepts. Automaton has 49737 states and 211105 transitions. Word has length 70 [2021-06-04 21:29:48,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:48,222 INFO L482 AbstractCegarLoop]: Abstraction has 49737 states and 211105 transitions. [2021-06-04 21:29:48,222 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 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-04 21:29:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 49737 states and 211105 transitions. [2021-06-04 21:29:48,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-04 21:29:48,256 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:48,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:48,256 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-04 21:29:48,256 INFO L430 AbstractCegarLoop]: === Iteration 29 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:48,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:48,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1768735654, now seen corresponding path program 2 times [2021-06-04 21:29:48,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:48,257 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927789779] [2021-06-04 21:29:48,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:48,596 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2021-06-04 21:29:49,157 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-04 21:29:49,157 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:49,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927789779] [2021-06-04 21:29:49,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927789779] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:49,158 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:49,158 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-04 21:29:49,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499074983] [2021-06-04 21:29:49,158 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-04 21:29:49,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:49,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-04 21:29:49,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-06-04 21:29:49,159 INFO L87 Difference]: Start difference. First operand 49737 states and 211105 transitions. Second operand has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 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-04 21:29:50,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:50,687 INFO L93 Difference]: Finished difference Result 56867 states and 238439 transitions. [2021-06-04 21:29:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-04 21:29:50,687 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-06-04 21:29:50,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:50,843 INFO L225 Difference]: With dead ends: 56867 [2021-06-04 21:29:50,843 INFO L226 Difference]: Without dead ends: 55700 [2021-06-04 21:29:50,844 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 992.7ms TimeCoverageRelationStatistics Valid=164, Invalid=1168, Unknown=0, NotChecked=0, Total=1332 [2021-06-04 21:29:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55700 states. [2021-06-04 21:29:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55700 to 49329. [2021-06-04 21:29:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49329 states, 49327 states have (on average 4.248768422973219) internal successors, (209579), 49328 states have internal predecessors, (209579), 0 states have call successors, (0), 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-04 21:29:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49329 states to 49329 states and 209579 transitions. [2021-06-04 21:29:52,253 INFO L78 Accepts]: Start accepts. Automaton has 49329 states and 209579 transitions. Word has length 70 [2021-06-04 21:29:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:52,253 INFO L482 AbstractCegarLoop]: Abstraction has 49329 states and 209579 transitions. [2021-06-04 21:29:52,253 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 0 states have call successors, (0), 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-04 21:29:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 49329 states and 209579 transitions. [2021-06-04 21:29:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-04 21:29:52,287 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:52,287 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:52,287 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-04 21:29:52,287 INFO L430 AbstractCegarLoop]: === Iteration 30 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:52,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1979887372, now seen corresponding path program 3 times [2021-06-04 21:29:52,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:52,288 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648993356] [2021-06-04 21:29:52,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:53,115 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-04 21:29:53,115 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:53,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648993356] [2021-06-04 21:29:53,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648993356] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:53,115 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:53,115 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-04 21:29:53,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312904980] [2021-06-04 21:29:53,115 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-04 21:29:53,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:53,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-04 21:29:53,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-04 21:29:53,116 INFO L87 Difference]: Start difference. First operand 49329 states and 209579 transitions. Second operand has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 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-04 21:29:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:54,276 INFO L93 Difference]: Finished difference Result 53309 states and 223950 transitions. [2021-06-04 21:29:54,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-04 21:29:54,277 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-06-04 21:29:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:54,429 INFO L225 Difference]: With dead ends: 53309 [2021-06-04 21:29:54,429 INFO L226 Difference]: Without dead ends: 52526 [2021-06-04 21:29:54,430 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 760.2ms TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2021-06-04 21:29:54,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52526 states. [2021-06-04 21:29:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52526 to 46131. [2021-06-04 21:29:55,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46131 states, 46129 states have (on average 4.255609269656832) internal successors, (196307), 46130 states have internal predecessors, (196307), 0 states have call successors, (0), 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-04 21:29:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46131 states to 46131 states and 196307 transitions. [2021-06-04 21:29:55,700 INFO L78 Accepts]: Start accepts. Automaton has 46131 states and 196307 transitions. Word has length 70 [2021-06-04 21:29:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:55,700 INFO L482 AbstractCegarLoop]: Abstraction has 46131 states and 196307 transitions. [2021-06-04 21:29:55,700 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 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-04 21:29:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 46131 states and 196307 transitions. [2021-06-04 21:29:55,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-04 21:29:55,733 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:55,733 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:55,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-04 21:29:55,733 INFO L430 AbstractCegarLoop]: === Iteration 31 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:55,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:55,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1636468715, now seen corresponding path program 1 times [2021-06-04 21:29:55,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:55,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783168683] [2021-06-04 21:29:55,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:56,604 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 18 [2021-06-04 21:29:56,605 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-04 21:29:56,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:56,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783168683] [2021-06-04 21:29:56,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783168683] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:56,605 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:56,605 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-04 21:29:56,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578108914] [2021-06-04 21:29:56,606 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-04 21:29:56,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:56,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-04 21:29:56,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2021-06-04 21:29:56,606 INFO L87 Difference]: Start difference. First operand 46131 states and 196307 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 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-04 21:29:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:29:58,392 INFO L93 Difference]: Finished difference Result 46335 states and 194500 transitions. [2021-06-04 21:29:58,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-04 21:29:58,393 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-06-04 21:29:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:29:58,513 INFO L225 Difference]: With dead ends: 46335 [2021-06-04 21:29:58,514 INFO L226 Difference]: Without dead ends: 45255 [2021-06-04 21:29:58,514 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1426.5ms TimeCoverageRelationStatistics Valid=243, Invalid=1649, Unknown=0, NotChecked=0, Total=1892 [2021-06-04 21:29:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45255 states. [2021-06-04 21:29:59,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45255 to 40527. [2021-06-04 21:29:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40527 states, 40525 states have (on average 4.238864898210981) internal successors, (171780), 40526 states have internal predecessors, (171780), 0 states have call successors, (0), 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-04 21:29:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40527 states to 40527 states and 171780 transitions. [2021-06-04 21:29:59,600 INFO L78 Accepts]: Start accepts. Automaton has 40527 states and 171780 transitions. Word has length 71 [2021-06-04 21:29:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:29:59,600 INFO L482 AbstractCegarLoop]: Abstraction has 40527 states and 171780 transitions. [2021-06-04 21:29:59,600 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 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-04 21:29:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 40527 states and 171780 transitions. [2021-06-04 21:29:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-04 21:29:59,634 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:29:59,634 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:29:59,634 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-04 21:29:59,634 INFO L430 AbstractCegarLoop]: === Iteration 32 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:29:59,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:29:59,635 INFO L82 PathProgramCache]: Analyzing trace with hash -992111004, now seen corresponding path program 1 times [2021-06-04 21:29:59,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:29:59,635 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478257574] [2021-06-04 21:29:59,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:29:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:29:59,703 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-04 21:29:59,704 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:29:59,704 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478257574] [2021-06-04 21:29:59,704 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478257574] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:29:59,704 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:29:59,704 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-04 21:29:59,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273061642] [2021-06-04 21:29:59,704 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-04 21:29:59,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:59,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-04 21:29:59,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-04 21:29:59,705 INFO L87 Difference]: Start difference. First operand 40527 states and 171780 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 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-04 21:30:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:00,711 INFO L93 Difference]: Finished difference Result 62148 states and 255238 transitions. [2021-06-04 21:30:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-04 21:30:00,712 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-06-04 21:30:00,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:00,851 INFO L225 Difference]: With dead ends: 62148 [2021-06-04 21:30:00,851 INFO L226 Difference]: Without dead ends: 47082 [2021-06-04 21:30:00,851 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 148.6ms TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-06-04 21:30:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47082 states. [2021-06-04 21:30:01,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47082 to 37407. [2021-06-04 21:30:01,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37407 states, 37405 states have (on average 4.195535356235798) internal successors, (156934), 37406 states have internal predecessors, (156934), 0 states have call successors, (0), 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-04 21:30:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37407 states to 37407 states and 156934 transitions. [2021-06-04 21:30:01,682 INFO L78 Accepts]: Start accepts. Automaton has 37407 states and 156934 transitions. Word has length 71 [2021-06-04 21:30:01,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:01,682 INFO L482 AbstractCegarLoop]: Abstraction has 37407 states and 156934 transitions. [2021-06-04 21:30:01,682 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 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-04 21:30:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 37407 states and 156934 transitions. [2021-06-04 21:30:02,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-04 21:30:02,062 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:02,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:02,062 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-04 21:30:02,062 INFO L430 AbstractCegarLoop]: === Iteration 33 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:02,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:02,063 INFO L82 PathProgramCache]: Analyzing trace with hash 617757196, now seen corresponding path program 2 times [2021-06-04 21:30:02,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:02,063 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894148527] [2021-06-04 21:30:02,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:02,166 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-04 21:30:02,166 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:02,166 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894148527] [2021-06-04 21:30:02,166 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894148527] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:02,166 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:02,166 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-04 21:30:02,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799446170] [2021-06-04 21:30:02,166 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-04 21:30:02,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:02,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-04 21:30:02,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-04 21:30:02,167 INFO L87 Difference]: Start difference. First operand 37407 states and 156934 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 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-04 21:30:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:02,729 INFO L93 Difference]: Finished difference Result 52101 states and 213437 transitions. [2021-06-04 21:30:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-04 21:30:02,729 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-06-04 21:30:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:02,849 INFO L225 Difference]: With dead ends: 52101 [2021-06-04 21:30:02,850 INFO L226 Difference]: Without dead ends: 45375 [2021-06-04 21:30:02,850 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 212.2ms TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2021-06-04 21:30:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45375 states. [2021-06-04 21:30:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45375 to 37416. [2021-06-04 21:30:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37416 states, 37414 states have (on average 4.195648687657027) internal successors, (156976), 37415 states have internal predecessors, (156976), 0 states have call successors, (0), 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-04 21:30:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37416 states to 37416 states and 156976 transitions. [2021-06-04 21:30:04,063 INFO L78 Accepts]: Start accepts. Automaton has 37416 states and 156976 transitions. Word has length 71 [2021-06-04 21:30:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:04,063 INFO L482 AbstractCegarLoop]: Abstraction has 37416 states and 156976 transitions. [2021-06-04 21:30:04,063 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 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-04 21:30:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 37416 states and 156976 transitions. [2021-06-04 21:30:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-04 21:30:04,096 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:04,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:04,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-04 21:30:04,096 INFO L430 AbstractCegarLoop]: === Iteration 34 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:04,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:04,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1562092050, now seen corresponding path program 3 times [2021-06-04 21:30:04,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:04,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539546486] [2021-06-04 21:30:04,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:04,254 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-04 21:30:04,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:04,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539546486] [2021-06-04 21:30:04,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539546486] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:04,254 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:04,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-04 21:30:04,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432094201] [2021-06-04 21:30:04,255 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-04 21:30:04,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:04,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-04 21:30:04,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-06-04 21:30:04,256 INFO L87 Difference]: Start difference. First operand 37416 states and 156976 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 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-04 21:30:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:04,850 INFO L93 Difference]: Finished difference Result 47706 states and 195499 transitions. [2021-06-04 21:30:04,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-04 21:30:04,850 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-06-04 21:30:04,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:04,962 INFO L225 Difference]: With dead ends: 47706 [2021-06-04 21:30:04,962 INFO L226 Difference]: Without dead ends: 42690 [2021-06-04 21:30:04,963 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 306.3ms TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2021-06-04 21:30:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42690 states. [2021-06-04 21:30:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42690 to 34959. [2021-06-04 21:30:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34959 states, 34957 states have (on average 4.183539777440856) internal successors, (146244), 34958 states have internal predecessors, (146244), 0 states have call successors, (0), 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-04 21:30:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34959 states to 34959 states and 146244 transitions. [2021-06-04 21:30:06,141 INFO L78 Accepts]: Start accepts. Automaton has 34959 states and 146244 transitions. Word has length 71 [2021-06-04 21:30:06,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:06,141 INFO L482 AbstractCegarLoop]: Abstraction has 34959 states and 146244 transitions. [2021-06-04 21:30:06,141 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 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-04 21:30:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 34959 states and 146244 transitions. [2021-06-04 21:30:06,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-04 21:30:06,176 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:06,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:06,176 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-04 21:30:06,176 INFO L430 AbstractCegarLoop]: === Iteration 35 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:06,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:06,177 INFO L82 PathProgramCache]: Analyzing trace with hash -450918615, now seen corresponding path program 1 times [2021-06-04 21:30:06,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:06,177 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696088188] [2021-06-04 21:30:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:06,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-04 21:30:06,743 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:06,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696088188] [2021-06-04 21:30:06,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696088188] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:06,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:06,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-04 21:30:06,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288067214] [2021-06-04 21:30:06,743 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-04 21:30:06,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:06,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-04 21:30:06,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2021-06-04 21:30:06,744 INFO L87 Difference]: Start difference. First operand 34959 states and 146244 transitions. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 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-04 21:30:07,634 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2021-06-04 21:30:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:08,652 INFO L93 Difference]: Finished difference Result 35853 states and 147820 transitions. [2021-06-04 21:30:08,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-04 21:30:08,652 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-06-04 21:30:08,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:08,742 INFO L225 Difference]: With dead ends: 35853 [2021-06-04 21:30:08,742 INFO L226 Difference]: Without dead ends: 34053 [2021-06-04 21:30:08,743 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1494.8ms TimeCoverageRelationStatistics Valid=281, Invalid=1699, Unknown=0, NotChecked=0, Total=1980 [2021-06-04 21:30:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34053 states. [2021-06-04 21:30:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34053 to 29025. [2021-06-04 21:30:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29025 states, 29023 states have (on average 4.175447059228888) internal successors, (121184), 29024 states have internal predecessors, (121184), 0 states have call successors, (0), 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-04 21:30:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29025 states to 29025 states and 121184 transitions. [2021-06-04 21:30:09,708 INFO L78 Accepts]: Start accepts. Automaton has 29025 states and 121184 transitions. Word has length 73 [2021-06-04 21:30:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:09,708 INFO L482 AbstractCegarLoop]: Abstraction has 29025 states and 121184 transitions. [2021-06-04 21:30:09,708 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 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-04 21:30:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 29025 states and 121184 transitions. [2021-06-04 21:30:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-04 21:30:09,738 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:09,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:09,738 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-04 21:30:09,739 INFO L430 AbstractCegarLoop]: === Iteration 36 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:09,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:09,739 INFO L82 PathProgramCache]: Analyzing trace with hash 958835916, now seen corresponding path program 1 times [2021-06-04 21:30:09,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:09,739 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844174250] [2021-06-04 21:30:09,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:10,605 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-04 21:30:10,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:10,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844174250] [2021-06-04 21:30:10,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844174250] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:10,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:10,606 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-04 21:30:10,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55847010] [2021-06-04 21:30:10,606 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-04 21:30:10,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:10,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-04 21:30:10,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2021-06-04 21:30:10,606 INFO L87 Difference]: Start difference. First operand 29025 states and 121184 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 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-04 21:30:12,579 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2021-06-04 21:30:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:13,543 INFO L93 Difference]: Finished difference Result 38504 states and 159667 transitions. [2021-06-04 21:30:13,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-04 21:30:13,543 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-06-04 21:30:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:13,640 INFO L225 Difference]: With dead ends: 38504 [2021-06-04 21:30:13,641 INFO L226 Difference]: Without dead ends: 34922 [2021-06-04 21:30:13,641 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 2084.5ms TimeCoverageRelationStatistics Valid=254, Invalid=2296, Unknown=0, NotChecked=0, Total=2550 [2021-06-04 21:30:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34922 states. [2021-06-04 21:30:14,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34922 to 29592. [2021-06-04 21:30:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29592 states, 29590 states have (on average 4.223893207164583) internal successors, (124985), 29591 states have internal predecessors, (124985), 0 states have call successors, (0), 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-04 21:30:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29592 states to 29592 states and 124985 transitions. [2021-06-04 21:30:14,615 INFO L78 Accepts]: Start accepts. Automaton has 29592 states and 124985 transitions. Word has length 73 [2021-06-04 21:30:14,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:14,615 INFO L482 AbstractCegarLoop]: Abstraction has 29592 states and 124985 transitions. [2021-06-04 21:30:14,615 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 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-04 21:30:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 29592 states and 124985 transitions. [2021-06-04 21:30:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-04 21:30:14,659 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:14,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:14,659 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-04 21:30:14,659 INFO L430 AbstractCegarLoop]: === Iteration 37 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:14,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:14,659 INFO L82 PathProgramCache]: Analyzing trace with hash 937574186, now seen corresponding path program 2 times [2021-06-04 21:30:14,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:14,659 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129236706] [2021-06-04 21:30:14,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:15,470 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-04 21:30:15,470 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:15,470 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129236706] [2021-06-04 21:30:15,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129236706] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:15,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:15,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-06-04 21:30:15,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254073881] [2021-06-04 21:30:15,471 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-04 21:30:15,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:15,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-04 21:30:15,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2021-06-04 21:30:15,471 INFO L87 Difference]: Start difference. First operand 29592 states and 124985 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 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-04 21:30:17,462 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-06-04 21:30:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:17,477 INFO L93 Difference]: Finished difference Result 29856 states and 124699 transitions. [2021-06-04 21:30:17,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-04 21:30:17,477 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-06-04 21:30:17,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:17,558 INFO L225 Difference]: With dead ends: 29856 [2021-06-04 21:30:17,558 INFO L226 Difference]: Without dead ends: 27300 [2021-06-04 21:30:17,559 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1542.1ms TimeCoverageRelationStatistics Valid=245, Invalid=1825, Unknown=0, NotChecked=0, Total=2070 [2021-06-04 21:30:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27300 states. [2021-06-04 21:30:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27300 to 19407. [2021-06-04 21:30:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19407 states, 19405 states have (on average 4.1668126771450655) internal successors, (80857), 19406 states have internal predecessors, (80857), 0 states have call successors, (0), 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-04 21:30:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19407 states to 19407 states and 80857 transitions. [2021-06-04 21:30:18,000 INFO L78 Accepts]: Start accepts. Automaton has 19407 states and 80857 transitions. Word has length 73 [2021-06-04 21:30:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:18,000 INFO L482 AbstractCegarLoop]: Abstraction has 19407 states and 80857 transitions. [2021-06-04 21:30:18,000 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 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-04 21:30:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 19407 states and 80857 transitions. [2021-06-04 21:30:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-04 21:30:18,025 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:18,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:18,026 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-04 21:30:18,026 INFO L430 AbstractCegarLoop]: === Iteration 38 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:18,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:18,026 INFO L82 PathProgramCache]: Analyzing trace with hash 461088309, now seen corresponding path program 1 times [2021-06-04 21:30:18,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:18,026 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183025569] [2021-06-04 21:30:18,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:18,728 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-04 21:30:18,728 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:18,728 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183025569] [2021-06-04 21:30:18,728 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183025569] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:18,728 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:18,728 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-04 21:30:18,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056364028] [2021-06-04 21:30:18,729 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-04 21:30:18,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:18,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-04 21:30:18,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-06-04 21:30:18,729 INFO L87 Difference]: Start difference. First operand 19407 states and 80857 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:20,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:20,527 INFO L93 Difference]: Finished difference Result 24028 states and 98134 transitions. [2021-06-04 21:30:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-04 21:30:20,527 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-04 21:30:20,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:20,584 INFO L225 Difference]: With dead ends: 24028 [2021-06-04 21:30:20,585 INFO L226 Difference]: Without dead ends: 23164 [2021-06-04 21:30:20,585 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1216.2ms TimeCoverageRelationStatistics Valid=244, Invalid=1736, Unknown=0, NotChecked=0, Total=1980 [2021-06-04 21:30:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23164 states. [2021-06-04 21:30:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23164 to 21544. [2021-06-04 21:30:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21544 states, 21542 states have (on average 4.120369510723238) internal successors, (88761), 21543 states have internal predecessors, (88761), 0 states have call successors, (0), 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-04 21:30:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21544 states to 21544 states and 88761 transitions. [2021-06-04 21:30:20,997 INFO L78 Accepts]: Start accepts. Automaton has 21544 states and 88761 transitions. Word has length 74 [2021-06-04 21:30:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:20,997 INFO L482 AbstractCegarLoop]: Abstraction has 21544 states and 88761 transitions. [2021-06-04 21:30:20,997 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 21544 states and 88761 transitions. [2021-06-04 21:30:21,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-04 21:30:21,023 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:21,023 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:21,023 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-04 21:30:21,023 INFO L430 AbstractCegarLoop]: === Iteration 39 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:21,023 INFO L82 PathProgramCache]: Analyzing trace with hash 563120435, now seen corresponding path program 2 times [2021-06-04 21:30:21,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:21,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5567966] [2021-06-04 21:30:21,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:21,827 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 18 [2021-06-04 21:30:21,828 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-04 21:30:21,828 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:21,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5567966] [2021-06-04 21:30:21,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5567966] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:21,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:21,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-04 21:30:21,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923811698] [2021-06-04 21:30:21,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-04 21:30:21,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:21,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-04 21:30:21,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-06-04 21:30:21,833 INFO L87 Difference]: Start difference. First operand 21544 states and 88761 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:23,146 INFO L93 Difference]: Finished difference Result 24815 states and 100343 transitions. [2021-06-04 21:30:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-04 21:30:23,146 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-04 21:30:23,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:23,204 INFO L225 Difference]: With dead ends: 24815 [2021-06-04 21:30:23,204 INFO L226 Difference]: Without dead ends: 23951 [2021-06-04 21:30:23,204 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1237.1ms TimeCoverageRelationStatistics Valid=231, Invalid=1661, Unknown=0, NotChecked=0, Total=1892 [2021-06-04 21:30:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23951 states. [2021-06-04 21:30:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23951 to 21544. [2021-06-04 21:30:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21544 states, 21542 states have (on average 4.120369510723238) internal successors, (88761), 21543 states have internal predecessors, (88761), 0 states have call successors, (0), 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-04 21:30:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21544 states to 21544 states and 88761 transitions. [2021-06-04 21:30:23,640 INFO L78 Accepts]: Start accepts. Automaton has 21544 states and 88761 transitions. Word has length 74 [2021-06-04 21:30:23,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:23,640 INFO L482 AbstractCegarLoop]: Abstraction has 21544 states and 88761 transitions. [2021-06-04 21:30:23,640 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:23,640 INFO L276 IsEmpty]: Start isEmpty. Operand 21544 states and 88761 transitions. [2021-06-04 21:30:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-04 21:30:23,841 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:23,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:23,841 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-04 21:30:23,841 INFO L430 AbstractCegarLoop]: === Iteration 40 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:23,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:23,841 INFO L82 PathProgramCache]: Analyzing trace with hash -374211371, now seen corresponding path program 3 times [2021-06-04 21:30:23,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:23,841 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635680689] [2021-06-04 21:30:23,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:24,492 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-04 21:30:24,492 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:24,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635680689] [2021-06-04 21:30:24,492 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635680689] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:24,492 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:24,492 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-04 21:30:24,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177394994] [2021-06-04 21:30:24,493 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-04 21:30:24,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:24,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-04 21:30:24,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-06-04 21:30:24,493 INFO L87 Difference]: Start difference. First operand 21544 states and 88761 transitions. Second operand has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:26,267 INFO L93 Difference]: Finished difference Result 26738 states and 107510 transitions. [2021-06-04 21:30:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-04 21:30:26,268 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-04 21:30:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:26,322 INFO L225 Difference]: With dead ends: 26738 [2021-06-04 21:30:26,322 INFO L226 Difference]: Without dead ends: 23282 [2021-06-04 21:30:26,323 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1238.8ms TimeCoverageRelationStatistics Valid=247, Invalid=2009, Unknown=0, NotChecked=0, Total=2256 [2021-06-04 21:30:26,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23282 states. [2021-06-04 21:30:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23282 to 18952. [2021-06-04 21:30:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18952 states, 18950 states have (on average 4.075092348284961) internal successors, (77223), 18951 states have internal predecessors, (77223), 0 states have call successors, (0), 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-04 21:30:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18952 states to 18952 states and 77223 transitions. [2021-06-04 21:30:26,844 INFO L78 Accepts]: Start accepts. Automaton has 18952 states and 77223 transitions. Word has length 74 [2021-06-04 21:30:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:26,845 INFO L482 AbstractCegarLoop]: Abstraction has 18952 states and 77223 transitions. [2021-06-04 21:30:26,845 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 18952 states and 77223 transitions. [2021-06-04 21:30:26,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-04 21:30:26,869 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:26,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:26,870 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-04 21:30:26,870 INFO L430 AbstractCegarLoop]: === Iteration 41 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:26,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:26,870 INFO L82 PathProgramCache]: Analyzing trace with hash 447738003, now seen corresponding path program 4 times [2021-06-04 21:30:26,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:26,870 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944512898] [2021-06-04 21:30:26,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:27,359 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-04 21:30:27,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:27,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944512898] [2021-06-04 21:30:27,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944512898] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:27,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:27,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-04 21:30:27,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918405019] [2021-06-04 21:30:27,359 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-04 21:30:27,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:27,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-04 21:30:27,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-06-04 21:30:27,360 INFO L87 Difference]: Start difference. First operand 18952 states and 77223 transitions. Second operand has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:28,564 INFO L93 Difference]: Finished difference Result 22543 states and 89781 transitions. [2021-06-04 21:30:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-04 21:30:28,564 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-04 21:30:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:28,619 INFO L225 Difference]: With dead ends: 22543 [2021-06-04 21:30:28,619 INFO L226 Difference]: Without dead ends: 21679 [2021-06-04 21:30:28,620 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 892.8ms TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2021-06-04 21:30:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2021-06-04 21:30:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 19122. [2021-06-04 21:30:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19122 states, 19120 states have (on average 4.065585774058578) internal successors, (77734), 19121 states have internal predecessors, (77734), 0 states have call successors, (0), 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-04 21:30:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 77734 transitions. [2021-06-04 21:30:29,118 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 77734 transitions. Word has length 74 [2021-06-04 21:30:29,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:29,118 INFO L482 AbstractCegarLoop]: Abstraction has 19122 states and 77734 transitions. [2021-06-04 21:30:29,118 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 77734 transitions. [2021-06-04 21:30:29,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-04 21:30:29,141 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:29,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:29,141 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-04 21:30:29,141 INFO L430 AbstractCegarLoop]: === Iteration 42 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:29,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1081503733, now seen corresponding path program 5 times [2021-06-04 21:30:29,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:29,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798786144] [2021-06-04 21:30:29,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:29,604 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-04 21:30:29,604 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:29,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798786144] [2021-06-04 21:30:29,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798786144] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:29,605 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:29,605 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-04 21:30:29,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674211635] [2021-06-04 21:30:29,605 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-04 21:30:29,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:29,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-04 21:30:29,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-04 21:30:29,606 INFO L87 Difference]: Start difference. First operand 19122 states and 77734 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:30,575 INFO L93 Difference]: Finished difference Result 22763 states and 90402 transitions. [2021-06-04 21:30:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-04 21:30:30,575 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-04 21:30:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:30,625 INFO L225 Difference]: With dead ends: 22763 [2021-06-04 21:30:30,626 INFO L226 Difference]: Without dead ends: 21899 [2021-06-04 21:30:30,626 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 757.4ms TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2021-06-04 21:30:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21899 states. [2021-06-04 21:30:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21899 to 19172. [2021-06-04 21:30:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19172 states, 19170 states have (on average 4.060719874804382) internal successors, (77844), 19171 states have internal predecessors, (77844), 0 states have call successors, (0), 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-04 21:30:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19172 states to 19172 states and 77844 transitions. [2021-06-04 21:30:31,227 INFO L78 Accepts]: Start accepts. Automaton has 19172 states and 77844 transitions. Word has length 74 [2021-06-04 21:30:31,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:31,227 INFO L482 AbstractCegarLoop]: Abstraction has 19172 states and 77844 transitions. [2021-06-04 21:30:31,227 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:31,227 INFO L276 IsEmpty]: Start isEmpty. Operand 19172 states and 77844 transitions. [2021-06-04 21:30:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-04 21:30:31,249 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:31,249 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-04 21:30:31,250 INFO L430 AbstractCegarLoop]: === Iteration 43 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:31,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:31,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1223596091, now seen corresponding path program 6 times [2021-06-04 21:30:31,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:31,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927878120] [2021-06-04 21:30:31,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:31,853 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-04 21:30:31,853 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:31,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927878120] [2021-06-04 21:30:31,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927878120] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:31,854 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:31,854 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-04 21:30:31,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294734740] [2021-06-04 21:30:31,854 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-04 21:30:31,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:31,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-04 21:30:31,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-04 21:30:31,855 INFO L87 Difference]: Start difference. First operand 19172 states and 77844 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:33,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:33,825 INFO L93 Difference]: Finished difference Result 22885 states and 90632 transitions. [2021-06-04 21:30:33,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-04 21:30:33,826 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-04 21:30:33,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:33,878 INFO L225 Difference]: With dead ends: 22885 [2021-06-04 21:30:33,878 INFO L226 Difference]: Without dead ends: 22021 [2021-06-04 21:30:33,879 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1512.9ms TimeCoverageRelationStatistics Valid=253, Invalid=1817, Unknown=0, NotChecked=0, Total=2070 [2021-06-04 21:30:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22021 states. [2021-06-04 21:30:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22021 to 19193. [2021-06-04 21:30:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19193 states, 19191 states have (on average 4.058204366630191) internal successors, (77881), 19192 states have internal predecessors, (77881), 0 states have call successors, (0), 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-04 21:30:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19193 states to 19193 states and 77881 transitions. [2021-06-04 21:30:34,255 INFO L78 Accepts]: Start accepts. Automaton has 19193 states and 77881 transitions. Word has length 74 [2021-06-04 21:30:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:34,255 INFO L482 AbstractCegarLoop]: Abstraction has 19193 states and 77881 transitions. [2021-06-04 21:30:34,255 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 19193 states and 77881 transitions. [2021-06-04 21:30:34,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-04 21:30:34,280 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:34,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:34,280 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-04 21:30:34,280 INFO L430 AbstractCegarLoop]: === Iteration 44 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:34,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:34,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1885361097, now seen corresponding path program 7 times [2021-06-04 21:30:34,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:34,280 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851923656] [2021-06-04 21:30:34,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:34,563 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-04 21:30:34,563 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:34,563 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851923656] [2021-06-04 21:30:34,563 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851923656] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:34,564 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:34,564 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-04 21:30:34,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578805075] [2021-06-04 21:30:34,564 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-04 21:30:34,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:34,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-04 21:30:34,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-06-04 21:30:34,564 INFO L87 Difference]: Start difference. First operand 19193 states and 77881 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:35,348 INFO L93 Difference]: Finished difference Result 22856 states and 90587 transitions. [2021-06-04 21:30:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-04 21:30:35,348 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-04 21:30:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:35,599 INFO L225 Difference]: With dead ends: 22856 [2021-06-04 21:30:35,600 INFO L226 Difference]: Without dead ends: 21992 [2021-06-04 21:30:35,600 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 480.1ms TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2021-06-04 21:30:35,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21992 states. [2021-06-04 21:30:35,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21992 to 19194. [2021-06-04 21:30:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19194 states, 19192 states have (on average 4.058045018757816) internal successors, (77882), 19193 states have internal predecessors, (77882), 0 states have call successors, (0), 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-04 21:30:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19194 states to 19194 states and 77882 transitions. [2021-06-04 21:30:35,991 INFO L78 Accepts]: Start accepts. Automaton has 19194 states and 77882 transitions. Word has length 74 [2021-06-04 21:30:35,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:35,991 INFO L482 AbstractCegarLoop]: Abstraction has 19194 states and 77882 transitions. [2021-06-04 21:30:35,992 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 19194 states and 77882 transitions. [2021-06-04 21:30:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-04 21:30:36,016 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:36,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:36,016 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-04 21:30:36,016 INFO L430 AbstractCegarLoop]: === Iteration 45 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:36,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:36,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1675812887, now seen corresponding path program 8 times [2021-06-04 21:30:36,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:36,016 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715615026] [2021-06-04 21:30:36,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:36,349 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-04 21:30:36,349 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:36,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715615026] [2021-06-04 21:30:36,349 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715615026] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:36,349 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:36,349 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-04 21:30:36,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536857644] [2021-06-04 21:30:36,350 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-04 21:30:36,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-04 21:30:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-06-04 21:30:36,350 INFO L87 Difference]: Start difference. First operand 19194 states and 77882 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:37,148 INFO L93 Difference]: Finished difference Result 22886 states and 90633 transitions. [2021-06-04 21:30:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-04 21:30:37,149 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-04 21:30:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:37,199 INFO L225 Difference]: With dead ends: 22886 [2021-06-04 21:30:37,199 INFO L226 Difference]: Without dead ends: 22022 [2021-06-04 21:30:37,200 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 533.3ms TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2021-06-04 21:30:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22022 states. [2021-06-04 21:30:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22022 to 19223. [2021-06-04 21:30:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19223 states, 19221 states have (on average 4.054263565891473) internal successors, (77927), 19222 states have internal predecessors, (77927), 0 states have call successors, (0), 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-04 21:30:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19223 states to 19223 states and 77927 transitions. [2021-06-04 21:30:37,840 INFO L78 Accepts]: Start accepts. Automaton has 19223 states and 77927 transitions. Word has length 74 [2021-06-04 21:30:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:37,840 INFO L482 AbstractCegarLoop]: Abstraction has 19223 states and 77927 transitions. [2021-06-04 21:30:37,840 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 19223 states and 77927 transitions. [2021-06-04 21:30:37,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-04 21:30:37,871 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:37,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:37,880 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-04 21:30:37,880 INFO L430 AbstractCegarLoop]: === Iteration 46 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:37,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:37,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1475525857, now seen corresponding path program 9 times [2021-06-04 21:30:37,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:37,881 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848141165] [2021-06-04 21:30:37,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:38,289 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-04 21:30:38,289 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:38,290 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848141165] [2021-06-04 21:30:38,290 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848141165] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:38,290 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:38,290 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-04 21:30:38,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164742164] [2021-06-04 21:30:38,290 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-04 21:30:38,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:38,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-04 21:30:38,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-06-04 21:30:38,291 INFO L87 Difference]: Start difference. First operand 19223 states and 77927 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:38,776 INFO L93 Difference]: Finished difference Result 21916 states and 86727 transitions. [2021-06-04 21:30:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-04 21:30:38,776 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-06-04 21:30:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:38,824 INFO L225 Difference]: With dead ends: 21916 [2021-06-04 21:30:38,824 INFO L226 Difference]: Without dead ends: 21052 [2021-06-04 21:30:38,824 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 352.1ms TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-04 21:30:38,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21052 states. [2021-06-04 21:30:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21052 to 18224. [2021-06-04 21:30:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18224 states, 18222 states have (on average 4.059708045220064) internal successors, (73976), 18223 states have internal predecessors, (73976), 0 states have call successors, (0), 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-04 21:30:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18224 states to 18224 states and 73976 transitions. [2021-06-04 21:30:39,180 INFO L78 Accepts]: Start accepts. Automaton has 18224 states and 73976 transitions. Word has length 74 [2021-06-04 21:30:39,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:39,180 INFO L482 AbstractCegarLoop]: Abstraction has 18224 states and 73976 transitions. [2021-06-04 21:30:39,180 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 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-04 21:30:39,180 INFO L276 IsEmpty]: Start isEmpty. Operand 18224 states and 73976 transitions. [2021-06-04 21:30:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-04 21:30:39,412 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:39,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:39,412 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-04 21:30:39,412 INFO L430 AbstractCegarLoop]: === Iteration 47 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:39,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:39,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1183741372, now seen corresponding path program 1 times [2021-06-04 21:30:39,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:39,413 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173014902] [2021-06-04 21:30:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:40,310 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-04 21:30:40,310 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:40,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173014902] [2021-06-04 21:30:40,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173014902] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:40,311 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:40,311 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-04 21:30:40,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275622454] [2021-06-04 21:30:40,311 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-04 21:30:40,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:40,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-04 21:30:40,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-06-04 21:30:40,312 INFO L87 Difference]: Start difference. First operand 18224 states and 73976 transitions. Second operand has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 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-04 21:30:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:42,028 INFO L93 Difference]: Finished difference Result 24080 states and 95177 transitions. [2021-06-04 21:30:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-04 21:30:42,028 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-06-04 21:30:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:42,081 INFO L225 Difference]: With dead ends: 24080 [2021-06-04 21:30:42,082 INFO L226 Difference]: Without dead ends: 23396 [2021-06-04 21:30:42,082 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1509.6ms TimeCoverageRelationStatistics Valid=258, Invalid=1998, Unknown=0, NotChecked=0, Total=2256 [2021-06-04 21:30:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23396 states. [2021-06-04 21:30:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23396 to 18224. [2021-06-04 21:30:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18224 states, 18222 states have (on average 4.059708045220064) internal successors, (73976), 18223 states have internal predecessors, (73976), 0 states have call successors, (0), 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-04 21:30:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18224 states to 18224 states and 73976 transitions. [2021-06-04 21:30:42,596 INFO L78 Accepts]: Start accepts. Automaton has 18224 states and 73976 transitions. Word has length 76 [2021-06-04 21:30:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:42,596 INFO L482 AbstractCegarLoop]: Abstraction has 18224 states and 73976 transitions. [2021-06-04 21:30:42,596 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 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-04 21:30:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 18224 states and 73976 transitions. [2021-06-04 21:30:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-04 21:30:42,619 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:42,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:42,619 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-04 21:30:42,619 INFO L430 AbstractCegarLoop]: === Iteration 48 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:42,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:42,619 INFO L82 PathProgramCache]: Analyzing trace with hash -342292756, now seen corresponding path program 2 times [2021-06-04 21:30:42,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:42,620 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649259211] [2021-06-04 21:30:42,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:43,272 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-04 21:30:43,272 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:43,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649259211] [2021-06-04 21:30:43,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649259211] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:43,272 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:43,272 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-06-04 21:30:43,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19589069] [2021-06-04 21:30:43,272 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-04 21:30:43,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:43,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-04 21:30:43,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2021-06-04 21:30:43,273 INFO L87 Difference]: Start difference. First operand 18224 states and 73976 transitions. Second operand has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 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-04 21:30:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:44,970 INFO L93 Difference]: Finished difference Result 22030 states and 86807 transitions. [2021-06-04 21:30:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-04 21:30:44,970 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-06-04 21:30:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:45,019 INFO L225 Difference]: With dead ends: 22030 [2021-06-04 21:30:45,019 INFO L226 Difference]: Without dead ends: 21346 [2021-06-04 21:30:45,019 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1137.9ms TimeCoverageRelationStatistics Valid=196, Invalid=1526, Unknown=0, NotChecked=0, Total=1722 [2021-06-04 21:30:45,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21346 states. [2021-06-04 21:30:45,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21346 to 16478. [2021-06-04 21:30:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16478 states, 16476 states have (on average 4.074471959213401) internal successors, (67131), 16477 states have internal predecessors, (67131), 0 states have call successors, (0), 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-04 21:30:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16478 states to 16478 states and 67131 transitions. [2021-06-04 21:30:45,345 INFO L78 Accepts]: Start accepts. Automaton has 16478 states and 67131 transitions. Word has length 76 [2021-06-04 21:30:45,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:45,345 INFO L482 AbstractCegarLoop]: Abstraction has 16478 states and 67131 transitions. [2021-06-04 21:30:45,345 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 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-04 21:30:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 16478 states and 67131 transitions. [2021-06-04 21:30:45,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-04 21:30:45,367 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:45,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:45,367 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-04 21:30:45,367 INFO L430 AbstractCegarLoop]: === Iteration 49 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:45,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:45,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1885510190, now seen corresponding path program 3 times [2021-06-04 21:30:45,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:45,368 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388527263] [2021-06-04 21:30:45,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:45,847 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-04 21:30:45,847 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:45,847 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388527263] [2021-06-04 21:30:45,848 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388527263] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:45,848 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:45,848 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-06-04 21:30:45,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878854158] [2021-06-04 21:30:45,848 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-04 21:30:45,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:45,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-04 21:30:45,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2021-06-04 21:30:45,848 INFO L87 Difference]: Start difference. First operand 16478 states and 67131 transitions. Second operand has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 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-04 21:30:47,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:47,111 INFO L93 Difference]: Finished difference Result 21346 states and 84263 transitions. [2021-06-04 21:30:47,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-04 21:30:47,112 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-06-04 21:30:47,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:47,158 INFO L225 Difference]: With dead ends: 21346 [2021-06-04 21:30:47,158 INFO L226 Difference]: Without dead ends: 21004 [2021-06-04 21:30:47,159 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 816.7ms TimeCoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2021-06-04 21:30:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21004 states. [2021-06-04 21:30:47,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21004 to 16478. [2021-06-04 21:30:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16478 states, 16476 states have (on average 4.074471959213401) internal successors, (67131), 16477 states have internal predecessors, (67131), 0 states have call successors, (0), 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-04 21:30:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16478 states to 16478 states and 67131 transitions. [2021-06-04 21:30:47,481 INFO L78 Accepts]: Start accepts. Automaton has 16478 states and 67131 transitions. Word has length 76 [2021-06-04 21:30:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:47,481 INFO L482 AbstractCegarLoop]: Abstraction has 16478 states and 67131 transitions. [2021-06-04 21:30:47,482 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 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-04 21:30:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 16478 states and 67131 transitions. [2021-06-04 21:30:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-04 21:30:47,503 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:47,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:30:47,503 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-04 21:30:47,504 INFO L430 AbstractCegarLoop]: === Iteration 50 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1564620922, now seen corresponding path program 4 times [2021-06-04 21:30:47,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:47,504 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113095573] [2021-06-04 21:30:47,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:30:47,919 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-04 21:30:47,919 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:30:47,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113095573] [2021-06-04 21:30:47,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113095573] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:30:47,919 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:30:47,919 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-04 21:30:47,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532572442] [2021-06-04 21:30:47,920 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-04 21:30:47,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:30:47,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-04 21:30:47,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-04 21:30:47,920 INFO L87 Difference]: Start difference. First operand 16478 states and 67131 transitions. Second operand has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 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-04 21:30:49,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:30:49,223 INFO L93 Difference]: Finished difference Result 16265 states and 64818 transitions. [2021-06-04 21:30:49,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-04 21:30:49,224 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-06-04 21:30:49,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:30:49,260 INFO L225 Difference]: With dead ends: 16265 [2021-06-04 21:30:49,260 INFO L226 Difference]: Without dead ends: 15923 [2021-06-04 21:30:49,260 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 788.2ms TimeCoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2021-06-04 21:30:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15923 states. [2021-06-04 21:30:49,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15923 to 11363. [2021-06-04 21:30:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11363 states, 11362 states have (on average 4.191867628938567) internal successors, (47628), 11362 states have internal predecessors, (47628), 0 states have call successors, (0), 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-04 21:30:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11363 states to 11363 states and 47628 transitions. [2021-06-04 21:30:49,489 INFO L78 Accepts]: Start accepts. Automaton has 11363 states and 47628 transitions. Word has length 76 [2021-06-04 21:30:49,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:30:49,489 INFO L482 AbstractCegarLoop]: Abstraction has 11363 states and 47628 transitions. [2021-06-04 21:30:49,489 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 3.8) internal successors, (76), 20 states have internal predecessors, (76), 0 states have call successors, (0), 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-04 21:30:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 11363 states and 47628 transitions. [2021-06-04 21:30:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-06-04 21:30:49,507 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:30:49,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:30:49,508 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-04 21:30:49,508 INFO L430 AbstractCegarLoop]: === Iteration 51 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Thread1of1ForFork4Err8INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-06-04 21:30:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:30:49,508 INFO L82 PathProgramCache]: Analyzing trace with hash 511479404, now seen corresponding path program 1 times [2021-06-04 21:30:49,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:30:49,508 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520329483] [2021-06-04 21:30:49,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:30:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-04 21:30:49,528 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-04 21:30:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-04 21:30:49,551 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-04 21:30:49,591 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-04 21:30:49,591 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-04 21:30:49,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-04 21:30:49,594 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-04 21:30:49,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 09:30:49 BasicIcfg [2021-06-04 21:30:49,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-04 21:30:49,721 INFO L168 Benchmark]: Toolchain (without parser) took 178578.91 ms. Allocated memory was 337.6 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 298.7 MB in the beginning and 14.7 GB in the end (delta: -14.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.0 GB. [2021-06-04 21:30:49,721 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 337.6 MB. Free memory was 317.8 MB in the beginning and 317.8 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-04 21:30:49,721 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.34 ms. Allocated memory is still 337.6 MB. Free memory was 298.5 MB in the beginning and 259.5 MB in the end (delta: 39.0 MB). Peak memory consumption was 40.5 MB. Max. memory is 16.0 GB. [2021-06-04 21:30:49,721 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.78 ms. Allocated memory is still 337.6 MB. Free memory was 259.5 MB in the beginning and 257.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-04 21:30:49,721 INFO L168 Benchmark]: Boogie Preprocessor took 31.47 ms. Allocated memory is still 337.6 MB. Free memory was 257.0 MB in the beginning and 255.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-04 21:30:49,721 INFO L168 Benchmark]: RCFGBuilder took 435.80 ms. Allocated memory is still 337.6 MB. Free memory was 255.3 MB in the beginning and 225.6 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. [2021-06-04 21:30:49,721 INFO L168 Benchmark]: TraceAbstraction took 177401.79 ms. Allocated memory was 337.6 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 224.7 MB in the beginning and 14.7 GB in the end (delta: -14.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.0 GB. [2021-06-04 21:30:49,722 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.12 ms. Allocated memory is still 337.6 MB. Free memory was 317.8 MB in the beginning and 317.8 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 655.34 ms. Allocated memory is still 337.6 MB. Free memory was 298.5 MB in the beginning and 259.5 MB in the end (delta: 39.0 MB). Peak memory consumption was 40.5 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 45.78 ms. Allocated memory is still 337.6 MB. Free memory was 259.5 MB in the beginning and 257.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 31.47 ms. Allocated memory is still 337.6 MB. Free memory was 257.0 MB in the beginning and 255.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 435.80 ms. Allocated memory is still 337.6 MB. Free memory was 255.3 MB in the beginning and 225.6 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 177401.79 ms. Allocated memory was 337.6 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 224.7 MB in the beginning and 14.7 GB in the end (delta: -14.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1123]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1124] 0 char *v; VAL [v={0:0}] [L1161] 0 pthread_t t; VAL [v={0:0}] [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t1, 0, thread1, 0)=-2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=-2, arg={0:0}, arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) VAL [\read(t1)=-2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1128] 2 return 0; VAL [\read(t1)=-2, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=-2, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t2, 0, thread2, 0)=-1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t3, 0, thread3, 0)=0, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 5 v[0] = 'X' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 5 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t4, 0, thread2, 0)=1, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 3 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 3 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1163] 0 \read(t) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1133] 6 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1140] 4 v[0] = 'Y' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1142] 4 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, pthread_create(&t5, 0, thread2, 0)=2, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1135] 6 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1153] 1 \read(t2) VAL [\read(t2)=-1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=-1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1154] 1 \read(t3) VAL [\read(t3)=0, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=0, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1155] 1 \read(t4) VAL [\read(t4)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1156] 1 \read(t5) VAL [\read(t5)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t2={10:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t3={11:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t4={13:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, t5={5:0}, v={3:0}] [L1157] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1164] 0 v[0] VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1123] COND TRUE 0 !expression VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] [L1123] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={3:0}, v={3:0}] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 216 locations, 12 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 176833.4ms, OverallIterations: 51, TraceHistogramMax: 1, EmptinessCheckTime: 1957.3ms, AutomataDifference: 81262.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6277.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 11799 SDtfs, 20067 SDslu, 106338 SDs, 0 SdLazy, 49516 SolverSat, 2606 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25488.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1722 GetRequests, 107 SyntacticMatches, 135 SemanticMatches, 1480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9532 ImplicationChecksByTransitivity, 38990.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=70531occurred in iteration=0, InterpolantAutomatonStates: 1108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 62914.5ms AutomataMinimizationTime, 50 MinimizatonAttempts, 330047 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 119.3ms SsaConstructionTime, 816.9ms SatisfiabilityAnalysisTime, 23011.7ms InterpolantComputationTime, 3439 NumberOfCodeBlocks, 3439 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 3279 ConstructedInterpolants, 0 QuantifiedInterpolants, 73527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 50 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...