/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-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-10 14:52:08,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-10 14:52:08,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-10 14:52:08,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-10 14:52:08,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-10 14:52:08,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-10 14:52:08,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-10 14:52:08,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-10 14:52:08,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-10 14:52:08,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-10 14:52:08,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-10 14:52:08,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-10 14:52:08,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-10 14:52:08,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-10 14:52:08,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-10 14:52:08,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-10 14:52:08,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-10 14:52:08,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-10 14:52:08,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-10 14:52:08,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-10 14:52:08,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-10 14:52:08,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-10 14:52:08,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-10 14:52:08,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-10 14:52:08,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-10 14:52:08,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-10 14:52:08,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-10 14:52:08,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-10 14:52:08,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-10 14:52:08,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-10 14:52:08,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-10 14:52:08,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-10 14:52:08,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-10 14:52:08,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-10 14:52:08,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-10 14:52:08,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-10 14:52:08,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-10 14:52:08,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-10 14:52:08,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-10 14:52:08,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-10 14:52:08,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-10 14:52:08,597 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-03-10 14:52:08,617 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-10 14:52:08,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-10 14:52:08,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-03-10 14:52:08,618 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-03-10 14:52:08,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-10 14:52:08,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-10 14:52:08,619 INFO L138 SettingsManager]: * Use SBE=true [2021-03-10 14:52:08,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-10 14:52:08,619 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-10 14:52:08,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-10 14:52:08,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-10 14:52:08,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-10 14:52:08,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-10 14:52:08,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-10 14:52:08,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-10 14:52:08,620 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-10 14:52:08,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-10 14:52:08,621 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-10 14:52:08,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-10 14:52:08,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-10 14:52:08,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-10 14:52:08,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-10 14:52:08,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-10 14:52:08,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 14:52:08,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-10 14:52:08,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-10 14:52:08,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-10 14:52:08,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-10 14:52:08,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-10 14:52:08,622 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-10 14:52:08,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-10 14:52:08,623 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-03-10 14:52:08,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-10 14:52:08,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-10 14:52:08,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-10 14:52:08,929 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-10 14:52:08,930 INFO L275 PluginConnector]: CDTParser initialized [2021-03-10 14:52:08,930 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2021-03-10 14:52:08,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d5e05932/41f7ac40e0b941ba957b596bc0896f23/FLAG7bbf3e00f [2021-03-10 14:52:09,599 INFO L306 CDTParser]: Found 1 translation units. [2021-03-10 14:52:09,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2021-03-10 14:52:09,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d5e05932/41f7ac40e0b941ba957b596bc0896f23/FLAG7bbf3e00f [2021-03-10 14:52:09,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d5e05932/41f7ac40e0b941ba957b596bc0896f23 [2021-03-10 14:52:09,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-10 14:52:09,984 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-10 14:52:09,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-10 14:52:09,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-10 14:52:09,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-10 14:52:09,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 02:52:09" (1/1) ... [2021-03-10 14:52:09,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9555d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 02:52:09, skipping insertion in model container [2021-03-10 14:52:09,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 02:52:09" (1/1) ... [2021-03-10 14:52:09,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-10 14:52:10,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-10 14:52:10,204 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-10 14:52:10,403 WARN L226 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-03-10 14:52:10,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 14:52:10,430 INFO L203 MainTranslator]: Completed pre-run [2021-03-10 14:52:10,443 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-10 14:52:10,465 WARN L226 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-03-10 14:52:10,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 14:52:10,615 INFO L208 MainTranslator]: Completed translation [2021-03-10 14:52:10,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 02:52:10 WrapperNode [2021-03-10 14:52:10,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-10 14:52:10,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-10 14:52:10,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-10 14:52:10,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-10 14:52:10,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 02:52:10" (1/1) ... [2021-03-10 14:52:10,658 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 02:52:10" (1/1) ... [2021-03-10 14:52:10,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-10 14:52:10,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-10 14:52:10,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-10 14:52:10,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-10 14:52:10,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 02:52:10" (1/1) ... [2021-03-10 14:52:10,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 02:52:10" (1/1) ... [2021-03-10 14:52:10,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 02:52:10" (1/1) ... [2021-03-10 14:52:10,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 02:52:10" (1/1) ... [2021-03-10 14:52:10,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 02:52:10" (1/1) ... [2021-03-10 14:52:10,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 02:52:10" (1/1) ... [2021-03-10 14:52:10,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 02:52:10" (1/1) ... [2021-03-10 14:52:10,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-10 14:52:10,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-10 14:52:10,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-10 14:52:10,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-10 14:52:10,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 02:52:10" (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-03-10 14:52:10,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-10 14:52:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-10 14:52:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-10 14:52:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-10 14:52:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-10 14:52:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-03-10 14:52:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-03-10 14:52:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-10 14:52:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-10 14:52:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-10 14:52:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-10 14:52:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-10 14:52:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-10 14:52:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-10 14:52:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-03-10 14:52:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-10 14:52:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-10 14:52:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-10 14:52:10,777 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-10 14:52:11,198 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-10 14:52:11,198 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-03-10 14:52:11,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 02:52:11 BoogieIcfgContainer [2021-03-10 14:52:11,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-10 14:52:11,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-10 14:52:11,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-10 14:52:11,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-10 14:52:11,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.03 02:52:09" (1/3) ... [2021-03-10 14:52:11,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5701ee15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 02:52:11, skipping insertion in model container [2021-03-10 14:52:11,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 02:52:10" (2/3) ... [2021-03-10 14:52:11,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5701ee15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 02:52:11, skipping insertion in model container [2021-03-10 14:52:11,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 02:52:11" (3/3) ... [2021-03-10 14:52:11,208 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2021-03-10 14:52:11,213 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-10 14:52:11,213 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-10 14:52:11,216 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-10 14:52:11,216 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-10 14:52:11,274 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,275 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,275 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,275 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,275 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,276 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,276 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,276 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,276 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,276 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,276 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,276 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,277 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,277 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,277 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,277 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,277 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,277 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,278 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,278 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,278 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,278 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,278 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,278 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,279 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,279 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,279 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,279 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,279 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,279 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,279 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,280 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,280 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,280 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,280 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,280 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,280 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,281 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,281 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,281 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,281 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,282 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,283 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,283 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,283 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,283 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,283 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,283 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,283 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,290 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,290 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,290 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,290 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,290 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,290 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,290 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,291 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,294 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,294 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,294 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,294 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,294 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,294 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,294 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,294 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,296 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,297 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,297 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,297 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,297 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,297 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,297 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,298 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,299 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,299 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,299 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,300 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,301 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,301 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,301 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,301 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,301 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,303 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,303 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,303 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,303 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,303 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,304 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,304 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,304 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,304 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,304 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,304 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,304 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,305 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,305 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,305 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,305 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,305 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,305 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,306 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,306 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,306 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,306 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,306 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,306 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,307 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,307 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,307 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,307 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,308 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,308 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,308 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,308 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,308 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,309 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,309 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,309 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,309 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,309 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,309 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,309 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,314 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,315 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,315 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,315 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,320 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,320 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,320 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,320 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,322 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,322 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,322 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,323 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,325 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,325 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,325 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,325 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,325 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,326 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,329 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,340 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,340 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,340 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,340 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,340 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,340 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,341 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,341 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,341 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,341 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,341 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,341 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,341 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,341 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,342 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,342 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,342 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,342 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,342 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,342 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,342 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,342 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,342 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,346 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,347 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,347 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,347 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,348 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,348 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,348 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,349 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,349 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,349 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,350 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,350 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,350 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,351 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,354 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,354 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,355 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,355 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,356 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,356 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,356 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,356 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,357 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,358 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,358 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,358 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 14:52:11,447 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-03-10 14:52:11,460 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-03-10 14:52:11,485 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-10 14:52:11,485 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-10 14:52:11,485 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-10 14:52:11,485 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-10 14:52:11,485 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-10 14:52:11,485 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-10 14:52:11,485 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-10 14:52:11,485 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-10 14:52:11,499 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 167 places, 248 transitions, 876 flow [2021-03-10 14:52:15,459 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 49592 states, 49586 states have (on average 4.294074940507401) internal successors, (212926), 49591 states have internal predecessors, (212926), 0 states have call successors, (0), 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-03-10 14:52:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 49592 states, 49586 states have (on average 4.294074940507401) internal successors, (212926), 49591 states have internal predecessors, (212926), 0 states have call successors, (0), 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-03-10 14:52:15,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-03-10 14:52:15,648 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:15,649 INFO L519 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] [2021-03-10 14:52:15,649 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:15,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:15,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1059109486, now seen corresponding path program 1 times [2021-03-10 14:52:15,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:15,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022220353] [2021-03-10 14:52:15,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:16,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022220353] [2021-03-10 14:52:16,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:16,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-10 14:52:16,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784406508] [2021-03-10 14:52:16,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-10 14:52:16,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:16,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-10 14:52:16,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-10 14:52:16,122 INFO L87 Difference]: Start difference. First operand has 49592 states, 49586 states have (on average 4.294074940507401) internal successors, (212926), 49591 states have internal predecessors, (212926), 0 states have call successors, (0), 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 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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-03-10 14:52:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:17,288 INFO L93 Difference]: Finished difference Result 53974 states and 232575 transitions. [2021-03-10 14:52:17,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 14:52:17,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-03-10 14:52:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:17,821 INFO L225 Difference]: With dead ends: 53974 [2021-03-10 14:52:17,822 INFO L226 Difference]: Without dead ends: 38049 [2021-03-10 14:52:17,823 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 203.3ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-03-10 14:52:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38049 states. [2021-03-10 14:52:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38049 to 31410. [2021-03-10 14:52:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31410 states, 31407 states have (on average 4.324641003597924) internal successors, (135824), 31409 states have internal predecessors, (135824), 0 states have call successors, (0), 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-03-10 14:52:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31410 states to 31410 states and 135824 transitions. [2021-03-10 14:52:19,451 INFO L78 Accepts]: Start accepts. Automaton has 31410 states and 135824 transitions. Word has length 36 [2021-03-10 14:52:19,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:19,452 INFO L480 AbstractCegarLoop]: Abstraction has 31410 states and 135824 transitions. [2021-03-10 14:52:19,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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-03-10 14:52:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 31410 states and 135824 transitions. [2021-03-10 14:52:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-03-10 14:52:19,454 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:19,454 INFO L519 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] [2021-03-10 14:52:19,454 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-10 14:52:19,454 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:19,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:19,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2041563374, now seen corresponding path program 2 times [2021-03-10 14:52:19,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:19,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050711698] [2021-03-10 14:52:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:19,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050711698] [2021-03-10 14:52:19,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:19,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-10 14:52:19,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110244255] [2021-03-10 14:52:19,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-10 14:52:19,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:19,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-10 14:52:19,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-10 14:52:19,636 INFO L87 Difference]: Start difference. First operand 31410 states and 135824 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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-03-10 14:52:20,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:20,607 INFO L93 Difference]: Finished difference Result 44662 states and 198283 transitions. [2021-03-10 14:52:20,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 14:52:20,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-03-10 14:52:20,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:20,953 INFO L225 Difference]: With dead ends: 44662 [2021-03-10 14:52:20,954 INFO L226 Difference]: Without dead ends: 44662 [2021-03-10 14:52:20,958 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 112.0ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-03-10 14:52:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44662 states. [2021-03-10 14:52:22,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44662 to 31368. [2021-03-10 14:52:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31368 states, 31366 states have (on average 4.327998469680546) internal successors, (135752), 31367 states have internal predecessors, (135752), 0 states have call successors, (0), 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-03-10 14:52:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31368 states to 31368 states and 135752 transitions. [2021-03-10 14:52:22,454 INFO L78 Accepts]: Start accepts. Automaton has 31368 states and 135752 transitions. Word has length 36 [2021-03-10 14:52:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:22,454 INFO L480 AbstractCegarLoop]: Abstraction has 31368 states and 135752 transitions. [2021-03-10 14:52:22,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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-03-10 14:52:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 31368 states and 135752 transitions. [2021-03-10 14:52:22,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-03-10 14:52:22,465 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:22,465 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 14:52:22,465 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-10 14:52:22,465 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:22,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:22,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1034006221, now seen corresponding path program 1 times [2021-03-10 14:52:22,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:22,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656906983] [2021-03-10 14:52:22,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:22,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656906983] [2021-03-10 14:52:22,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:22,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 14:52:22,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222375484] [2021-03-10 14:52:22,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 14:52:22,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:22,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 14:52:22,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 14:52:22,557 INFO L87 Difference]: Start difference. First operand 31368 states and 135752 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:23,366 INFO L93 Difference]: Finished difference Result 67824 states and 285630 transitions. [2021-03-10 14:52:23,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 14:52:23,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-03-10 14:52:23,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:23,572 INFO L225 Difference]: With dead ends: 67824 [2021-03-10 14:52:23,572 INFO L226 Difference]: Without dead ends: 41890 [2021-03-10 14:52:23,573 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 56.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 14:52:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41890 states. [2021-03-10 14:52:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41890 to 32368. [2021-03-10 14:52:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32368 states, 32366 states have (on average 4.169251683865785) internal successors, (134942), 32367 states have internal predecessors, (134942), 0 states have call successors, (0), 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-03-10 14:52:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32368 states to 32368 states and 134942 transitions. [2021-03-10 14:52:24,797 INFO L78 Accepts]: Start accepts. Automaton has 32368 states and 134942 transitions. Word has length 46 [2021-03-10 14:52:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:24,798 INFO L480 AbstractCegarLoop]: Abstraction has 32368 states and 134942 transitions. [2021-03-10 14:52:24,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 32368 states and 134942 transitions. [2021-03-10 14:52:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-03-10 14:52:24,809 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:24,809 INFO L519 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] [2021-03-10 14:52:24,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-10 14:52:24,810 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:24,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:24,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1892822382, now seen corresponding path program 1 times [2021-03-10 14:52:24,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:24,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435164824] [2021-03-10 14:52:24,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:24,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435164824] [2021-03-10 14:52:24,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:24,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-10 14:52:24,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128548733] [2021-03-10 14:52:24,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-10 14:52:24,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:24,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-10 14:52:24,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-10 14:52:24,956 INFO L87 Difference]: Start difference. First operand 32368 states and 134942 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 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-03-10 14:52:25,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:25,411 INFO L93 Difference]: Finished difference Result 39186 states and 163720 transitions. [2021-03-10 14:52:25,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 14:52:25,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-03-10 14:52:25,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:25,554 INFO L225 Difference]: With dead ends: 39186 [2021-03-10 14:52:25,554 INFO L226 Difference]: Without dead ends: 39114 [2021-03-10 14:52:25,554 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 97.2ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-03-10 14:52:25,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39114 states. [2021-03-10 14:52:26,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39114 to 35471. [2021-03-10 14:52:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35471 states, 35469 states have (on average 4.207899856212467) internal successors, (149250), 35470 states have internal predecessors, (149250), 0 states have call successors, (0), 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-03-10 14:52:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35471 states to 35471 states and 149250 transitions. [2021-03-10 14:52:26,706 INFO L78 Accepts]: Start accepts. Automaton has 35471 states and 149250 transitions. Word has length 48 [2021-03-10 14:52:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:26,707 INFO L480 AbstractCegarLoop]: Abstraction has 35471 states and 149250 transitions. [2021-03-10 14:52:26,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 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-03-10 14:52:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 35471 states and 149250 transitions. [2021-03-10 14:52:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-03-10 14:52:26,718 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:26,719 INFO L519 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] [2021-03-10 14:52:26,719 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-10 14:52:26,719 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:26,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:26,719 INFO L82 PathProgramCache]: Analyzing trace with hash 483318952, now seen corresponding path program 2 times [2021-03-10 14:52:26,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:26,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521983926] [2021-03-10 14:52:26,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:27,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521983926] [2021-03-10 14:52:27,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:27,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 14:52:27,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803643853] [2021-03-10 14:52:27,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 14:52:27,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:27,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 14:52:27,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-03-10 14:52:27,231 INFO L87 Difference]: Start difference. First operand 35471 states and 149250 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 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-03-10 14:52:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:27,796 INFO L93 Difference]: Finished difference Result 49953 states and 204492 transitions. [2021-03-10 14:52:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 14:52:27,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-03-10 14:52:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:27,910 INFO L225 Difference]: With dead ends: 49953 [2021-03-10 14:52:27,910 INFO L226 Difference]: Without dead ends: 45137 [2021-03-10 14:52:27,910 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 220.1ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-03-10 14:52:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45137 states. [2021-03-10 14:52:28,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45137 to 35386. [2021-03-10 14:52:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35386 states, 35384 states have (on average 4.210716708116663) internal successors, (148992), 35385 states have internal predecessors, (148992), 0 states have call successors, (0), 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-03-10 14:52:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35386 states to 35386 states and 148992 transitions. [2021-03-10 14:52:29,023 INFO L78 Accepts]: Start accepts. Automaton has 35386 states and 148992 transitions. Word has length 48 [2021-03-10 14:52:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:29,024 INFO L480 AbstractCegarLoop]: Abstraction has 35386 states and 148992 transitions. [2021-03-10 14:52:29,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 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-03-10 14:52:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 35386 states and 148992 transitions. [2021-03-10 14:52:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-03-10 14:52:29,034 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:29,034 INFO L519 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] [2021-03-10 14:52:29,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-10 14:52:29,035 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash -661431017, now seen corresponding path program 1 times [2021-03-10 14:52:29,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:29,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034943578] [2021-03-10 14:52:29,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:29,352 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 4 [2021-03-10 14:52:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:29,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034943578] [2021-03-10 14:52:29,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:29,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-10 14:52:29,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867293768] [2021-03-10 14:52:29,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-10 14:52:29,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:29,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-10 14:52:29,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-10 14:52:29,355 INFO L87 Difference]: Start difference. First operand 35386 states and 148992 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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-03-10 14:52:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:29,865 INFO L93 Difference]: Finished difference Result 38273 states and 158862 transitions. [2021-03-10 14:52:29,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 14:52:29,866 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-03-10 14:52:29,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:29,978 INFO L225 Difference]: With dead ends: 38273 [2021-03-10 14:52:29,978 INFO L226 Difference]: Without dead ends: 37793 [2021-03-10 14:52:29,978 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 361.2ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-03-10 14:52:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37793 states. [2021-03-10 14:52:30,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37793 to 36097. [2021-03-10 14:52:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36097 states, 36095 states have (on average 4.182518354342707) internal successors, (150968), 36096 states have internal predecessors, (150968), 0 states have call successors, (0), 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-03-10 14:52:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36097 states to 36097 states and 150968 transitions. [2021-03-10 14:52:31,083 INFO L78 Accepts]: Start accepts. Automaton has 36097 states and 150968 transitions. Word has length 49 [2021-03-10 14:52:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:31,083 INFO L480 AbstractCegarLoop]: Abstraction has 36097 states and 150968 transitions. [2021-03-10 14:52:31,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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-03-10 14:52:31,083 INFO L276 IsEmpty]: Start isEmpty. Operand 36097 states and 150968 transitions. [2021-03-10 14:52:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-03-10 14:52:31,096 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:31,096 INFO L519 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] [2021-03-10 14:52:31,096 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-10 14:52:31,097 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:31,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:31,097 INFO L82 PathProgramCache]: Analyzing trace with hash 545647439, now seen corresponding path program 2 times [2021-03-10 14:52:31,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:31,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827513073] [2021-03-10 14:52:31,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:31,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827513073] [2021-03-10 14:52:31,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:31,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-03-10 14:52:31,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527323114] [2021-03-10 14:52:31,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 14:52:31,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:31,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 14:52:31,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-03-10 14:52:31,433 INFO L87 Difference]: Start difference. First operand 36097 states and 150968 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 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-03-10 14:52:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:32,812 INFO L93 Difference]: Finished difference Result 43008 states and 180471 transitions. [2021-03-10 14:52:32,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-10 14:52:32,813 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-03-10 14:52:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:32,934 INFO L225 Difference]: With dead ends: 43008 [2021-03-10 14:52:32,934 INFO L226 Difference]: Without dead ends: 42762 [2021-03-10 14:52:32,935 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 585.7ms TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2021-03-10 14:52:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42762 states. [2021-03-10 14:52:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42762 to 39106. [2021-03-10 14:52:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39106 states, 39104 states have (on average 4.233735679214402) internal successors, (165556), 39105 states have internal predecessors, (165556), 0 states have call successors, (0), 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-03-10 14:52:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39106 states to 39106 states and 165556 transitions. [2021-03-10 14:52:34,054 INFO L78 Accepts]: Start accepts. Automaton has 39106 states and 165556 transitions. Word has length 49 [2021-03-10 14:52:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:34,056 INFO L480 AbstractCegarLoop]: Abstraction has 39106 states and 165556 transitions. [2021-03-10 14:52:34,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 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-03-10 14:52:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 39106 states and 165556 transitions. [2021-03-10 14:52:34,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-03-10 14:52:34,070 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:34,070 INFO L519 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] [2021-03-10 14:52:34,070 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-10 14:52:34,070 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:34,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:34,070 INFO L82 PathProgramCache]: Analyzing trace with hash -567913207, now seen corresponding path program 3 times [2021-03-10 14:52:34,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:34,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570176595] [2021-03-10 14:52:34,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:34,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570176595] [2021-03-10 14:52:34,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:34,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 14:52:34,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818645406] [2021-03-10 14:52:34,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 14:52:34,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:34,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 14:52:34,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-03-10 14:52:34,209 INFO L87 Difference]: Start difference. First operand 39106 states and 165556 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 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-03-10 14:52:34,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:34,773 INFO L93 Difference]: Finished difference Result 52392 states and 222067 transitions. [2021-03-10 14:52:34,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 14:52:34,774 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-03-10 14:52:34,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:35,341 INFO L225 Difference]: With dead ends: 52392 [2021-03-10 14:52:35,347 INFO L226 Difference]: Without dead ends: 52146 [2021-03-10 14:52:35,347 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 179.5ms TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2021-03-10 14:52:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52146 states. [2021-03-10 14:52:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52146 to 39033. [2021-03-10 14:52:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39033 states, 39031 states have (on average 4.235838179908278) internal successors, (165329), 39032 states have internal predecessors, (165329), 0 states have call successors, (0), 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-03-10 14:52:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39033 states to 39033 states and 165329 transitions. [2021-03-10 14:52:36,694 INFO L78 Accepts]: Start accepts. Automaton has 39033 states and 165329 transitions. Word has length 49 [2021-03-10 14:52:36,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:36,695 INFO L480 AbstractCegarLoop]: Abstraction has 39033 states and 165329 transitions. [2021-03-10 14:52:36,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 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-03-10 14:52:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 39033 states and 165329 transitions. [2021-03-10 14:52:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-03-10 14:52:36,720 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:36,720 INFO L519 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] [2021-03-10 14:52:36,720 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-10 14:52:36,720 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:36,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:36,721 INFO L82 PathProgramCache]: Analyzing trace with hash -754092592, now seen corresponding path program 1 times [2021-03-10 14:52:36,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:36,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252398367] [2021-03-10 14:52:36,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:37,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252398367] [2021-03-10 14:52:37,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:37,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-03-10 14:52:37,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274563644] [2021-03-10 14:52:37,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 14:52:37,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:37,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 14:52:37,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-03-10 14:52:37,149 INFO L87 Difference]: Start difference. First operand 39033 states and 165329 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:38,109 INFO L93 Difference]: Finished difference Result 49392 states and 211278 transitions. [2021-03-10 14:52:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 14:52:38,110 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-03-10 14:52:38,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:38,244 INFO L225 Difference]: With dead ends: 49392 [2021-03-10 14:52:38,245 INFO L226 Difference]: Without dead ends: 49146 [2021-03-10 14:52:38,245 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 472.0ms TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2021-03-10 14:52:38,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49146 states. [2021-03-10 14:52:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49146 to 38558. [2021-03-10 14:52:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38558 states, 38556 states have (on average 4.239988588027804) internal successors, (163477), 38557 states have internal predecessors, (163477), 0 states have call successors, (0), 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-03-10 14:52:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38558 states to 38558 states and 163477 transitions. [2021-03-10 14:52:39,436 INFO L78 Accepts]: Start accepts. Automaton has 38558 states and 163477 transitions. Word has length 51 [2021-03-10 14:52:39,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:39,437 INFO L480 AbstractCegarLoop]: Abstraction has 38558 states and 163477 transitions. [2021-03-10 14:52:39,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 38558 states and 163477 transitions. [2021-03-10 14:52:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-03-10 14:52:39,457 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:39,457 INFO L519 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] [2021-03-10 14:52:39,457 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-10 14:52:39,457 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:39,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:39,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2025602595, now seen corresponding path program 1 times [2021-03-10 14:52:39,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:39,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689417941] [2021-03-10 14:52:39,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:39,791 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-03-10 14:52:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:39,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689417941] [2021-03-10 14:52:39,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:39,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 14:52:39,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122549751] [2021-03-10 14:52:39,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 14:52:39,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:39,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 14:52:39,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-03-10 14:52:39,852 INFO L87 Difference]: Start difference. First operand 38558 states and 163477 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:40,387 INFO L93 Difference]: Finished difference Result 53401 states and 220011 transitions. [2021-03-10 14:52:40,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 14:52:40,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-03-10 14:52:40,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:40,514 INFO L225 Difference]: With dead ends: 53401 [2021-03-10 14:52:40,514 INFO L226 Difference]: Without dead ends: 48569 [2021-03-10 14:52:40,515 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 150.6ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-03-10 14:52:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48569 states. [2021-03-10 14:52:41,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48569 to 38658. [2021-03-10 14:52:41,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38658 states, 38656 states have (on average 4.2379449503311255) internal successors, (163822), 38657 states have internal predecessors, (163822), 0 states have call successors, (0), 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-03-10 14:52:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38658 states to 38658 states and 163822 transitions. [2021-03-10 14:52:41,765 INFO L78 Accepts]: Start accepts. Automaton has 38658 states and 163822 transitions. Word has length 51 [2021-03-10 14:52:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:41,766 INFO L480 AbstractCegarLoop]: Abstraction has 38658 states and 163822 transitions. [2021-03-10 14:52:41,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 38658 states and 163822 transitions. [2021-03-10 14:52:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-03-10 14:52:41,794 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:41,794 INFO L519 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] [2021-03-10 14:52:41,794 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-10 14:52:41,794 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:41,794 INFO L82 PathProgramCache]: Analyzing trace with hash 758939197, now seen corresponding path program 1 times [2021-03-10 14:52:41,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:41,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899069283] [2021-03-10 14:52:41,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:42,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899069283] [2021-03-10 14:52:42,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:42,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 14:52:42,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769449616] [2021-03-10 14:52:42,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 14:52:42,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:42,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 14:52:42,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-03-10 14:52:42,017 INFO L87 Difference]: Start difference. First operand 38658 states and 163822 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:43,167 INFO L93 Difference]: Finished difference Result 44638 states and 188037 transitions. [2021-03-10 14:52:43,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 14:52:43,168 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-03-10 14:52:43,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:43,315 INFO L225 Difference]: With dead ends: 44638 [2021-03-10 14:52:43,315 INFO L226 Difference]: Without dead ends: 44332 [2021-03-10 14:52:43,316 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 357.4ms TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2021-03-10 14:52:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44332 states. [2021-03-10 14:52:43,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44332 to 38658. [2021-03-10 14:52:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38658 states, 38656 states have (on average 4.2379449503311255) internal successors, (163822), 38657 states have internal predecessors, (163822), 0 states have call successors, (0), 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-03-10 14:52:44,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38658 states to 38658 states and 163822 transitions. [2021-03-10 14:52:44,556 INFO L78 Accepts]: Start accepts. Automaton has 38658 states and 163822 transitions. Word has length 51 [2021-03-10 14:52:44,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:44,557 INFO L480 AbstractCegarLoop]: Abstraction has 38658 states and 163822 transitions. [2021-03-10 14:52:44,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:44,557 INFO L276 IsEmpty]: Start isEmpty. Operand 38658 states and 163822 transitions. [2021-03-10 14:52:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-03-10 14:52:44,600 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:44,600 INFO L519 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] [2021-03-10 14:52:44,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-10 14:52:44,600 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:44,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash -49790413, now seen corresponding path program 2 times [2021-03-10 14:52:44,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:44,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482797036] [2021-03-10 14:52:44,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:44,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482797036] [2021-03-10 14:52:44,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:44,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-03-10 14:52:44,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031352045] [2021-03-10 14:52:44,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 14:52:44,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:44,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 14:52:44,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-03-10 14:52:44,924 INFO L87 Difference]: Start difference. First operand 38658 states and 163822 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:45,762 INFO L93 Difference]: Finished difference Result 49465 states and 209301 transitions. [2021-03-10 14:52:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 14:52:45,763 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-03-10 14:52:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:45,907 INFO L225 Difference]: With dead ends: 49465 [2021-03-10 14:52:45,907 INFO L226 Difference]: Without dead ends: 49159 [2021-03-10 14:52:45,908 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 472.3ms TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2021-03-10 14:52:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49159 states. [2021-03-10 14:52:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49159 to 40434. [2021-03-10 14:52:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40434 states, 40432 states have (on average 4.261649188761377) internal successors, (172307), 40433 states have internal predecessors, (172307), 0 states have call successors, (0), 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-03-10 14:52:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40434 states to 40434 states and 172307 transitions. [2021-03-10 14:52:47,127 INFO L78 Accepts]: Start accepts. Automaton has 40434 states and 172307 transitions. Word has length 51 [2021-03-10 14:52:47,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:47,128 INFO L480 AbstractCegarLoop]: Abstraction has 40434 states and 172307 transitions. [2021-03-10 14:52:47,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 40434 states and 172307 transitions. [2021-03-10 14:52:47,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-03-10 14:52:47,148 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:47,149 INFO L519 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] [2021-03-10 14:52:47,149 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-10 14:52:47,149 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:47,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:47,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1505714710, now seen corresponding path program 1 times [2021-03-10 14:52:47,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:47,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651705111] [2021-03-10 14:52:47,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:47,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651705111] [2021-03-10 14:52:47,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:47,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-03-10 14:52:47,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327275344] [2021-03-10 14:52:47,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 14:52:47,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:47,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 14:52:47,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-03-10 14:52:47,375 INFO L87 Difference]: Start difference. First operand 40434 states and 172307 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:49,048 INFO L93 Difference]: Finished difference Result 57289 states and 243534 transitions. [2021-03-10 14:52:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-03-10 14:52:49,048 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-03-10 14:52:49,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:49,224 INFO L225 Difference]: With dead ends: 57289 [2021-03-10 14:52:49,225 INFO L226 Difference]: Without dead ends: 56983 [2021-03-10 14:52:49,225 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 781.5ms TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2021-03-10 14:52:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56983 states. [2021-03-10 14:52:50,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56983 to 40428. [2021-03-10 14:52:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40428 states, 40426 states have (on average 4.262034334339287) internal successors, (172297), 40427 states have internal predecessors, (172297), 0 states have call successors, (0), 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-03-10 14:52:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40428 states to 40428 states and 172297 transitions. [2021-03-10 14:52:50,481 INFO L78 Accepts]: Start accepts. Automaton has 40428 states and 172297 transitions. Word has length 51 [2021-03-10 14:52:50,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:50,482 INFO L480 AbstractCegarLoop]: Abstraction has 40428 states and 172297 transitions. [2021-03-10 14:52:50,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 40428 states and 172297 transitions. [2021-03-10 14:52:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-03-10 14:52:50,500 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:50,500 INFO L519 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] [2021-03-10 14:52:50,500 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-10 14:52:50,500 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:50,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash -151253679, now seen corresponding path program 2 times [2021-03-10 14:52:50,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:50,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394079463] [2021-03-10 14:52:50,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:50,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394079463] [2021-03-10 14:52:50,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:50,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 14:52:50,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502078940] [2021-03-10 14:52:50,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 14:52:50,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:50,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 14:52:50,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-03-10 14:52:50,598 INFO L87 Difference]: Start difference. First operand 40428 states and 172297 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:51,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:51,610 INFO L93 Difference]: Finished difference Result 54695 states and 226695 transitions. [2021-03-10 14:52:51,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 14:52:51,610 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-03-10 14:52:51,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:51,764 INFO L225 Difference]: With dead ends: 54695 [2021-03-10 14:52:51,764 INFO L226 Difference]: Without dead ends: 49923 [2021-03-10 14:52:51,765 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 211.1ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-03-10 14:52:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49923 states. [2021-03-10 14:52:52,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49923 to 40137. [2021-03-10 14:52:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40137 states, 40135 states have (on average 4.265628503799676) internal successors, (171201), 40136 states have internal predecessors, (171201), 0 states have call successors, (0), 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-03-10 14:52:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40137 states to 40137 states and 171201 transitions. [2021-03-10 14:52:53,070 INFO L78 Accepts]: Start accepts. Automaton has 40137 states and 171201 transitions. Word has length 51 [2021-03-10 14:52:53,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:53,070 INFO L480 AbstractCegarLoop]: Abstraction has 40137 states and 171201 transitions. [2021-03-10 14:52:53,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 40137 states and 171201 transitions. [2021-03-10 14:52:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-03-10 14:52:53,088 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:53,088 INFO L519 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] [2021-03-10 14:52:53,088 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-10 14:52:53,088 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:53,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:53,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2029003256, now seen corresponding path program 2 times [2021-03-10 14:52:53,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:53,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992239458] [2021-03-10 14:52:53,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:53,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992239458] [2021-03-10 14:52:53,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:53,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-10 14:52:53,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581016345] [2021-03-10 14:52:53,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 14:52:53,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:53,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 14:52:53,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-03-10 14:52:53,425 INFO L87 Difference]: Start difference. First operand 40137 states and 171201 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:54,340 INFO L93 Difference]: Finished difference Result 52281 states and 221831 transitions. [2021-03-10 14:52:54,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-03-10 14:52:54,340 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-03-10 14:52:54,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:54,890 INFO L225 Difference]: With dead ends: 52281 [2021-03-10 14:52:54,890 INFO L226 Difference]: Without dead ends: 51975 [2021-03-10 14:52:54,891 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 564.6ms TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2021-03-10 14:52:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51975 states. [2021-03-10 14:52:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51975 to 37710. [2021-03-10 14:52:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37710 states, 37708 states have (on average 4.250875145857643) internal successors, (160292), 37709 states have internal predecessors, (160292), 0 states have call successors, (0), 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-03-10 14:52:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37710 states to 37710 states and 160292 transitions. [2021-03-10 14:52:55,825 INFO L78 Accepts]: Start accepts. Automaton has 37710 states and 160292 transitions. Word has length 51 [2021-03-10 14:52:55,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:55,825 INFO L480 AbstractCegarLoop]: Abstraction has 37710 states and 160292 transitions. [2021-03-10 14:52:55,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 37710 states and 160292 transitions. [2021-03-10 14:52:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-03-10 14:52:55,842 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:55,842 INFO L519 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] [2021-03-10 14:52:55,842 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-10 14:52:55,843 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:55,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:55,843 INFO L82 PathProgramCache]: Analyzing trace with hash -25477645, now seen corresponding path program 3 times [2021-03-10 14:52:55,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:55,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918780807] [2021-03-10 14:52:55,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:56,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:56,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918780807] [2021-03-10 14:52:56,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:56,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 14:52:56,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610087722] [2021-03-10 14:52:56,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 14:52:56,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:56,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 14:52:56,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-03-10 14:52:56,274 INFO L87 Difference]: Start difference. First operand 37710 states and 160292 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:56,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:56,829 INFO L93 Difference]: Finished difference Result 51735 states and 218583 transitions. [2021-03-10 14:52:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 14:52:56,829 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-03-10 14:52:56,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:56,976 INFO L225 Difference]: With dead ends: 51735 [2021-03-10 14:52:56,976 INFO L226 Difference]: Without dead ends: 51429 [2021-03-10 14:52:56,977 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 489.8ms TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-03-10 14:52:57,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51429 states. [2021-03-10 14:52:58,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51429 to 37552. [2021-03-10 14:52:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37552 states, 37550 states have (on average 4.257709720372836) internal successors, (159877), 37551 states have internal predecessors, (159877), 0 states have call successors, (0), 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-03-10 14:52:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37552 states to 37552 states and 159877 transitions. [2021-03-10 14:52:58,163 INFO L78 Accepts]: Start accepts. Automaton has 37552 states and 159877 transitions. Word has length 51 [2021-03-10 14:52:58,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:52:58,164 INFO L480 AbstractCegarLoop]: Abstraction has 37552 states and 159877 transitions. [2021-03-10 14:52:58,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 14:52:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 37552 states and 159877 transitions. [2021-03-10 14:52:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-03-10 14:52:58,196 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:52:58,196 INFO L519 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] [2021-03-10 14:52:58,196 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-10 14:52:58,196 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:52:58,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:52:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1544252542, now seen corresponding path program 1 times [2021-03-10 14:52:58,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:52:58,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951630282] [2021-03-10 14:52:58,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:52:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:52:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:52:58,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951630282] [2021-03-10 14:52:58,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:52:58,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-10 14:52:58,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736696845] [2021-03-10 14:52:58,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 14:52:58,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:52:58,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 14:52:58,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-03-10 14:52:58,420 INFO L87 Difference]: Start difference. First operand 37552 states and 159877 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-10 14:52:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:52:59,245 INFO L93 Difference]: Finished difference Result 45869 states and 194423 transitions. [2021-03-10 14:52:59,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 14:52:59,246 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-03-10 14:52:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:52:59,737 INFO L225 Difference]: With dead ends: 45869 [2021-03-10 14:52:59,738 INFO L226 Difference]: Without dead ends: 45563 [2021-03-10 14:52:59,738 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 465.6ms TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2021-03-10 14:52:59,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45563 states. [2021-03-10 14:53:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45563 to 37212. [2021-03-10 14:53:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37212 states, 37210 states have (on average 4.253292125772642) internal successors, (158265), 37211 states have internal predecessors, (158265), 0 states have call successors, (0), 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-03-10 14:53:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37212 states to 37212 states and 158265 transitions. [2021-03-10 14:53:00,570 INFO L78 Accepts]: Start accepts. Automaton has 37212 states and 158265 transitions. Word has length 53 [2021-03-10 14:53:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:00,570 INFO L480 AbstractCegarLoop]: Abstraction has 37212 states and 158265 transitions. [2021-03-10 14:53:00,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-10 14:53:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 37212 states and 158265 transitions. [2021-03-10 14:53:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-03-10 14:53:00,595 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:00,595 INFO L519 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] [2021-03-10 14:53:00,595 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-10 14:53:00,595 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:00,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:00,596 INFO L82 PathProgramCache]: Analyzing trace with hash 735522932, now seen corresponding path program 2 times [2021-03-10 14:53:00,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:00,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81679901] [2021-03-10 14:53:00,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:01,105 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2021-03-10 14:53:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:01,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81679901] [2021-03-10 14:53:01,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:01,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-03-10 14:53:01,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395086903] [2021-03-10 14:53:01,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 14:53:01,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:01,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 14:53:01,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-03-10 14:53:01,317 INFO L87 Difference]: Start difference. First operand 37212 states and 158265 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-10 14:53:02,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:02,112 INFO L93 Difference]: Finished difference Result 42608 states and 179111 transitions. [2021-03-10 14:53:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 14:53:02,112 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-03-10 14:53:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:02,223 INFO L225 Difference]: With dead ends: 42608 [2021-03-10 14:53:02,223 INFO L226 Difference]: Without dead ends: 42302 [2021-03-10 14:53:02,223 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 892.2ms TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2021-03-10 14:53:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42302 states. [2021-03-10 14:53:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42302 to 34165. [2021-03-10 14:53:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34165 states, 34163 states have (on average 4.2155841114656205) internal successors, (144017), 34164 states have internal predecessors, (144017), 0 states have call successors, (0), 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-03-10 14:53:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34165 states to 34165 states and 144017 transitions. [2021-03-10 14:53:03,241 INFO L78 Accepts]: Start accepts. Automaton has 34165 states and 144017 transitions. Word has length 53 [2021-03-10 14:53:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:03,241 INFO L480 AbstractCegarLoop]: Abstraction has 34165 states and 144017 transitions. [2021-03-10 14:53:03,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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-03-10 14:53:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 34165 states and 144017 transitions. [2021-03-10 14:53:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-03-10 14:53:03,265 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:03,265 INFO L519 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-03-10 14:53:03,265 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-10 14:53:03,265 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:03,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:03,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1437869286, now seen corresponding path program 1 times [2021-03-10 14:53:03,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:03,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421048528] [2021-03-10 14:53:03,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:03,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421048528] [2021-03-10 14:53:03,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:03,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-10 14:53:03,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33981665] [2021-03-10 14:53:03,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-10 14:53:03,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:03,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-10 14:53:03,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-10 14:53:03,322 INFO L87 Difference]: Start difference. First operand 34165 states and 144017 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-03-10 14:53:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:03,767 INFO L93 Difference]: Finished difference Result 38885 states and 161863 transitions. [2021-03-10 14:53:03,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 14:53:03,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-03-10 14:53:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:03,868 INFO L225 Difference]: With dead ends: 38885 [2021-03-10 14:53:03,869 INFO L226 Difference]: Without dead ends: 38051 [2021-03-10 14:53:03,869 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 82.0ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-03-10 14:53:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38051 states. [2021-03-10 14:53:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38051 to 36233. [2021-03-10 14:53:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36233 states, 36231 states have (on average 4.20648063812757) internal successors, (152405), 36232 states have internal predecessors, (152405), 0 states have call successors, (0), 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-03-10 14:53:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36233 states to 36233 states and 152405 transitions. [2021-03-10 14:53:04,926 INFO L78 Accepts]: Start accepts. Automaton has 36233 states and 152405 transitions. Word has length 54 [2021-03-10 14:53:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:04,927 INFO L480 AbstractCegarLoop]: Abstraction has 36233 states and 152405 transitions. [2021-03-10 14:53:04,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 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-03-10 14:53:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 36233 states and 152405 transitions. [2021-03-10 14:53:04,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-03-10 14:53:04,952 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:04,952 INFO L519 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-03-10 14:53:04,952 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-10 14:53:04,952 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:04,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:04,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1118414621, now seen corresponding path program 1 times [2021-03-10 14:53:04,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:04,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473361095] [2021-03-10 14:53:04,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:05,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473361095] [2021-03-10 14:53:05,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:05,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-03-10 14:53:05,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564495356] [2021-03-10 14:53:05,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 14:53:05,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:05,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 14:53:05,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-03-10 14:53:05,387 INFO L87 Difference]: Start difference. First operand 36233 states and 152405 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 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-03-10 14:53:06,076 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2021-03-10 14:53:06,661 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2021-03-10 14:53:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:07,746 INFO L93 Difference]: Finished difference Result 39493 states and 163860 transitions. [2021-03-10 14:53:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-03-10 14:53:07,746 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 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-03-10 14:53:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:07,847 INFO L225 Difference]: With dead ends: 39493 [2021-03-10 14:53:07,847 INFO L226 Difference]: Without dead ends: 38755 [2021-03-10 14:53:07,848 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 2049.7ms TimeCoverageRelationStatistics Valid=369, Invalid=1271, Unknown=0, NotChecked=0, Total=1640 [2021-03-10 14:53:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38755 states. [2021-03-10 14:53:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38755 to 31287. [2021-03-10 14:53:08,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31287 states, 31285 states have (on average 4.18264343934793) internal successors, (130854), 31286 states have internal predecessors, (130854), 0 states have call successors, (0), 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-03-10 14:53:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31287 states to 31287 states and 130854 transitions. [2021-03-10 14:53:08,805 INFO L78 Accepts]: Start accepts. Automaton has 31287 states and 130854 transitions. Word has length 54 [2021-03-10 14:53:08,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:08,805 INFO L480 AbstractCegarLoop]: Abstraction has 31287 states and 130854 transitions. [2021-03-10 14:53:08,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 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-03-10 14:53:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 31287 states and 130854 transitions. [2021-03-10 14:53:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-03-10 14:53:08,829 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:08,829 INFO L519 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-03-10 14:53:08,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-10 14:53:08,829 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:08,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:08,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1036650710, now seen corresponding path program 2 times [2021-03-10 14:53:08,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:08,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918831205] [2021-03-10 14:53:08,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:09,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-03-10 14:53:09,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918831205] [2021-03-10 14:53:09,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:09,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-03-10 14:53:09,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618862939] [2021-03-10 14:53:09,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 14:53:09,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:09,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 14:53:09,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-03-10 14:53:09,168 INFO L87 Difference]: Start difference. First operand 31287 states and 130854 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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-03-10 14:53:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:09,981 INFO L93 Difference]: Finished difference Result 35916 states and 148477 transitions. [2021-03-10 14:53:09,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 14:53:09,982 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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-03-10 14:53:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:10,072 INFO L225 Difference]: With dead ends: 35916 [2021-03-10 14:53:10,072 INFO L226 Difference]: Without dead ends: 35127 [2021-03-10 14:53:10,072 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 508.2ms TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2021-03-10 14:53:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35127 states. [2021-03-10 14:53:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35127 to 31107. [2021-03-10 14:53:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31107 states, 31105 states have (on average 4.178106413759846) internal successors, (129960), 31106 states have internal predecessors, (129960), 0 states have call successors, (0), 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-03-10 14:53:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31107 states to 31107 states and 129960 transitions. [2021-03-10 14:53:11,097 INFO L78 Accepts]: Start accepts. Automaton has 31107 states and 129960 transitions. Word has length 54 [2021-03-10 14:53:11,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:11,098 INFO L480 AbstractCegarLoop]: Abstraction has 31107 states and 129960 transitions. [2021-03-10 14:53:11,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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-03-10 14:53:11,098 INFO L276 IsEmpty]: Start isEmpty. Operand 31107 states and 129960 transitions. [2021-03-10 14:53:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-03-10 14:53:11,122 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:11,122 INFO L519 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-03-10 14:53:11,122 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-10 14:53:11,122 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:11,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:11,123 INFO L82 PathProgramCache]: Analyzing trace with hash 161468892, now seen corresponding path program 3 times [2021-03-10 14:53:11,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:11,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130298146] [2021-03-10 14:53:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:11,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130298146] [2021-03-10 14:53:11,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:11,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-10 14:53:11,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611824082] [2021-03-10 14:53:11,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 14:53:11,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:11,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 14:53:11,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-03-10 14:53:11,286 INFO L87 Difference]: Start difference. First operand 31107 states and 129960 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 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-03-10 14:53:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:12,333 INFO L93 Difference]: Finished difference Result 40604 states and 166238 transitions. [2021-03-10 14:53:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-03-10 14:53:12,334 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 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-03-10 14:53:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:12,472 INFO L225 Difference]: With dead ends: 40604 [2021-03-10 14:53:12,472 INFO L226 Difference]: Without dead ends: 39770 [2021-03-10 14:53:12,473 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 335.4ms TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2021-03-10 14:53:12,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39770 states. [2021-03-10 14:53:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39770 to 30436. [2021-03-10 14:53:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30436 states, 30434 states have (on average 4.1693829269895515) internal successors, (126891), 30435 states have internal predecessors, (126891), 0 states have call successors, (0), 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-03-10 14:53:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30436 states to 30436 states and 126891 transitions. [2021-03-10 14:53:13,157 INFO L78 Accepts]: Start accepts. Automaton has 30436 states and 126891 transitions. Word has length 54 [2021-03-10 14:53:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:13,157 INFO L480 AbstractCegarLoop]: Abstraction has 30436 states and 126891 transitions. [2021-03-10 14:53:13,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 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-03-10 14:53:13,157 INFO L276 IsEmpty]: Start isEmpty. Operand 30436 states and 126891 transitions. [2021-03-10 14:53:13,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-03-10 14:53:13,180 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:13,180 INFO L519 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-03-10 14:53:13,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-10 14:53:13,180 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1751553278, now seen corresponding path program 1 times [2021-03-10 14:53:13,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:13,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104834295] [2021-03-10 14:53:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:13,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104834295] [2021-03-10 14:53:13,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:13,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 14:53:13,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112128190] [2021-03-10 14:53:13,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 14:53:13,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:13,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 14:53:13,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-03-10 14:53:13,244 INFO L87 Difference]: Start difference. First operand 30436 states and 126891 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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-03-10 14:53:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:14,150 INFO L93 Difference]: Finished difference Result 47417 states and 191269 transitions. [2021-03-10 14:53:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 14:53:14,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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-03-10 14:53:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:14,244 INFO L225 Difference]: With dead ends: 47417 [2021-03-10 14:53:14,244 INFO L226 Difference]: Without dead ends: 35565 [2021-03-10 14:53:14,245 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 139.4ms TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-03-10 14:53:14,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35565 states. [2021-03-10 14:53:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35565 to 27821. [2021-03-10 14:53:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27821 states, 27819 states have (on average 4.13918544879399) internal successors, (115148), 27820 states have internal predecessors, (115148), 0 states have call successors, (0), 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-03-10 14:53:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27821 states to 27821 states and 115148 transitions. [2021-03-10 14:53:14,869 INFO L78 Accepts]: Start accepts. Automaton has 27821 states and 115148 transitions. Word has length 54 [2021-03-10 14:53:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:14,869 INFO L480 AbstractCegarLoop]: Abstraction has 27821 states and 115148 transitions. [2021-03-10 14:53:14,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 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-03-10 14:53:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 27821 states and 115148 transitions. [2021-03-10 14:53:14,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-03-10 14:53:14,887 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:14,887 INFO L519 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-03-10 14:53:14,887 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-10 14:53:14,887 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:14,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:14,888 INFO L82 PathProgramCache]: Analyzing trace with hash 342901692, now seen corresponding path program 1 times [2021-03-10 14:53:14,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:14,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422475271] [2021-03-10 14:53:14,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:14,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422475271] [2021-03-10 14:53:14,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:14,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 14:53:14,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139800909] [2021-03-10 14:53:14,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 14:53:14,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:14,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 14:53:14,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-03-10 14:53:14,991 INFO L87 Difference]: Start difference. First operand 27821 states and 115148 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 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-03-10 14:53:15,493 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-03-10 14:53:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:15,822 INFO L93 Difference]: Finished difference Result 39569 states and 159562 transitions. [2021-03-10 14:53:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 14:53:15,822 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 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-03-10 14:53:15,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:15,937 INFO L225 Difference]: With dead ends: 39569 [2021-03-10 14:53:15,937 INFO L226 Difference]: Without dead ends: 34345 [2021-03-10 14:53:15,938 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 477.0ms TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2021-03-10 14:53:16,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34345 states. [2021-03-10 14:53:16,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34345 to 27827. [2021-03-10 14:53:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27827 states, 27825 states have (on average 4.139442946990116) internal successors, (115180), 27826 states have internal predecessors, (115180), 0 states have call successors, (0), 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-03-10 14:53:16,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27827 states to 27827 states and 115180 transitions. [2021-03-10 14:53:16,598 INFO L78 Accepts]: Start accepts. Automaton has 27827 states and 115180 transitions. Word has length 54 [2021-03-10 14:53:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:16,598 INFO L480 AbstractCegarLoop]: Abstraction has 27827 states and 115180 transitions. [2021-03-10 14:53:16,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 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-03-10 14:53:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 27827 states and 115180 transitions. [2021-03-10 14:53:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-03-10 14:53:16,616 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:16,616 INFO L519 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-03-10 14:53:16,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-10 14:53:16,616 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:16,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:16,617 INFO L82 PathProgramCache]: Analyzing trace with hash -505554466, now seen corresponding path program 2 times [2021-03-10 14:53:16,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:16,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275697734] [2021-03-10 14:53:16,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:16,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275697734] [2021-03-10 14:53:16,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:16,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-10 14:53:16,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403265856] [2021-03-10 14:53:16,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 14:53:16,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:16,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 14:53:16,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-03-10 14:53:16,746 INFO L87 Difference]: Start difference. First operand 27827 states and 115180 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 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-03-10 14:53:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:17,784 INFO L93 Difference]: Finished difference Result 36531 states and 147402 transitions. [2021-03-10 14:53:17,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 14:53:17,784 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 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-03-10 14:53:17,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:17,865 INFO L225 Difference]: With dead ends: 36531 [2021-03-10 14:53:17,865 INFO L226 Difference]: Without dead ends: 32267 [2021-03-10 14:53:17,865 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 346.3ms TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2021-03-10 14:53:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32267 states. [2021-03-10 14:53:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32267 to 26073. [2021-03-10 14:53:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26073 states, 26071 states have (on average 4.132484369606075) internal successors, (107738), 26072 states have internal predecessors, (107738), 0 states have call successors, (0), 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-03-10 14:53:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26073 states to 26073 states and 107738 transitions. [2021-03-10 14:53:18,446 INFO L78 Accepts]: Start accepts. Automaton has 26073 states and 107738 transitions. Word has length 54 [2021-03-10 14:53:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:18,446 INFO L480 AbstractCegarLoop]: Abstraction has 26073 states and 107738 transitions. [2021-03-10 14:53:18,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 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-03-10 14:53:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 26073 states and 107738 transitions. [2021-03-10 14:53:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-03-10 14:53:18,469 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:18,470 INFO L519 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] [2021-03-10 14:53:18,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-10 14:53:18,470 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:18,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1045043691, now seen corresponding path program 1 times [2021-03-10 14:53:18,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:18,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238892074] [2021-03-10 14:53:18,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:18,906 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-03-10 14:53:19,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:19,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238892074] [2021-03-10 14:53:19,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:19,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-03-10 14:53:19,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413869816] [2021-03-10 14:53:19,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 14:53:19,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:19,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 14:53:19,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-03-10 14:53:19,069 INFO L87 Difference]: Start difference. First operand 26073 states and 107738 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-10 14:53:20,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:20,972 INFO L93 Difference]: Finished difference Result 32925 states and 135274 transitions. [2021-03-10 14:53:20,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-03-10 14:53:20,973 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2021-03-10 14:53:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:21,056 INFO L225 Difference]: With dead ends: 32925 [2021-03-10 14:53:21,056 INFO L226 Difference]: Without dead ends: 31935 [2021-03-10 14:53:21,057 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1739.6ms TimeCoverageRelationStatistics Valid=396, Invalid=1326, Unknown=0, NotChecked=0, Total=1722 [2021-03-10 14:53:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31935 states. [2021-03-10 14:53:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31935 to 25312. [2021-03-10 14:53:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25312 states, 25310 states have (on average 4.174318451205057) internal successors, (105652), 25311 states have internal predecessors, (105652), 0 states have call successors, (0), 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-03-10 14:53:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25312 states to 25312 states and 105652 transitions. [2021-03-10 14:53:21,757 INFO L78 Accepts]: Start accepts. Automaton has 25312 states and 105652 transitions. Word has length 56 [2021-03-10 14:53:21,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:21,757 INFO L480 AbstractCegarLoop]: Abstraction has 25312 states and 105652 transitions. [2021-03-10 14:53:21,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-10 14:53:21,758 INFO L276 IsEmpty]: Start isEmpty. Operand 25312 states and 105652 transitions. [2021-03-10 14:53:21,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-03-10 14:53:21,781 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:21,781 INFO L519 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] [2021-03-10 14:53:21,781 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-10 14:53:21,781 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:21,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:21,782 INFO L82 PathProgramCache]: Analyzing trace with hash 629509943, now seen corresponding path program 1 times [2021-03-10 14:53:21,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:21,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742659239] [2021-03-10 14:53:21,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:22,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742659239] [2021-03-10 14:53:22,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:22,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-03-10 14:53:22,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77896650] [2021-03-10 14:53:22,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 14:53:22,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:22,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 14:53:22,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-03-10 14:53:22,039 INFO L87 Difference]: Start difference. First operand 25312 states and 105652 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-10 14:53:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:22,802 INFO L93 Difference]: Finished difference Result 31366 states and 129292 transitions. [2021-03-10 14:53:22,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 14:53:22,803 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2021-03-10 14:53:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:22,879 INFO L225 Difference]: With dead ends: 31366 [2021-03-10 14:53:22,879 INFO L226 Difference]: Without dead ends: 30817 [2021-03-10 14:53:22,879 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 489.6ms TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2021-03-10 14:53:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30817 states. [2021-03-10 14:53:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30817 to 25256. [2021-03-10 14:53:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25256 states, 25254 states have (on average 4.174546606478182) internal successors, (105424), 25255 states have internal predecessors, (105424), 0 states have call successors, (0), 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-03-10 14:53:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25256 states to 25256 states and 105424 transitions. [2021-03-10 14:53:23,643 INFO L78 Accepts]: Start accepts. Automaton has 25256 states and 105424 transitions. Word has length 56 [2021-03-10 14:53:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:23,643 INFO L480 AbstractCegarLoop]: Abstraction has 25256 states and 105424 transitions. [2021-03-10 14:53:23,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-10 14:53:23,643 INFO L276 IsEmpty]: Start isEmpty. Operand 25256 states and 105424 transitions. [2021-03-10 14:53:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-03-10 14:53:23,667 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:23,667 INFO L519 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] [2021-03-10 14:53:23,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-10 14:53:23,667 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:23,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:23,667 INFO L82 PathProgramCache]: Analyzing trace with hash -179219667, now seen corresponding path program 2 times [2021-03-10 14:53:23,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:23,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33338008] [2021-03-10 14:53:23,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:24,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33338008] [2021-03-10 14:53:24,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:24,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-03-10 14:53:24,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259346936] [2021-03-10 14:53:24,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 14:53:24,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:24,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 14:53:24,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-03-10 14:53:24,057 INFO L87 Difference]: Start difference. First operand 25256 states and 105424 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-10 14:53:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:25,735 INFO L93 Difference]: Finished difference Result 26055 states and 106079 transitions. [2021-03-10 14:53:25,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-03-10 14:53:25,736 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2021-03-10 14:53:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:25,793 INFO L225 Difference]: With dead ends: 26055 [2021-03-10 14:53:25,793 INFO L226 Difference]: Without dead ends: 24174 [2021-03-10 14:53:25,793 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1208.6ms TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2021-03-10 14:53:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24174 states. [2021-03-10 14:53:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24174 to 17424. [2021-03-10 14:53:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17424 states, 17422 states have (on average 4.059178050740443) internal successors, (70719), 17423 states have internal predecessors, (70719), 0 states have call successors, (0), 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-03-10 14:53:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17424 states to 17424 states and 70719 transitions. [2021-03-10 14:53:26,166 INFO L78 Accepts]: Start accepts. Automaton has 17424 states and 70719 transitions. Word has length 56 [2021-03-10 14:53:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:26,166 INFO L480 AbstractCegarLoop]: Abstraction has 17424 states and 70719 transitions. [2021-03-10 14:53:26,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-10 14:53:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 17424 states and 70719 transitions. [2021-03-10 14:53:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-03-10 14:53:26,182 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:26,182 INFO L519 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] [2021-03-10 14:53:26,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-03-10 14:53:26,182 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:26,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:26,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1977303013, now seen corresponding path program 1 times [2021-03-10 14:53:26,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:26,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914204967] [2021-03-10 14:53:26,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:26,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914204967] [2021-03-10 14:53:26,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:26,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-03-10 14:53:26,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011791318] [2021-03-10 14:53:26,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-10 14:53:26,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:26,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-10 14:53:26,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-03-10 14:53:26,513 INFO L87 Difference]: Start difference. First operand 17424 states and 70719 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-10 14:53:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:27,470 INFO L93 Difference]: Finished difference Result 25985 states and 104210 transitions. [2021-03-10 14:53:27,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-03-10 14:53:27,470 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2021-03-10 14:53:27,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:27,533 INFO L225 Difference]: With dead ends: 25985 [2021-03-10 14:53:27,534 INFO L226 Difference]: Without dead ends: 25616 [2021-03-10 14:53:27,534 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 652.2ms TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2021-03-10 14:53:27,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25616 states. [2021-03-10 14:53:27,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25616 to 17115. [2021-03-10 14:53:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17115 states, 17113 states have (on average 4.073452930520657) internal successors, (69709), 17114 states have internal predecessors, (69709), 0 states have call successors, (0), 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-03-10 14:53:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17115 states to 17115 states and 69709 transitions. [2021-03-10 14:53:27,911 INFO L78 Accepts]: Start accepts. Automaton has 17115 states and 69709 transitions. Word has length 56 [2021-03-10 14:53:27,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:27,911 INFO L480 AbstractCegarLoop]: Abstraction has 17115 states and 69709 transitions. [2021-03-10 14:53:27,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-10 14:53:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 17115 states and 69709 transitions. [2021-03-10 14:53:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-03-10 14:53:27,927 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:27,927 INFO L519 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] [2021-03-10 14:53:27,927 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-03-10 14:53:27,927 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:27,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:27,927 INFO L82 PathProgramCache]: Analyzing trace with hash -84330126, now seen corresponding path program 1 times [2021-03-10 14:53:27,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:27,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919554065] [2021-03-10 14:53:27,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:27,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:27,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919554065] [2021-03-10 14:53:27,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:27,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-10 14:53:27,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658703755] [2021-03-10 14:53:27,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-10 14:53:27,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:27,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-10 14:53:27,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-10 14:53:27,980 INFO L87 Difference]: Start difference. First operand 17115 states and 69709 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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-03-10 14:53:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:28,236 INFO L93 Difference]: Finished difference Result 20107 states and 80008 transitions. [2021-03-10 14:53:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 14:53:28,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-03-10 14:53:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:28,278 INFO L225 Difference]: With dead ends: 20107 [2021-03-10 14:53:28,279 INFO L226 Difference]: Without dead ends: 19387 [2021-03-10 14:53:28,279 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 77.1ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-03-10 14:53:28,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19387 states. [2021-03-10 14:53:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19387 to 18967. [2021-03-10 14:53:28,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18967 states, 18965 states have (on average 4.029053519641445) internal successors, (76411), 18966 states have internal predecessors, (76411), 0 states have call successors, (0), 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-03-10 14:53:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18967 states to 18967 states and 76411 transitions. [2021-03-10 14:53:28,740 INFO L78 Accepts]: Start accepts. Automaton has 18967 states and 76411 transitions. Word has length 57 [2021-03-10 14:53:28,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:28,740 INFO L480 AbstractCegarLoop]: Abstraction has 18967 states and 76411 transitions. [2021-03-10 14:53:28,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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-03-10 14:53:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 18967 states and 76411 transitions. [2021-03-10 14:53:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-03-10 14:53:28,758 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:28,758 INFO L519 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] [2021-03-10 14:53:28,758 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-03-10 14:53:28,759 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:28,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:28,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1752728816, now seen corresponding path program 2 times [2021-03-10 14:53:28,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:28,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667574281] [2021-03-10 14:53:28,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:29,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667574281] [2021-03-10 14:53:29,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:29,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-03-10 14:53:29,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671990371] [2021-03-10 14:53:29,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 14:53:29,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:29,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 14:53:29,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-03-10 14:53:29,151 INFO L87 Difference]: Start difference. First operand 18967 states and 76411 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 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-03-10 14:53:30,935 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2021-03-10 14:53:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:30,988 INFO L93 Difference]: Finished difference Result 24595 states and 97604 transitions. [2021-03-10 14:53:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-03-10 14:53:30,989 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-03-10 14:53:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:31,044 INFO L225 Difference]: With dead ends: 24595 [2021-03-10 14:53:31,044 INFO L226 Difference]: Without dead ends: 22435 [2021-03-10 14:53:31,044 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1550.7ms TimeCoverageRelationStatistics Valid=404, Invalid=1318, Unknown=0, NotChecked=0, Total=1722 [2021-03-10 14:53:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22435 states. [2021-03-10 14:53:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22435 to 18295. [2021-03-10 14:53:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18295 states, 18293 states have (on average 4.02793418247417) internal successors, (73683), 18294 states have internal predecessors, (73683), 0 states have call successors, (0), 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-03-10 14:53:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18295 states to 18295 states and 73683 transitions. [2021-03-10 14:53:31,425 INFO L78 Accepts]: Start accepts. Automaton has 18295 states and 73683 transitions. Word has length 57 [2021-03-10 14:53:31,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:31,425 INFO L480 AbstractCegarLoop]: Abstraction has 18295 states and 73683 transitions. [2021-03-10 14:53:31,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 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-03-10 14:53:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 18295 states and 73683 transitions. [2021-03-10 14:53:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-03-10 14:53:31,443 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:31,443 INFO L519 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] [2021-03-10 14:53:31,443 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-03-10 14:53:31,443 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:31,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:31,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1610836384, now seen corresponding path program 3 times [2021-03-10 14:53:31,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:31,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15954878] [2021-03-10 14:53:31,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:31,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15954878] [2021-03-10 14:53:31,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:31,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-03-10 14:53:31,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618129816] [2021-03-10 14:53:31,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-10 14:53:31,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:31,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-10 14:53:31,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-03-10 14:53:31,628 INFO L87 Difference]: Start difference. First operand 18295 states and 73683 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 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-03-10 14:53:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:32,297 INFO L93 Difference]: Finished difference Result 24232 states and 94272 transitions. [2021-03-10 14:53:32,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-03-10 14:53:32,298 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-03-10 14:53:32,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:32,352 INFO L225 Difference]: With dead ends: 24232 [2021-03-10 14:53:32,352 INFO L226 Difference]: Without dead ends: 23512 [2021-03-10 14:53:32,352 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 365.1ms TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2021-03-10 14:53:32,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23512 states. [2021-03-10 14:53:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23512 to 17556. [2021-03-10 14:53:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17556 states, 17554 states have (on average 4.029395009684403) internal successors, (70732), 17555 states have internal predecessors, (70732), 0 states have call successors, (0), 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-03-10 14:53:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17556 states to 17556 states and 70732 transitions. [2021-03-10 14:53:32,835 INFO L78 Accepts]: Start accepts. Automaton has 17556 states and 70732 transitions. Word has length 57 [2021-03-10 14:53:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:32,836 INFO L480 AbstractCegarLoop]: Abstraction has 17556 states and 70732 transitions. [2021-03-10 14:53:32,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 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-03-10 14:53:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 17556 states and 70732 transitions. [2021-03-10 14:53:32,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-03-10 14:53:32,853 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:32,854 INFO L519 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] [2021-03-10 14:53:32,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-03-10 14:53:32,854 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:32,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:32,854 INFO L82 PathProgramCache]: Analyzing trace with hash 192157498, now seen corresponding path program 1 times [2021-03-10 14:53:32,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:32,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808866969] [2021-03-10 14:53:32,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:33,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808866969] [2021-03-10 14:53:33,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:33,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-03-10 14:53:33,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001457781] [2021-03-10 14:53:33,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 14:53:33,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:33,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 14:53:33,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-03-10 14:53:33,224 INFO L87 Difference]: Start difference. First operand 17556 states and 70732 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 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-03-10 14:53:34,788 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2021-03-10 14:53:35,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:35,099 INFO L93 Difference]: Finished difference Result 19776 states and 78160 transitions. [2021-03-10 14:53:35,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-03-10 14:53:35,099 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2021-03-10 14:53:35,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:35,145 INFO L225 Difference]: With dead ends: 19776 [2021-03-10 14:53:35,145 INFO L226 Difference]: Without dead ends: 19461 [2021-03-10 14:53:35,145 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1690.9ms TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2021-03-10 14:53:35,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19461 states. [2021-03-10 14:53:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19461 to 13407. [2021-03-10 14:53:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13407 states, 13405 states have (on average 4.007012308839985) internal successors, (53714), 13406 states have internal predecessors, (53714), 0 states have call successors, (0), 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-03-10 14:53:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13407 states to 13407 states and 53714 transitions. [2021-03-10 14:53:35,424 INFO L78 Accepts]: Start accepts. Automaton has 13407 states and 53714 transitions. Word has length 58 [2021-03-10 14:53:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:35,424 INFO L480 AbstractCegarLoop]: Abstraction has 13407 states and 53714 transitions. [2021-03-10 14:53:35,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 0 states have call successors, (0), 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-03-10 14:53:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 13407 states and 53714 transitions. [2021-03-10 14:53:35,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-03-10 14:53:35,440 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:35,440 INFO L519 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-03-10 14:53:35,440 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-03-10 14:53:35,440 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:35,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1126503497, now seen corresponding path program 1 times [2021-03-10 14:53:35,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:35,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594109044] [2021-03-10 14:53:35,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:35,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594109044] [2021-03-10 14:53:35,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:35,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-03-10 14:53:35,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296586854] [2021-03-10 14:53:35,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 14:53:35,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:35,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 14:53:35,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-03-10 14:53:35,755 INFO L87 Difference]: Start difference. First operand 13407 states and 53714 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 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-03-10 14:53:36,814 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-03-10 14:53:37,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:37,019 INFO L93 Difference]: Finished difference Result 21219 states and 82407 transitions. [2021-03-10 14:53:37,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-03-10 14:53:37,019 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 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-03-10 14:53:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:37,063 INFO L225 Difference]: With dead ends: 21219 [2021-03-10 14:53:37,063 INFO L226 Difference]: Without dead ends: 20643 [2021-03-10 14:53:37,064 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1109.5ms TimeCoverageRelationStatistics Valid=419, Invalid=1303, Unknown=0, NotChecked=0, Total=1722 [2021-03-10 14:53:37,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20643 states. [2021-03-10 14:53:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20643 to 13491. [2021-03-10 14:53:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13491 states, 13489 states have (on average 4.007116910074876) internal successors, (54052), 13490 states have internal predecessors, (54052), 0 states have call successors, (0), 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-03-10 14:53:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13491 states to 13491 states and 54052 transitions. [2021-03-10 14:53:37,319 INFO L78 Accepts]: Start accepts. Automaton has 13491 states and 54052 transitions. Word has length 59 [2021-03-10 14:53:37,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:37,319 INFO L480 AbstractCegarLoop]: Abstraction has 13491 states and 54052 transitions. [2021-03-10 14:53:37,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 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-03-10 14:53:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 13491 states and 54052 transitions. [2021-03-10 14:53:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-03-10 14:53:37,335 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:37,335 INFO L519 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-03-10 14:53:37,335 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-03-10 14:53:37,335 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:37,335 INFO L82 PathProgramCache]: Analyzing trace with hash 232200031, now seen corresponding path program 2 times [2021-03-10 14:53:37,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:37,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978013941] [2021-03-10 14:53:37,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:37,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978013941] [2021-03-10 14:53:37,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:37,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-03-10 14:53:37,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629447890] [2021-03-10 14:53:37,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-10 14:53:37,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:37,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-10 14:53:37,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-03-10 14:53:37,711 INFO L87 Difference]: Start difference. First operand 13491 states and 54052 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 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-03-10 14:53:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:39,512 INFO L93 Difference]: Finished difference Result 20907 states and 80054 transitions. [2021-03-10 14:53:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-03-10 14:53:39,512 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 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-03-10 14:53:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:39,559 INFO L225 Difference]: With dead ends: 20907 [2021-03-10 14:53:39,560 INFO L226 Difference]: Without dead ends: 20331 [2021-03-10 14:53:39,560 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1472.2ms TimeCoverageRelationStatistics Valid=649, Invalid=2321, Unknown=0, NotChecked=0, Total=2970 [2021-03-10 14:53:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20331 states. [2021-03-10 14:53:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20331 to 13380. [2021-03-10 14:53:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13380 states, 13378 states have (on average 4.017341904619524) internal successors, (53744), 13379 states have internal predecessors, (53744), 0 states have call successors, (0), 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-03-10 14:53:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13380 states to 13380 states and 53744 transitions. [2021-03-10 14:53:39,841 INFO L78 Accepts]: Start accepts. Automaton has 13380 states and 53744 transitions. Word has length 59 [2021-03-10 14:53:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:39,841 INFO L480 AbstractCegarLoop]: Abstraction has 13380 states and 53744 transitions. [2021-03-10 14:53:39,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 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-03-10 14:53:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 13380 states and 53744 transitions. [2021-03-10 14:53:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-03-10 14:53:39,857 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:39,858 INFO L519 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-03-10 14:53:39,858 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-03-10 14:53:39,858 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:39,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:39,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1640125077, now seen corresponding path program 3 times [2021-03-10 14:53:39,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:39,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006194301] [2021-03-10 14:53:39,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:40,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006194301] [2021-03-10 14:53:40,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:40,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-03-10 14:53:40,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955472359] [2021-03-10 14:53:40,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 14:53:40,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:40,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 14:53:40,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-03-10 14:53:40,183 INFO L87 Difference]: Start difference. First operand 13380 states and 53744 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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-03-10 14:53:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:41,160 INFO L93 Difference]: Finished difference Result 17568 states and 68661 transitions. [2021-03-10 14:53:41,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-03-10 14:53:41,160 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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-03-10 14:53:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:41,201 INFO L225 Difference]: With dead ends: 17568 [2021-03-10 14:53:41,201 INFO L226 Difference]: Without dead ends: 16992 [2021-03-10 14:53:41,201 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 792.8ms TimeCoverageRelationStatistics Valid=320, Invalid=940, Unknown=0, NotChecked=0, Total=1260 [2021-03-10 14:53:41,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16992 states. [2021-03-10 14:53:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16992 to 12612. [2021-03-10 14:53:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12612 states, 12610 states have (on average 3.977795400475813) internal successors, (50160), 12611 states have internal predecessors, (50160), 0 states have call successors, (0), 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-03-10 14:53:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12612 states to 12612 states and 50160 transitions. [2021-03-10 14:53:41,448 INFO L78 Accepts]: Start accepts. Automaton has 12612 states and 50160 transitions. Word has length 59 [2021-03-10 14:53:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:41,448 INFO L480 AbstractCegarLoop]: Abstraction has 12612 states and 50160 transitions. [2021-03-10 14:53:41,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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-03-10 14:53:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 12612 states and 50160 transitions. [2021-03-10 14:53:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-03-10 14:53:41,462 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:41,462 INFO L519 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-03-10 14:53:41,462 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-03-10 14:53:41,462 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:41,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:41,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1760538753, now seen corresponding path program 4 times [2021-03-10 14:53:41,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:41,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142527798] [2021-03-10 14:53:41,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:41,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142527798] [2021-03-10 14:53:41,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:41,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-03-10 14:53:41,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715518564] [2021-03-10 14:53:41,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-10 14:53:41,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:41,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-10 14:53:41,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-03-10 14:53:41,731 INFO L87 Difference]: Start difference. First operand 12612 states and 50160 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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-03-10 14:53:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:42,997 INFO L93 Difference]: Finished difference Result 11232 states and 43701 transitions. [2021-03-10 14:53:42,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-03-10 14:53:42,997 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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-03-10 14:53:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:43,026 INFO L225 Difference]: With dead ends: 11232 [2021-03-10 14:53:43,027 INFO L226 Difference]: Without dead ends: 10656 [2021-03-10 14:53:43,027 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1076.2ms TimeCoverageRelationStatistics Valid=493, Invalid=1577, Unknown=0, NotChecked=0, Total=2070 [2021-03-10 14:53:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10656 states. [2021-03-10 14:53:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10656 to 6918. [2021-03-10 14:53:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6918 states, 6917 states have (on average 4.09411594621946) internal successors, (28319), 6917 states have internal predecessors, (28319), 0 states have call successors, (0), 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-03-10 14:53:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6918 states to 6918 states and 28319 transitions. [2021-03-10 14:53:43,254 INFO L78 Accepts]: Start accepts. Automaton has 6918 states and 28319 transitions. Word has length 59 [2021-03-10 14:53:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:43,254 INFO L480 AbstractCegarLoop]: Abstraction has 6918 states and 28319 transitions. [2021-03-10 14:53:43,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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-03-10 14:53:43,254 INFO L276 IsEmpty]: Start isEmpty. Operand 6918 states and 28319 transitions. [2021-03-10 14:53:43,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-03-10 14:53:43,265 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:43,265 INFO L519 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] [2021-03-10 14:53:43,266 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-03-10 14:53:43,266 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:43,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:43,266 INFO L82 PathProgramCache]: Analyzing trace with hash 863192789, now seen corresponding path program 1 times [2021-03-10 14:53:43,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:43,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132086264] [2021-03-10 14:53:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:43,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132086264] [2021-03-10 14:53:43,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:43,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 14:53:43,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189315320] [2021-03-10 14:53:43,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 14:53:43,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:43,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 14:53:43,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-03-10 14:53:43,406 INFO L87 Difference]: Start difference. First operand 6918 states and 28319 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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-03-10 14:53:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:43,686 INFO L93 Difference]: Finished difference Result 6918 states and 28253 transitions. [2021-03-10 14:53:43,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 14:53:43,687 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-03-10 14:53:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:43,703 INFO L225 Difference]: With dead ends: 6918 [2021-03-10 14:53:43,703 INFO L226 Difference]: Without dead ends: 6918 [2021-03-10 14:53:43,703 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 236.6ms TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-03-10 14:53:43,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6918 states. [2021-03-10 14:53:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6918 to 6918. [2021-03-10 14:53:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6918 states, 6917 states have (on average 4.08457423738615) internal successors, (28253), 6917 states have internal predecessors, (28253), 0 states have call successors, (0), 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-03-10 14:53:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6918 states to 6918 states and 28253 transitions. [2021-03-10 14:53:43,832 INFO L78 Accepts]: Start accepts. Automaton has 6918 states and 28253 transitions. Word has length 92 [2021-03-10 14:53:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:43,832 INFO L480 AbstractCegarLoop]: Abstraction has 6918 states and 28253 transitions. [2021-03-10 14:53:43,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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-03-10 14:53:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 6918 states and 28253 transitions. [2021-03-10 14:53:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-03-10 14:53:43,844 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:43,844 INFO L519 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] [2021-03-10 14:53:43,844 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-03-10 14:53:43,844 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:43,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:43,844 INFO L82 PathProgramCache]: Analyzing trace with hash -995161836, now seen corresponding path program 1 times [2021-03-10 14:53:43,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:43,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187273326] [2021-03-10 14:53:43,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:43,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187273326] [2021-03-10 14:53:43,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:43,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 14:53:43,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457051166] [2021-03-10 14:53:43,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 14:53:43,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:43,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 14:53:43,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-03-10 14:53:43,990 INFO L87 Difference]: Start difference. First operand 6918 states and 28253 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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-03-10 14:53:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:44,261 INFO L93 Difference]: Finished difference Result 6918 states and 28199 transitions. [2021-03-10 14:53:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 14:53:44,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-03-10 14:53:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:44,276 INFO L225 Difference]: With dead ends: 6918 [2021-03-10 14:53:44,276 INFO L226 Difference]: Without dead ends: 6747 [2021-03-10 14:53:44,277 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 250.2ms TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-03-10 14:53:44,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6747 states. [2021-03-10 14:53:44,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6747 to 6747. [2021-03-10 14:53:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6747 states, 6746 states have (on average 4.075155647791283) internal successors, (27491), 6746 states have internal predecessors, (27491), 0 states have call successors, (0), 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-03-10 14:53:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6747 states to 6747 states and 27491 transitions. [2021-03-10 14:53:44,393 INFO L78 Accepts]: Start accepts. Automaton has 6747 states and 27491 transitions. Word has length 92 [2021-03-10 14:53:44,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:44,393 INFO L480 AbstractCegarLoop]: Abstraction has 6747 states and 27491 transitions. [2021-03-10 14:53:44,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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-03-10 14:53:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 6747 states and 27491 transitions. [2021-03-10 14:53:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-03-10 14:53:44,404 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:44,404 INFO L519 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] [2021-03-10 14:53:44,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-03-10 14:53:44,404 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:44,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:44,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1083502577, now seen corresponding path program 1 times [2021-03-10 14:53:44,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:44,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837975042] [2021-03-10 14:53:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:44,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837975042] [2021-03-10 14:53:44,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:44,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-10 14:53:44,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685871396] [2021-03-10 14:53:44,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-10 14:53:44,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:44,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-10 14:53:44,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-10 14:53:44,477 INFO L87 Difference]: Start difference. First operand 6747 states and 27491 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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-03-10 14:53:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:44,636 INFO L93 Difference]: Finished difference Result 6747 states and 27485 transitions. [2021-03-10 14:53:44,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 14:53:44,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-03-10 14:53:44,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:44,650 INFO L225 Difference]: With dead ends: 6747 [2021-03-10 14:53:44,651 INFO L226 Difference]: Without dead ends: 6360 [2021-03-10 14:53:44,651 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 90.8ms TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-03-10 14:53:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6360 states. [2021-03-10 14:53:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6360 to 6360. [2021-03-10 14:53:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6360 states, 6359 states have (on average 4.075011794307281) internal successors, (25913), 6359 states have internal predecessors, (25913), 0 states have call successors, (0), 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-03-10 14:53:44,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6360 states to 6360 states and 25913 transitions. [2021-03-10 14:53:44,760 INFO L78 Accepts]: Start accepts. Automaton has 6360 states and 25913 transitions. Word has length 92 [2021-03-10 14:53:44,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:44,760 INFO L480 AbstractCegarLoop]: Abstraction has 6360 states and 25913 transitions. [2021-03-10 14:53:44,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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-03-10 14:53:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6360 states and 25913 transitions. [2021-03-10 14:53:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-03-10 14:53:44,770 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:44,770 INFO L519 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] [2021-03-10 14:53:44,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-03-10 14:53:44,770 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:44,770 INFO L82 PathProgramCache]: Analyzing trace with hash 95325646, now seen corresponding path program 1 times [2021-03-10 14:53:44,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:44,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903841415] [2021-03-10 14:53:44,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 14:53:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 14:53:44,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903841415] [2021-03-10 14:53:44,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 14:53:44,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-10 14:53:44,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357160045] [2021-03-10 14:53:44,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-10 14:53:44,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 14:53:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-10 14:53:44,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-10 14:53:44,844 INFO L87 Difference]: Start difference. First operand 6360 states and 25913 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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-03-10 14:53:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 14:53:44,988 INFO L93 Difference]: Finished difference Result 6360 states and 25907 transitions. [2021-03-10 14:53:44,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 14:53:44,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-03-10 14:53:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 14:53:44,999 INFO L225 Difference]: With dead ends: 6360 [2021-03-10 14:53:44,999 INFO L226 Difference]: Without dead ends: 4785 [2021-03-10 14:53:44,999 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 86.8ms TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-03-10 14:53:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4785 states. [2021-03-10 14:53:45,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4785 to 4785. [2021-03-10 14:53:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4785 states, 4784 states have (on average 4.0495401337792645) internal successors, (19373), 4784 states have internal predecessors, (19373), 0 states have call successors, (0), 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-03-10 14:53:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4785 states to 4785 states and 19373 transitions. [2021-03-10 14:53:45,082 INFO L78 Accepts]: Start accepts. Automaton has 4785 states and 19373 transitions. Word has length 92 [2021-03-10 14:53:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 14:53:45,082 INFO L480 AbstractCegarLoop]: Abstraction has 4785 states and 19373 transitions. [2021-03-10 14:53:45,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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-03-10 14:53:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4785 states and 19373 transitions. [2021-03-10 14:53:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-03-10 14:53:45,090 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 14:53:45,090 INFO L519 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] [2021-03-10 14:53:45,090 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-03-10 14:53:45,090 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-03-10 14:53:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 14:53:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash 731764854, now seen corresponding path program 1 times [2021-03-10 14:53:45,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 14:53:45,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680236618] [2021-03-10 14:53:45,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 14:53:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 14:53:45,105 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 14:53:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 14:53:45,119 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 14:53:45,155 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-10 14:53:45,155 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-10 14:53:45,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-03-10 14:53:45,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.03 02:53:45 BasicIcfg [2021-03-10 14:53:45,277 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-10 14:53:45,277 INFO L168 Benchmark]: Toolchain (without parser) took 95296.75 ms. Allocated memory was 255.9 MB in the beginning and 15.5 GB in the end (delta: 15.3 GB). Free memory was 235.5 MB in the beginning and 8.2 GB in the end (delta: -8.0 GB). Peak memory consumption was 7.3 GB. Max. memory is 16.0 GB. [2021-03-10 14:53:45,277 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 14:53:45,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.86 ms. Allocated memory was 255.9 MB in the beginning and 352.3 MB in the end (delta: 96.5 MB). Free memory was 235.2 MB in the beginning and 333.6 MB in the end (delta: -98.3 MB). Peak memory consumption was 62.2 MB. Max. memory is 16.0 GB. [2021-03-10 14:53:45,277 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.39 ms. Allocated memory is still 352.3 MB. Free memory was 333.6 MB in the beginning and 331.4 MB in the end (delta: 2.2 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 14:53:45,278 INFO L168 Benchmark]: Boogie Preprocessor took 29.86 ms. Allocated memory is still 352.3 MB. Free memory was 331.4 MB in the beginning and 330.4 MB in the end (delta: 939.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 14:53:45,278 INFO L168 Benchmark]: RCFGBuilder took 491.73 ms. Allocated memory is still 352.3 MB. Free memory was 330.3 MB in the beginning and 303.3 MB in the end (delta: 27.1 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. [2021-03-10 14:53:45,278 INFO L168 Benchmark]: TraceAbstraction took 94074.60 ms. Allocated memory was 352.3 MB in the beginning and 15.5 GB in the end (delta: 15.2 GB). Free memory was 303.1 MB in the beginning and 8.2 GB in the end (delta: -7.9 GB). Peak memory consumption was 7.2 GB. Max. memory is 16.0 GB. [2021-03-10 14:53:45,278 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.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 630.86 ms. Allocated memory was 255.9 MB in the beginning and 352.3 MB in the end (delta: 96.5 MB). Free memory was 235.2 MB in the beginning and 333.6 MB in the end (delta: -98.3 MB). Peak memory consumption was 62.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 60.39 ms. Allocated memory is still 352.3 MB. Free memory was 333.6 MB in the beginning and 331.4 MB in the end (delta: 2.2 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.86 ms. Allocated memory is still 352.3 MB. Free memory was 331.4 MB in the beginning and 330.4 MB in the end (delta: 939.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 491.73 ms. Allocated memory is still 352.3 MB. Free memory was 330.3 MB in the beginning and 303.3 MB in the end (delta: 27.1 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 94074.60 ms. Allocated memory was 352.3 MB in the beginning and 15.5 GB in the end (delta: 15.2 GB). Free memory was 303.1 MB in the beginning and 8.2 GB in the end (delta: -7.9 GB). Peak memory consumption was 7.2 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={10:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={0:0}] [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1128] 2 return 0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1148] 1 \read(t1) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1163] 0 \read(t) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1: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))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1: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))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1: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}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1: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))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1152] FCALL, FORK 1 pthread_create(&t5, 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))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1133] 6 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))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1135] 6 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))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1153] 1 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1135] 5 return 0; VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1133] 3 v[0] = 'X' VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1135] 3 return 0; VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1140] 4 v[0] = 'Y' VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1142] 4 return 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))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1154] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1155] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1156] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1: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))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1: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))={-1:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1: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))={-1:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1: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))={-1:0}, t4={14:0}, t5={6:0}, v={-1: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))={-1:0}, t5={6:0}, v={-1: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))={-1:0}, v={-1: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))={-1:0}, v={-1: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))={-1:0}, v={-1: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))={-1:0}, v={-1: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))={-1:0}, v={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 93673.5ms, OverallIterations: 42, TraceHistogramMax: 1, EmptinessCheckTime: 925.8ms, AutomataDifference: 45115.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3973.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7876 SDtfs, 23490 SDslu, 37873 SDs, 0 SdLazy, 18229 SolverSat, 2852 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9895.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1145 GetRequests, 138 SyntacticMatches, 51 SemanticMatches, 956 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5143 ImplicationChecksByTransitivity, 23500.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=49592occurred in iteration=0, InterpolantAutomatonStates: 714, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 32453.4ms AutomataMinimizationTime, 41 MinimizatonAttempts, 276505 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 72.8ms SsaConstructionTime, 408.3ms SatisfiabilityAnalysisTime, 10272.8ms InterpolantComputationTime, 2402 NumberOfCodeBlocks, 2402 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2269 ConstructedInterpolants, 0 QuantifiedInterpolants, 32227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 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...