/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 10:31:49,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 10:31:49,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 10:31:49,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 10:31:49,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 10:31:49,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 10:31:49,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 10:31:49,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 10:31:49,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 10:31:49,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 10:31:49,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 10:31:49,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 10:31:49,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 10:31:49,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 10:31:49,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 10:31:49,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 10:31:49,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 10:31:49,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 10:31:49,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 10:31:49,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 10:31:49,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 10:31:49,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 10:31:49,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 10:31:49,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 10:31:49,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 10:31:49,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 10:31:49,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 10:31:49,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 10:31:49,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 10:31:49,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 10:31:49,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 10:31:49,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 10:31:49,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 10:31:49,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 10:31:49,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 10:31:49,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 10:31:49,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 10:31:49,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 10:31:49,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 10:31:49,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 10:31:49,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 10:31:49,483 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 10:31:49,511 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 10:31:49,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 10:31:49,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 10:31:49,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 10:31:49,520 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 10:31:49,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 10:31:49,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 10:31:49,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 10:31:49,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 10:31:49,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 10:31:49,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 10:31:49,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 10:31:49,524 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 10:31:49,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 10:31:49,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 10:31:49,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 10:31:49,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 10:31:49,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 10:31:49,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 10:31:49,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 10:31:49,527 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 10:31:49,527 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 10:31:49,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 10:31:49,528 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 10:31:49,528 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 10:31:49,528 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 [2020-12-22 10:31:50,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 10:31:50,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 10:31:50,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 10:31:50,069 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 10:31:50,070 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 10:31:50,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton.i [2020-12-22 10:31:50,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e4e4927f/886288a8153c4d68b0fe62eadadd9202/FLAG2e7cd7b41 [2020-12-22 10:31:51,016 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 10:31:51,017 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i [2020-12-22 10:31:51,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e4e4927f/886288a8153c4d68b0fe62eadadd9202/FLAG2e7cd7b41 [2020-12-22 10:31:51,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e4e4927f/886288a8153c4d68b0fe62eadadd9202 [2020-12-22 10:31:51,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 10:31:51,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 10:31:51,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 10:31:51,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 10:31:51,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 10:31:51,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:31:51" (1/1) ... [2020-12-22 10:31:51,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5deea787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:31:51, skipping insertion in model container [2020-12-22 10:31:51,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:31:51" (1/1) ... [2020-12-22 10:31:51,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 10:31:51,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 10:31:51,537 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-22 10:31:51,867 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i[55547,55560] [2020-12-22 10:31:51,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 10:31:51,915 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 10:31:51,956 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-22 10:31:52,002 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i[55547,55560] [2020-12-22 10:31:52,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 10:31:52,257 INFO L208 MainTranslator]: Completed translation [2020-12-22 10:31:52,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:31:52 WrapperNode [2020-12-22 10:31:52,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 10:31:52,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 10:31:52,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 10:31:52,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 10:31:52,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:31:52" (1/1) ... [2020-12-22 10:31:52,326 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:31:52" (1/1) ... [2020-12-22 10:31:52,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 10:31:52,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 10:31:52,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 10:31:52,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 10:31:52,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:31:52" (1/1) ... [2020-12-22 10:31:52,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:31:52" (1/1) ... [2020-12-22 10:31:52,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:31:52" (1/1) ... [2020-12-22 10:31:52,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:31:52" (1/1) ... [2020-12-22 10:31:52,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:31:52" (1/1) ... [2020-12-22 10:31:52,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:31:52" (1/1) ... [2020-12-22 10:31:52,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:31:52" (1/1) ... [2020-12-22 10:31:52,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 10:31:52,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 10:31:52,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 10:31:52,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 10:31:52,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:31:52" (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 [2020-12-22 10:31:52,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-22 10:31:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 10:31:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-22 10:31:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-22 10:31:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-22 10:31:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-12-22 10:31:52,534 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-12-22 10:31:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-12-22 10:31:52,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-12-22 10:31:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-12-22 10:31:52,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-12-22 10:31:52,535 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-12-22 10:31:52,535 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-12-22 10:31:52,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-22 10:31:52,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-22 10:31:52,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 10:31:52,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 10:31:52,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 10:31:52,539 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-22 10:31:53,092 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 10:31:53,092 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2020-12-22 10:31:53,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:31:53 BoogieIcfgContainer [2020-12-22 10:31:53,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 10:31:53,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 10:31:53,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 10:31:53,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 10:31:53,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 10:31:51" (1/3) ... [2020-12-22 10:31:53,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f690184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:31:53, skipping insertion in model container [2020-12-22 10:31:53,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:31:52" (2/3) ... [2020-12-22 10:31:53,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f690184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:31:53, skipping insertion in model container [2020-12-22 10:31:53,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:31:53" (3/3) ... [2020-12-22 10:31:53,108 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-12-22 10:31:53,117 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-22 10:31:53,118 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 10:31:53,124 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-22 10:31:53,125 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-22 10:31:53,186 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,187 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,187 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,187 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,188 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,188 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,188 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,188 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,189 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,189 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,189 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,189 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,190 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,190 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,190 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,194 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,194 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,194 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,219 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,219 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,220 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,220 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,220 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,221 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,221 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,221 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,222 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,223 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,223 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,223 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,223 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,224 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,224 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,224 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,225 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,225 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,225 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,225 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,226 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,226 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,226 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,226 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,227 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,227 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,227 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,228 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,228 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,228 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,228 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,229 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,229 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,229 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,230 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,230 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,230 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,230 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,230 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,247 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,247 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,247 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,247 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,248 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,248 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,248 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,248 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,248 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,249 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,249 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,249 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,249 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,250 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,250 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,250 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,250 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,250 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,251 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,251 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,252 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,252 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,252 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,252 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,253 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,253 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,253 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,253 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,253 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,254 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,254 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,254 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,255 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,255 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,256 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,256 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,256 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,256 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,258 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,258 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,258 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,258 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,258 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,259 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,259 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,259 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,259 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,260 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,260 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,260 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,261 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,261 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,261 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,261 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,261 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,262 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,262 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,262 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,262 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,262 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,263 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,265 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,266 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,266 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,267 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,273 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,273 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,273 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,274 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,276 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,277 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,277 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,277 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,280 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,280 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,280 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,281 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,281 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,281 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,284 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,285 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,286 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,287 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,287 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,288 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,288 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,289 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,292 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,293 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,293 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,293 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,296 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,296 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,296 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,297 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,297 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,297 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,300 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,300 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,301 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,301 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,304 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,304 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,305 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,305 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,308 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,308 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,309 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,309 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,312 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,312 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,313 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,313 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:31:53,525 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2020-12-22 10:31:53,548 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-12-22 10:31:53,574 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 10:31:53,574 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 10:31:53,575 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 10:31:53,575 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 10:31:53,575 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 10:31:53,575 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 10:31:53,575 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 10:31:53,575 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 10:31:53,597 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-22 10:31:53,600 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-22 10:31:53,603 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-22 10:31:53,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 248 transitions, 876 flow [2020-12-22 10:31:53,730 INFO L129 PetriNetUnfolder]: 61/274 cut-off events. [2020-12-22 10:31:53,731 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-12-22 10:31:53,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 274 events. 61/274 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 804 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 330. Up to 24 conditions per place. [2020-12-22 10:31:53,759 INFO L116 LiptonReduction]: Number of co-enabled transitions 4156 [2020-12-22 10:31:56,779 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-12-22 10:31:56,949 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-12-22 10:31:57,162 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-22 10:31:57,287 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-22 10:31:57,419 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-22 10:31:57,534 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-22 10:31:57,964 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-12-22 10:31:58,217 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-12-22 10:31:58,409 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-22 10:31:58,527 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-22 10:31:58,666 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-22 10:31:58,797 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-22 10:31:59,090 INFO L131 LiptonReduction]: Checked pairs total: 49018 [2020-12-22 10:31:59,090 INFO L133 LiptonReduction]: Total number of compositions: 81 [2020-12-22 10:31:59,099 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 173 transitions, 726 flow [2020-12-22 10:31:59,775 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-12-22 10:31:59,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-12-22 10:31:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-22 10:31:59,786 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:31:59,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:31:59,788 INFO L429 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]=== [2020-12-22 10:31:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:31:59,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1391244601, now seen corresponding path program 1 times [2020-12-22 10:31:59,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:31:59,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507354218] [2020-12-22 10:31:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:00,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507354218] [2020-12-22 10:32:00,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:00,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:32:00,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565597679] [2020-12-22 10:32:00,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:32:00,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:00,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:32:00,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:32:00,351 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-12-22 10:32:00,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:00,826 INFO L93 Difference]: Finished difference Result 6012 states and 25679 transitions. [2020-12-22 10:32:00,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:32:00,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-22 10:32:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:00,944 INFO L225 Difference]: With dead ends: 6012 [2020-12-22 10:32:00,945 INFO L226 Difference]: Without dead ends: 5524 [2020-12-22 10:32:00,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-22 10:32:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2020-12-22 10:32:01,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 3018. [2020-12-22 10:32:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-12-22 10:32:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-12-22 10:32:01,392 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-12-22 10:32:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:01,393 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-12-22 10:32:01,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:32:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-12-22 10:32:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-22 10:32:01,394 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:01,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:01,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 10:32:01,395 INFO L429 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]=== [2020-12-22 10:32:01,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:01,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1473766845, now seen corresponding path program 2 times [2020-12-22 10:32:01,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:01,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592192768] [2020-12-22 10:32:01,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:01,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592192768] [2020-12-22 10:32:01,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:01,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:32:01,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525209815] [2020-12-22 10:32:01,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:32:01,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:01,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:32:01,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:32:01,535 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-12-22 10:32:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:01,816 INFO L93 Difference]: Finished difference Result 4266 states and 18042 transitions. [2020-12-22 10:32:01,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 10:32:01,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-22 10:32:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:01,866 INFO L225 Difference]: With dead ends: 4266 [2020-12-22 10:32:01,866 INFO L226 Difference]: Without dead ends: 4266 [2020-12-22 10:32:01,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:32:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2020-12-22 10:32:02,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 3008. [2020-12-22 10:32:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-12-22 10:32:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-12-22 10:32:02,045 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-12-22 10:32:02,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:02,045 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-12-22 10:32:02,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:32:02,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-12-22 10:32:02,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 10:32:02,047 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:02,047 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:02,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 10:32:02,051 INFO L429 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]=== [2020-12-22 10:32:02,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:02,063 INFO L82 PathProgramCache]: Analyzing trace with hash -658761216, now seen corresponding path program 1 times [2020-12-22 10:32:02,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:02,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416888349] [2020-12-22 10:32:02,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:02,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416888349] [2020-12-22 10:32:02,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:02,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 10:32:02,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623686662] [2020-12-22 10:32:02,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 10:32:02,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:02,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 10:32:02,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:32:02,196 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-12-22 10:32:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:02,350 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-12-22 10:32:02,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 10:32:02,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-22 10:32:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:02,401 INFO L225 Difference]: With dead ends: 4848 [2020-12-22 10:32:02,401 INFO L226 Difference]: Without dead ends: 3558 [2020-12-22 10:32:02,402 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:32:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-12-22 10:32:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-12-22 10:32:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-12-22 10:32:02,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-12-22 10:32:02,554 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-12-22 10:32:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:02,554 INFO L481 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-12-22 10:32:02,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 10:32:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-12-22 10:32:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-22 10:32:02,560 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:02,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:02,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 10:32:02,560 INFO L429 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]=== [2020-12-22 10:32:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:02,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1053238145, now seen corresponding path program 1 times [2020-12-22 10:32:02,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:02,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022384274] [2020-12-22 10:32:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:02,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022384274] [2020-12-22 10:32:02,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:02,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:32:02,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074474661] [2020-12-22 10:32:02,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:32:02,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:02,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:32:02,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:32:02,716 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-12-22 10:32:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:03,028 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-12-22 10:32:03,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 10:32:03,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-22 10:32:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:03,059 INFO L225 Difference]: With dead ends: 4417 [2020-12-22 10:32:03,060 INFO L226 Difference]: Without dead ends: 4393 [2020-12-22 10:32:03,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-22 10:32:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-12-22 10:32:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-12-22 10:32:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-12-22 10:32:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-12-22 10:32:03,291 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-12-22 10:32:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:03,291 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-12-22 10:32:03,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:32:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-12-22 10:32:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-22 10:32:03,300 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:03,300 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:03,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 10:32:03,301 INFO L429 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]=== [2020-12-22 10:32:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:03,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1471262403, now seen corresponding path program 2 times [2020-12-22 10:32:03,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:03,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471704989] [2020-12-22 10:32:03,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:03,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471704989] [2020-12-22 10:32:03,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:03,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:32:03,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717916537] [2020-12-22 10:32:03,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:32:03,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:03,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:32:03,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:32:03,452 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-12-22 10:32:03,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:03,600 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-12-22 10:32:03,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:32:03,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-22 10:32:03,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:03,624 INFO L225 Difference]: With dead ends: 4024 [2020-12-22 10:32:03,625 INFO L226 Difference]: Without dead ends: 4024 [2020-12-22 10:32:03,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:32:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-12-22 10:32:03,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-12-22 10:32:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-12-22 10:32:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-12-22 10:32:03,863 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-12-22 10:32:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:03,868 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-12-22 10:32:03,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:32:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-12-22 10:32:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 10:32:03,869 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:03,870 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:03,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 10:32:03,870 INFO L429 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]=== [2020-12-22 10:32:03,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:03,871 INFO L82 PathProgramCache]: Analyzing trace with hash -564581282, now seen corresponding path program 1 times [2020-12-22 10:32:03,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:03,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577038686] [2020-12-22 10:32:03,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:03,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577038686] [2020-12-22 10:32:03,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:03,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:32:03,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007558259] [2020-12-22 10:32:03,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:32:03,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:03,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:32:03,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:32:03,975 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-12-22 10:32:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:04,226 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-12-22 10:32:04,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 10:32:04,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-22 10:32:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:04,251 INFO L225 Difference]: With dead ends: 4225 [2020-12-22 10:32:04,251 INFO L226 Difference]: Without dead ends: 4129 [2020-12-22 10:32:04,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-22 10:32:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-12-22 10:32:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-12-22 10:32:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-12-22 10:32:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-12-22 10:32:04,510 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-12-22 10:32:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:04,511 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-12-22 10:32:04,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:32:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-12-22 10:32:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 10:32:04,512 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:04,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:04,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 10:32:04,513 INFO L429 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]=== [2020-12-22 10:32:04,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:04,514 INFO L82 PathProgramCache]: Analyzing trace with hash -490731172, now seen corresponding path program 2 times [2020-12-22 10:32:04,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:04,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148976798] [2020-12-22 10:32:04,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:04,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148976798] [2020-12-22 10:32:04,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:04,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 10:32:04,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863860145] [2020-12-22 10:32:04,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 10:32:04,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:04,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 10:32:04,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:32:04,718 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2020-12-22 10:32:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:05,263 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-12-22 10:32:05,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 10:32:05,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-22 10:32:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:05,294 INFO L225 Difference]: With dead ends: 4979 [2020-12-22 10:32:05,294 INFO L226 Difference]: Without dead ends: 4905 [2020-12-22 10:32:05,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-22 10:32:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-12-22 10:32:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-12-22 10:32:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-22 10:32:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-12-22 10:32:05,593 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-12-22 10:32:05,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:05,596 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-12-22 10:32:05,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 10:32:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-12-22 10:32:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 10:32:05,598 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:05,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:05,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 10:32:05,598 INFO L429 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]=== [2020-12-22 10:32:05,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:05,599 INFO L82 PathProgramCache]: Analyzing trace with hash 991975414, now seen corresponding path program 3 times [2020-12-22 10:32:05,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:05,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475571602] [2020-12-22 10:32:05,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:05,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475571602] [2020-12-22 10:32:05,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:05,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-22 10:32:05,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194083391] [2020-12-22 10:32:05,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 10:32:05,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:05,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 10:32:05,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-22 10:32:05,749 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 9 states. [2020-12-22 10:32:06,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:06,286 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-12-22 10:32:06,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 10:32:06,286 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-22 10:32:06,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:06,322 INFO L225 Difference]: With dead ends: 6735 [2020-12-22 10:32:06,322 INFO L226 Difference]: Without dead ends: 6661 [2020-12-22 10:32:06,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-12-22 10:32:06,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-12-22 10:32:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-12-22 10:32:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-12-22 10:32:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-12-22 10:32:06,636 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-12-22 10:32:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:06,636 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-12-22 10:32:06,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 10:32:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-12-22 10:32:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 10:32:06,639 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:06,639 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:06,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 10:32:06,639 INFO L429 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]=== [2020-12-22 10:32:06,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:06,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1869283970, now seen corresponding path program 4 times [2020-12-22 10:32:06,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:06,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104261235] [2020-12-22 10:32:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:06,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104261235] [2020-12-22 10:32:06,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:06,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-22 10:32:06,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501559966] [2020-12-22 10:32:06,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 10:32:06,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:06,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 10:32:06,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-22 10:32:06,812 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 9 states. [2020-12-22 10:32:07,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:07,263 INFO L93 Difference]: Finished difference Result 5385 states and 21914 transitions. [2020-12-22 10:32:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:32:07,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-22 10:32:07,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:07,284 INFO L225 Difference]: With dead ends: 5385 [2020-12-22 10:32:07,284 INFO L226 Difference]: Without dead ends: 5311 [2020-12-22 10:32:07,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-12-22 10:32:07,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2020-12-22 10:32:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4125. [2020-12-22 10:32:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2020-12-22 10:32:07,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 16604 transitions. [2020-12-22 10:32:07,491 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 16604 transitions. Word has length 18 [2020-12-22 10:32:07,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:07,495 INFO L481 AbstractCegarLoop]: Abstraction has 4125 states and 16604 transitions. [2020-12-22 10:32:07,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 10:32:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 16604 transitions. [2020-12-22 10:32:07,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 10:32:07,498 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:07,498 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:07,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 10:32:07,499 INFO L429 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]=== [2020-12-22 10:32:07,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:07,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1339896726, now seen corresponding path program 5 times [2020-12-22 10:32:07,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:07,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875773159] [2020-12-22 10:32:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:07,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875773159] [2020-12-22 10:32:07,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:07,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 10:32:07,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46747008] [2020-12-22 10:32:07,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 10:32:07,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:07,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 10:32:07,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-22 10:32:07,836 INFO L87 Difference]: Start difference. First operand 4125 states and 16604 transitions. Second operand 11 states. [2020-12-22 10:32:08,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:08,884 INFO L93 Difference]: Finished difference Result 5686 states and 23415 transitions. [2020-12-22 10:32:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 10:32:08,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-12-22 10:32:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:08,917 INFO L225 Difference]: With dead ends: 5686 [2020-12-22 10:32:08,917 INFO L226 Difference]: Without dead ends: 5630 [2020-12-22 10:32:08,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-22 10:32:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2020-12-22 10:32:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4116. [2020-12-22 10:32:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2020-12-22 10:32:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2020-12-22 10:32:09,161 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2020-12-22 10:32:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:09,161 INFO L481 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2020-12-22 10:32:09,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 10:32:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2020-12-22 10:32:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-22 10:32:09,165 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:09,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:09,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 10:32:09,165 INFO L429 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]=== [2020-12-22 10:32:09,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:09,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1845549347, now seen corresponding path program 1 times [2020-12-22 10:32:09,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:09,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794608274] [2020-12-22 10:32:09,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:09,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794608274] [2020-12-22 10:32:09,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:09,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:32:09,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593077719] [2020-12-22 10:32:09,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:32:09,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:09,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:32:09,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:32:09,256 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 6 states. [2020-12-22 10:32:09,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:09,413 INFO L93 Difference]: Finished difference Result 4687 states and 18325 transitions. [2020-12-22 10:32:09,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:32:09,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-22 10:32:09,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:09,436 INFO L225 Difference]: With dead ends: 4687 [2020-12-22 10:32:09,437 INFO L226 Difference]: Without dead ends: 4687 [2020-12-22 10:32:09,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:32:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-22 10:32:09,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4131. [2020-12-22 10:32:09,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-22 10:32:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16621 transitions. [2020-12-22 10:32:09,681 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16621 transitions. Word has length 19 [2020-12-22 10:32:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:09,681 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16621 transitions. [2020-12-22 10:32:09,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:32:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16621 transitions. [2020-12-22 10:32:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-22 10:32:09,684 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:09,684 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:09,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 10:32:09,685 INFO L429 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]=== [2020-12-22 10:32:09,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:09,686 INFO L82 PathProgramCache]: Analyzing trace with hash 838752707, now seen corresponding path program 2 times [2020-12-22 10:32:09,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:09,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935746981] [2020-12-22 10:32:09,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:09,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935746981] [2020-12-22 10:32:09,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:09,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 10:32:09,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523179842] [2020-12-22 10:32:09,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 10:32:09,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:09,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 10:32:09,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:32:09,780 INFO L87 Difference]: Start difference. First operand 4131 states and 16621 transitions. Second operand 7 states. [2020-12-22 10:32:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:09,931 INFO L93 Difference]: Finished difference Result 4619 states and 18100 transitions. [2020-12-22 10:32:09,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:32:09,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-12-22 10:32:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:09,949 INFO L225 Difference]: With dead ends: 4619 [2020-12-22 10:32:09,949 INFO L226 Difference]: Without dead ends: 4619 [2020-12-22 10:32:09,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-22 10:32:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2020-12-22 10:32:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4078. [2020-12-22 10:32:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2020-12-22 10:32:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2020-12-22 10:32:10,124 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2020-12-22 10:32:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:10,124 INFO L481 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2020-12-22 10:32:10,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 10:32:10,124 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2020-12-22 10:32:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-22 10:32:10,126 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:10,127 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:10,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 10:32:10,127 INFO L429 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]=== [2020-12-22 10:32:10,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:10,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1368539430, now seen corresponding path program 1 times [2020-12-22 10:32:10,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:10,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645464653] [2020-12-22 10:32:10,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:10,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645464653] [2020-12-22 10:32:10,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:10,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-22 10:32:10,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333067002] [2020-12-22 10:32:10,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 10:32:10,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:10,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 10:32:10,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-12-22 10:32:10,395 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 10 states. [2020-12-22 10:32:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:11,125 INFO L93 Difference]: Finished difference Result 5300 states and 21612 transitions. [2020-12-22 10:32:11,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 10:32:11,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-12-22 10:32:11,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:11,142 INFO L225 Difference]: With dead ends: 5300 [2020-12-22 10:32:11,142 INFO L226 Difference]: Without dead ends: 5226 [2020-12-22 10:32:11,143 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-12-22 10:32:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2020-12-22 10:32:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 4066. [2020-12-22 10:32:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4066 states. [2020-12-22 10:32:11,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 16392 transitions. [2020-12-22 10:32:11,325 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 16392 transitions. Word has length 19 [2020-12-22 10:32:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:11,326 INFO L481 AbstractCegarLoop]: Abstraction has 4066 states and 16392 transitions. [2020-12-22 10:32:11,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 10:32:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 16392 transitions. [2020-12-22 10:32:11,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-22 10:32:11,328 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:11,328 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:11,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 10:32:11,329 INFO L429 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]=== [2020-12-22 10:32:11,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:11,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1392670140, now seen corresponding path program 2 times [2020-12-22 10:32:11,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:11,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863866999] [2020-12-22 10:32:11,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:11,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863866999] [2020-12-22 10:32:11,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:11,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 10:32:11,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578228265] [2020-12-22 10:32:11,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 10:32:11,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:11,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 10:32:11,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-22 10:32:11,625 INFO L87 Difference]: Start difference. First operand 4066 states and 16392 transitions. Second operand 12 states. [2020-12-22 10:32:12,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:12,742 INFO L93 Difference]: Finished difference Result 5713 states and 23638 transitions. [2020-12-22 10:32:12,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 10:32:12,743 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-12-22 10:32:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:12,759 INFO L225 Difference]: With dead ends: 5713 [2020-12-22 10:32:12,759 INFO L226 Difference]: Without dead ends: 5651 [2020-12-22 10:32:12,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2020-12-22 10:32:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2020-12-22 10:32:12,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 4021. [2020-12-22 10:32:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2020-12-22 10:32:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 16226 transitions. [2020-12-22 10:32:12,919 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 16226 transitions. Word has length 19 [2020-12-22 10:32:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:12,919 INFO L481 AbstractCegarLoop]: Abstraction has 4021 states and 16226 transitions. [2020-12-22 10:32:12,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 10:32:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 16226 transitions. [2020-12-22 10:32:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 10:32:12,922 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:12,922 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:12,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 10:32:12,923 INFO L429 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]=== [2020-12-22 10:32:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:12,923 INFO L82 PathProgramCache]: Analyzing trace with hash -638770199, now seen corresponding path program 1 times [2020-12-22 10:32:12,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:12,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583689423] [2020-12-22 10:32:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:13,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583689423] [2020-12-22 10:32:13,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:13,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 10:32:13,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35240845] [2020-12-22 10:32:13,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 10:32:13,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:13,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 10:32:13,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:32:13,010 INFO L87 Difference]: Start difference. First operand 4021 states and 16226 transitions. Second operand 8 states. [2020-12-22 10:32:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:13,378 INFO L93 Difference]: Finished difference Result 6240 states and 25278 transitions. [2020-12-22 10:32:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 10:32:13,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-22 10:32:13,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:13,405 INFO L225 Difference]: With dead ends: 6240 [2020-12-22 10:32:13,405 INFO L226 Difference]: Without dead ends: 6194 [2020-12-22 10:32:13,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-12-22 10:32:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6194 states. [2020-12-22 10:32:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6194 to 4020. [2020-12-22 10:32:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2020-12-22 10:32:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 16225 transitions. [2020-12-22 10:32:13,575 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 16225 transitions. Word has length 20 [2020-12-22 10:32:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:13,575 INFO L481 AbstractCegarLoop]: Abstraction has 4020 states and 16225 transitions. [2020-12-22 10:32:13,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 10:32:13,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 16225 transitions. [2020-12-22 10:32:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 10:32:13,579 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:13,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:13,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 10:32:13,581 INFO L429 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]=== [2020-12-22 10:32:13,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:13,581 INFO L82 PathProgramCache]: Analyzing trace with hash -78568143, now seen corresponding path program 2 times [2020-12-22 10:32:13,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:13,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333667749] [2020-12-22 10:32:13,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:13,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333667749] [2020-12-22 10:32:13,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:13,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 10:32:13,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053500688] [2020-12-22 10:32:13,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 10:32:13,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:13,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 10:32:13,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:32:13,710 INFO L87 Difference]: Start difference. First operand 4020 states and 16225 transitions. Second operand 8 states. [2020-12-22 10:32:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:13,974 INFO L93 Difference]: Finished difference Result 5057 states and 20246 transitions. [2020-12-22 10:32:13,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:32:13,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-22 10:32:13,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:13,990 INFO L225 Difference]: With dead ends: 5057 [2020-12-22 10:32:13,990 INFO L226 Difference]: Without dead ends: 5011 [2020-12-22 10:32:13,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-22 10:32:14,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2020-12-22 10:32:14,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 4017. [2020-12-22 10:32:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4017 states. [2020-12-22 10:32:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 16218 transitions. [2020-12-22 10:32:14,139 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 16218 transitions. Word has length 20 [2020-12-22 10:32:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:14,139 INFO L481 AbstractCegarLoop]: Abstraction has 4017 states and 16218 transitions. [2020-12-22 10:32:14,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 10:32:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 16218 transitions. [2020-12-22 10:32:14,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 10:32:14,142 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:14,143 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:14,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 10:32:14,143 INFO L429 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]=== [2020-12-22 10:32:14,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1686883325, now seen corresponding path program 3 times [2020-12-22 10:32:14,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:14,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410378406] [2020-12-22 10:32:14,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:14,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410378406] [2020-12-22 10:32:14,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:14,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-22 10:32:14,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442046199] [2020-12-22 10:32:14,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 10:32:14,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:14,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 10:32:14,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-22 10:32:14,444 INFO L87 Difference]: Start difference. First operand 4017 states and 16218 transitions. Second operand 9 states. [2020-12-22 10:32:14,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:14,985 INFO L93 Difference]: Finished difference Result 5047 states and 20222 transitions. [2020-12-22 10:32:14,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 10:32:14,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-12-22 10:32:14,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:15,000 INFO L225 Difference]: With dead ends: 5047 [2020-12-22 10:32:15,000 INFO L226 Difference]: Without dead ends: 5001 [2020-12-22 10:32:15,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-12-22 10:32:15,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2020-12-22 10:32:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 4010. [2020-12-22 10:32:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4010 states. [2020-12-22 10:32:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 16199 transitions. [2020-12-22 10:32:15,131 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 16199 transitions. Word has length 20 [2020-12-22 10:32:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:15,132 INFO L481 AbstractCegarLoop]: Abstraction has 4010 states and 16199 transitions. [2020-12-22 10:32:15,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 10:32:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 16199 transitions. [2020-12-22 10:32:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 10:32:15,135 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:15,135 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:15,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 10:32:15,135 INFO L429 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]=== [2020-12-22 10:32:15,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:15,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1644928641, now seen corresponding path program 4 times [2020-12-22 10:32:15,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:15,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817933040] [2020-12-22 10:32:15,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:15,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817933040] [2020-12-22 10:32:15,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:15,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 10:32:15,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431739779] [2020-12-22 10:32:15,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 10:32:15,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:15,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 10:32:15,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-12-22 10:32:15,402 INFO L87 Difference]: Start difference. First operand 4010 states and 16199 transitions. Second operand 11 states. [2020-12-22 10:32:16,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:16,232 INFO L93 Difference]: Finished difference Result 5545 states and 22382 transitions. [2020-12-22 10:32:16,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 10:32:16,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-22 10:32:16,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:16,249 INFO L225 Difference]: With dead ends: 5545 [2020-12-22 10:32:16,249 INFO L226 Difference]: Without dead ends: 5499 [2020-12-22 10:32:16,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-12-22 10:32:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2020-12-22 10:32:16,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 4140. [2020-12-22 10:32:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-12-22 10:32:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16867 transitions. [2020-12-22 10:32:16,405 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16867 transitions. Word has length 20 [2020-12-22 10:32:16,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:16,405 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16867 transitions. [2020-12-22 10:32:16,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 10:32:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16867 transitions. [2020-12-22 10:32:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 10:32:16,409 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:16,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:16,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 10:32:16,409 INFO L429 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]=== [2020-12-22 10:32:16,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:16,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1818104208, now seen corresponding path program 1 times [2020-12-22 10:32:16,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:16,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361244461] [2020-12-22 10:32:16,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:16,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361244461] [2020-12-22 10:32:16,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:16,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 10:32:16,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058959592] [2020-12-22 10:32:16,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 10:32:16,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 10:32:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-22 10:32:16,647 INFO L87 Difference]: Start difference. First operand 4140 states and 16867 transitions. Second operand 11 states. [2020-12-22 10:32:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:17,799 INFO L93 Difference]: Finished difference Result 6397 states and 25724 transitions. [2020-12-22 10:32:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-22 10:32:17,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-22 10:32:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:17,820 INFO L225 Difference]: With dead ends: 6397 [2020-12-22 10:32:17,820 INFO L226 Difference]: Without dead ends: 6351 [2020-12-22 10:32:17,821 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-22 10:32:17,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6351 states. [2020-12-22 10:32:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6351 to 4140. [2020-12-22 10:32:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-12-22 10:32:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16868 transitions. [2020-12-22 10:32:18,015 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16868 transitions. Word has length 20 [2020-12-22 10:32:18,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:18,015 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16868 transitions. [2020-12-22 10:32:18,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 10:32:18,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16868 transitions. [2020-12-22 10:32:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 10:32:18,021 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:18,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:18,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 10:32:18,021 INFO L429 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]=== [2020-12-22 10:32:18,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:18,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1599554532, now seen corresponding path program 2 times [2020-12-22 10:32:18,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:18,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107258755] [2020-12-22 10:32:18,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:18,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107258755] [2020-12-22 10:32:18,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:18,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 10:32:18,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873292824] [2020-12-22 10:32:18,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 10:32:18,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:18,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 10:32:18,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-22 10:32:18,260 INFO L87 Difference]: Start difference. First operand 4140 states and 16868 transitions. Second operand 11 states. [2020-12-22 10:32:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:19,239 INFO L93 Difference]: Finished difference Result 5409 states and 21869 transitions. [2020-12-22 10:32:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-22 10:32:19,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-22 10:32:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:19,254 INFO L225 Difference]: With dead ends: 5409 [2020-12-22 10:32:19,254 INFO L226 Difference]: Without dead ends: 5363 [2020-12-22 10:32:19,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-12-22 10:32:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2020-12-22 10:32:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 4142. [2020-12-22 10:32:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4142 states. [2020-12-22 10:32:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 16874 transitions. [2020-12-22 10:32:19,355 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 16874 transitions. Word has length 20 [2020-12-22 10:32:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:19,355 INFO L481 AbstractCegarLoop]: Abstraction has 4142 states and 16874 transitions. [2020-12-22 10:32:19,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 10:32:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 16874 transitions. [2020-12-22 10:32:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 10:32:19,358 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:19,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:19,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-22 10:32:19,359 INFO L429 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]=== [2020-12-22 10:32:19,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:19,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1117675172, now seen corresponding path program 3 times [2020-12-22 10:32:19,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:19,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771719890] [2020-12-22 10:32:19,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:19,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771719890] [2020-12-22 10:32:19,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:19,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-22 10:32:19,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606230920] [2020-12-22 10:32:19,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 10:32:19,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:19,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 10:32:19,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-22 10:32:19,536 INFO L87 Difference]: Start difference. First operand 4142 states and 16874 transitions. Second operand 10 states. [2020-12-22 10:32:20,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:20,254 INFO L93 Difference]: Finished difference Result 6189 states and 24832 transitions. [2020-12-22 10:32:20,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 10:32:20,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-22 10:32:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:20,282 INFO L225 Difference]: With dead ends: 6189 [2020-12-22 10:32:20,282 INFO L226 Difference]: Without dead ends: 6143 [2020-12-22 10:32:20,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-12-22 10:32:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2020-12-22 10:32:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 4141. [2020-12-22 10:32:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4141 states. [2020-12-22 10:32:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 16873 transitions. [2020-12-22 10:32:20,460 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 16873 transitions. Word has length 20 [2020-12-22 10:32:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:20,460 INFO L481 AbstractCegarLoop]: Abstraction has 4141 states and 16873 transitions. [2020-12-22 10:32:20,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 10:32:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 16873 transitions. [2020-12-22 10:32:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 10:32:20,464 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:20,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:20,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-22 10:32:20,464 INFO L429 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]=== [2020-12-22 10:32:20,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:20,465 INFO L82 PathProgramCache]: Analyzing trace with hash -240366616, now seen corresponding path program 4 times [2020-12-22 10:32:20,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:20,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978717465] [2020-12-22 10:32:20,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:20,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978717465] [2020-12-22 10:32:20,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:20,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-22 10:32:20,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983853008] [2020-12-22 10:32:20,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 10:32:20,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:20,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 10:32:20,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-22 10:32:20,640 INFO L87 Difference]: Start difference. First operand 4141 states and 16873 transitions. Second operand 10 states. [2020-12-22 10:32:21,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:21,169 INFO L93 Difference]: Finished difference Result 5246 states and 21125 transitions. [2020-12-22 10:32:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 10:32:21,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-22 10:32:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:21,183 INFO L225 Difference]: With dead ends: 5246 [2020-12-22 10:32:21,184 INFO L226 Difference]: Without dead ends: 5200 [2020-12-22 10:32:21,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-12-22 10:32:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2020-12-22 10:32:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 3983. [2020-12-22 10:32:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2020-12-22 10:32:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 16133 transitions. [2020-12-22 10:32:21,277 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 16133 transitions. Word has length 20 [2020-12-22 10:32:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:21,277 INFO L481 AbstractCegarLoop]: Abstraction has 3983 states and 16133 transitions. [2020-12-22 10:32:21,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 10:32:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 16133 transitions. [2020-12-22 10:32:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-22 10:32:21,281 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:21,281 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:21,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-22 10:32:21,282 INFO L429 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]=== [2020-12-22 10:32:21,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:21,282 INFO L82 PathProgramCache]: Analyzing trace with hash -565771751, now seen corresponding path program 1 times [2020-12-22 10:32:21,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:21,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429379356] [2020-12-22 10:32:21,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:21,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429379356] [2020-12-22 10:32:21,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:21,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:32:21,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802733168] [2020-12-22 10:32:21,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:32:21,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:21,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:32:21,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:32:21,343 INFO L87 Difference]: Start difference. First operand 3983 states and 16133 transitions. Second operand 6 states. [2020-12-22 10:32:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:21,572 INFO L93 Difference]: Finished difference Result 4762 states and 18800 transitions. [2020-12-22 10:32:21,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 10:32:21,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-22 10:32:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:21,588 INFO L225 Difference]: With dead ends: 4762 [2020-12-22 10:32:21,588 INFO L226 Difference]: Without dead ends: 4687 [2020-12-22 10:32:21,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-22 10:32:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-22 10:32:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4305. [2020-12-22 10:32:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2020-12-22 10:32:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 17320 transitions. [2020-12-22 10:32:21,737 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 17320 transitions. Word has length 21 [2020-12-22 10:32:21,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:21,738 INFO L481 AbstractCegarLoop]: Abstraction has 4305 states and 17320 transitions. [2020-12-22 10:32:21,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:32:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 17320 transitions. [2020-12-22 10:32:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-22 10:32:21,744 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:21,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:21,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-22 10:32:21,744 INFO L429 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]=== [2020-12-22 10:32:21,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:21,745 INFO L82 PathProgramCache]: Analyzing trace with hash 479599707, now seen corresponding path program 2 times [2020-12-22 10:32:21,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:21,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511175336] [2020-12-22 10:32:21,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:21,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511175336] [2020-12-22 10:32:21,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:21,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:32:21,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050193012] [2020-12-22 10:32:21,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:32:21,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:21,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:32:21,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:32:21,813 INFO L87 Difference]: Start difference. First operand 4305 states and 17320 transitions. Second operand 6 states. [2020-12-22 10:32:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:21,950 INFO L93 Difference]: Finished difference Result 5233 states and 20429 transitions. [2020-12-22 10:32:21,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:32:21,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-22 10:32:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:21,970 INFO L225 Difference]: With dead ends: 5233 [2020-12-22 10:32:21,970 INFO L226 Difference]: Without dead ends: 4707 [2020-12-22 10:32:21,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:32:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4707 states. [2020-12-22 10:32:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4707 to 3933. [2020-12-22 10:32:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3933 states. [2020-12-22 10:32:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 15536 transitions. [2020-12-22 10:32:22,093 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 15536 transitions. Word has length 21 [2020-12-22 10:32:22,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:22,094 INFO L481 AbstractCegarLoop]: Abstraction has 3933 states and 15536 transitions. [2020-12-22 10:32:22,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:32:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 15536 transitions. [2020-12-22 10:32:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-22 10:32:22,098 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:22,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:22,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-22 10:32:22,098 INFO L429 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]=== [2020-12-22 10:32:22,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:22,099 INFO L82 PathProgramCache]: Analyzing trace with hash -586116813, now seen corresponding path program 1 times [2020-12-22 10:32:22,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:22,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981413907] [2020-12-22 10:32:22,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:22,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981413907] [2020-12-22 10:32:22,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:22,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-22 10:32:22,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430826405] [2020-12-22 10:32:22,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 10:32:22,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:22,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 10:32:22,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-22 10:32:22,327 INFO L87 Difference]: Start difference. First operand 3933 states and 15536 transitions. Second operand 10 states. [2020-12-22 10:32:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:23,113 INFO L93 Difference]: Finished difference Result 4734 states and 18567 transitions. [2020-12-22 10:32:23,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 10:32:23,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-12-22 10:32:23,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:23,128 INFO L225 Difference]: With dead ends: 4734 [2020-12-22 10:32:23,128 INFO L226 Difference]: Without dead ends: 4685 [2020-12-22 10:32:23,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-22 10:32:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4685 states. [2020-12-22 10:32:23,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 3841. [2020-12-22 10:32:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2020-12-22 10:32:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 15162 transitions. [2020-12-22 10:32:23,258 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 15162 transitions. Word has length 21 [2020-12-22 10:32:23,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:23,258 INFO L481 AbstractCegarLoop]: Abstraction has 3841 states and 15162 transitions. [2020-12-22 10:32:23,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 10:32:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 15162 transitions. [2020-12-22 10:32:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-22 10:32:23,261 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:23,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:23,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-22 10:32:23,262 INFO L429 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]=== [2020-12-22 10:32:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:23,262 INFO L82 PathProgramCache]: Analyzing trace with hash -757352757, now seen corresponding path program 1 times [2020-12-22 10:32:23,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:23,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007493033] [2020-12-22 10:32:23,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:23,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007493033] [2020-12-22 10:32:23,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:23,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 10:32:23,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538562454] [2020-12-22 10:32:23,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 10:32:23,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:23,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 10:32:23,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-22 10:32:23,648 INFO L87 Difference]: Start difference. First operand 3841 states and 15162 transitions. Second operand 12 states. [2020-12-22 10:32:24,020 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2020-12-22 10:32:24,248 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2020-12-22 10:32:24,401 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-12-22 10:32:24,542 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2020-12-22 10:32:24,695 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-12-22 10:32:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:25,043 INFO L93 Difference]: Finished difference Result 5118 states and 20406 transitions. [2020-12-22 10:32:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-22 10:32:25,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-22 10:32:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:25,059 INFO L225 Difference]: With dead ends: 5118 [2020-12-22 10:32:25,059 INFO L226 Difference]: Without dead ends: 4964 [2020-12-22 10:32:25,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2020-12-22 10:32:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4964 states. [2020-12-22 10:32:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4964 to 3443. [2020-12-22 10:32:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2020-12-22 10:32:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 13378 transitions. [2020-12-22 10:32:25,145 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 13378 transitions. Word has length 21 [2020-12-22 10:32:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:25,145 INFO L481 AbstractCegarLoop]: Abstraction has 3443 states and 13378 transitions. [2020-12-22 10:32:25,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 10:32:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 13378 transitions. [2020-12-22 10:32:25,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-22 10:32:25,148 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:25,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:25,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-22 10:32:25,148 INFO L429 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]=== [2020-12-22 10:32:25,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:25,149 INFO L82 PathProgramCache]: Analyzing trace with hash 820571943, now seen corresponding path program 2 times [2020-12-22 10:32:25,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:25,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043095745] [2020-12-22 10:32:25,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:25,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043095745] [2020-12-22 10:32:25,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:25,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 10:32:25,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610171988] [2020-12-22 10:32:25,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 10:32:25,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:25,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 10:32:25,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-22 10:32:25,463 INFO L87 Difference]: Start difference. First operand 3443 states and 13378 transitions. Second operand 12 states. [2020-12-22 10:32:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:26,149 INFO L93 Difference]: Finished difference Result 4562 states and 17491 transitions. [2020-12-22 10:32:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 10:32:26,150 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-22 10:32:26,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:26,163 INFO L225 Difference]: With dead ends: 4562 [2020-12-22 10:32:26,163 INFO L226 Difference]: Without dead ends: 4510 [2020-12-22 10:32:26,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-22 10:32:26,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2020-12-22 10:32:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 3368. [2020-12-22 10:32:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3368 states. [2020-12-22 10:32:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 12841 transitions. [2020-12-22 10:32:26,258 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 12841 transitions. Word has length 21 [2020-12-22 10:32:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:26,258 INFO L481 AbstractCegarLoop]: Abstraction has 3368 states and 12841 transitions. [2020-12-22 10:32:26,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 10:32:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 12841 transitions. [2020-12-22 10:32:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-22 10:32:26,261 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:26,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:26,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-22 10:32:26,261 INFO L429 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]=== [2020-12-22 10:32:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1673753334, now seen corresponding path program 1 times [2020-12-22 10:32:26,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:26,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262607813] [2020-12-22 10:32:26,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:26,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262607813] [2020-12-22 10:32:26,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:26,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 10:32:26,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431107566] [2020-12-22 10:32:26,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 10:32:26,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:26,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 10:32:26,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:32:26,361 INFO L87 Difference]: Start difference. First operand 3368 states and 12841 transitions. Second operand 7 states. [2020-12-22 10:32:26,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:26,511 INFO L93 Difference]: Finished difference Result 3879 states and 14497 transitions. [2020-12-22 10:32:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:32:26,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-22 10:32:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:26,528 INFO L225 Difference]: With dead ends: 3879 [2020-12-22 10:32:26,528 INFO L226 Difference]: Without dead ends: 3785 [2020-12-22 10:32:26,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-22 10:32:26,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2020-12-22 10:32:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3369. [2020-12-22 10:32:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3369 states. [2020-12-22 10:32:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 12845 transitions. [2020-12-22 10:32:26,653 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 12845 transitions. Word has length 21 [2020-12-22 10:32:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:26,653 INFO L481 AbstractCegarLoop]: Abstraction has 3369 states and 12845 transitions. [2020-12-22 10:32:26,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 10:32:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 12845 transitions. [2020-12-22 10:32:26,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-22 10:32:26,657 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:26,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:26,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-22 10:32:26,657 INFO L429 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]=== [2020-12-22 10:32:26,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:26,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1208728268, now seen corresponding path program 1 times [2020-12-22 10:32:26,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:26,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082939549] [2020-12-22 10:32:26,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:26,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082939549] [2020-12-22 10:32:26,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:26,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 10:32:26,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436754823] [2020-12-22 10:32:26,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 10:32:26,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:26,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 10:32:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-22 10:32:26,989 INFO L87 Difference]: Start difference. First operand 3369 states and 12845 transitions. Second operand 11 states. [2020-12-22 10:32:27,443 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-12-22 10:32:27,594 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2020-12-22 10:32:27,722 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-12-22 10:32:28,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:28,049 INFO L93 Difference]: Finished difference Result 4138 states and 15694 transitions. [2020-12-22 10:32:28,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 10:32:28,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-12-22 10:32:28,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:28,062 INFO L225 Difference]: With dead ends: 4138 [2020-12-22 10:32:28,063 INFO L226 Difference]: Without dead ends: 4089 [2020-12-22 10:32:28,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-12-22 10:32:28,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2020-12-22 10:32:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 3004. [2020-12-22 10:32:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2020-12-22 10:32:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 11303 transitions. [2020-12-22 10:32:28,163 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 11303 transitions. Word has length 21 [2020-12-22 10:32:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:28,163 INFO L481 AbstractCegarLoop]: Abstraction has 3004 states and 11303 transitions. [2020-12-22 10:32:28,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 10:32:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 11303 transitions. [2020-12-22 10:32:28,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-22 10:32:28,166 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:28,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:28,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-22 10:32:28,167 INFO L429 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]=== [2020-12-22 10:32:28,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:28,167 INFO L82 PathProgramCache]: Analyzing trace with hash 172061386, now seen corresponding path program 2 times [2020-12-22 10:32:28,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:28,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916462442] [2020-12-22 10:32:28,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:28,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916462442] [2020-12-22 10:32:28,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:28,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 10:32:28,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280702420] [2020-12-22 10:32:28,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 10:32:28,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:28,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 10:32:28,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:32:28,324 INFO L87 Difference]: Start difference. First operand 3004 states and 11303 transitions. Second operand 8 states. [2020-12-22 10:32:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:28,524 INFO L93 Difference]: Finished difference Result 3058 states and 11357 transitions. [2020-12-22 10:32:28,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:32:28,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-12-22 10:32:28,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:28,533 INFO L225 Difference]: With dead ends: 3058 [2020-12-22 10:32:28,533 INFO L226 Difference]: Without dead ends: 3058 [2020-12-22 10:32:28,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-22 10:32:28,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-12-22 10:32:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2831. [2020-12-22 10:32:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-12-22 10:32:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-12-22 10:32:28,583 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-12-22 10:32:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:28,584 INFO L481 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-12-22 10:32:28,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 10:32:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-12-22 10:32:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-22 10:32:28,585 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:28,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:28,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-22 10:32:28,586 INFO L429 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]=== [2020-12-22 10:32:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:28,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1320448504, now seen corresponding path program 1 times [2020-12-22 10:32:28,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:28,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869998317] [2020-12-22 10:32:28,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:28,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869998317] [2020-12-22 10:32:28,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:28,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 10:32:28,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066159971] [2020-12-22 10:32:28,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 10:32:28,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:28,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 10:32:28,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:32:28,684 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2020-12-22 10:32:29,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:29,116 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2020-12-22 10:32:29,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 10:32:29,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-12-22 10:32:29,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:29,126 INFO L225 Difference]: With dead ends: 3550 [2020-12-22 10:32:29,126 INFO L226 Difference]: Without dead ends: 3490 [2020-12-22 10:32:29,127 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-22 10:32:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2020-12-22 10:32:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2020-12-22 10:32:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2020-12-22 10:32:29,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2020-12-22 10:32:29,187 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2020-12-22 10:32:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:29,187 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2020-12-22 10:32:29,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 10:32:29,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2020-12-22 10:32:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-22 10:32:29,190 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:29,190 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:29,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-22 10:32:29,191 INFO L429 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]=== [2020-12-22 10:32:29,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:29,191 INFO L82 PathProgramCache]: Analyzing trace with hash -893918318, now seen corresponding path program 2 times [2020-12-22 10:32:29,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:29,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389301342] [2020-12-22 10:32:29,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:29,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389301342] [2020-12-22 10:32:29,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:29,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-22 10:32:29,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474823547] [2020-12-22 10:32:29,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 10:32:29,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:29,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 10:32:29,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-22 10:32:29,344 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2020-12-22 10:32:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:29,915 INFO L93 Difference]: Finished difference Result 3862 states and 14252 transitions. [2020-12-22 10:32:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 10:32:29,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-12-22 10:32:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:29,933 INFO L225 Difference]: With dead ends: 3862 [2020-12-22 10:32:29,933 INFO L226 Difference]: Without dead ends: 3802 [2020-12-22 10:32:29,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-22 10:32:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2020-12-22 10:32:30,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2822. [2020-12-22 10:32:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-12-22 10:32:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-12-22 10:32:30,046 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-12-22 10:32:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:30,046 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-12-22 10:32:30,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 10:32:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-12-22 10:32:30,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-22 10:32:30,049 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:30,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:30,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-22 10:32:30,050 INFO L429 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]=== [2020-12-22 10:32:30,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:30,050 INFO L82 PathProgramCache]: Analyzing trace with hash 131153448, now seen corresponding path program 3 times [2020-12-22 10:32:30,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:30,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532270409] [2020-12-22 10:32:30,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:30,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532270409] [2020-12-22 10:32:30,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:30,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-22 10:32:30,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856967465] [2020-12-22 10:32:30,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 10:32:30,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:30,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 10:32:30,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-22 10:32:30,242 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 10 states. [2020-12-22 10:32:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:30,810 INFO L93 Difference]: Finished difference Result 4277 states and 15941 transitions. [2020-12-22 10:32:30,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 10:32:30,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-22 10:32:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:30,829 INFO L225 Difference]: With dead ends: 4277 [2020-12-22 10:32:30,829 INFO L226 Difference]: Without dead ends: 4217 [2020-12-22 10:32:30,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-12-22 10:32:30,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2020-12-22 10:32:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 2818. [2020-12-22 10:32:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2020-12-22 10:32:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 10596 transitions. [2020-12-22 10:32:30,943 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 10596 transitions. Word has length 22 [2020-12-22 10:32:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:30,943 INFO L481 AbstractCegarLoop]: Abstraction has 2818 states and 10596 transitions. [2020-12-22 10:32:30,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 10:32:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 10596 transitions. [2020-12-22 10:32:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-22 10:32:30,947 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:30,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:30,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-22 10:32:30,947 INFO L429 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]=== [2020-12-22 10:32:30,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:30,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1026439080, now seen corresponding path program 4 times [2020-12-22 10:32:30,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:30,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643552450] [2020-12-22 10:32:30,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:31,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643552450] [2020-12-22 10:32:31,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:31,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-22 10:32:31,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296825635] [2020-12-22 10:32:31,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 10:32:31,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:31,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 10:32:31,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-22 10:32:31,094 INFO L87 Difference]: Start difference. First operand 2818 states and 10596 transitions. Second operand 10 states. [2020-12-22 10:32:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:31,397 INFO L93 Difference]: Finished difference Result 3433 states and 12660 transitions. [2020-12-22 10:32:31,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:32:31,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-22 10:32:31,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:31,410 INFO L225 Difference]: With dead ends: 3433 [2020-12-22 10:32:31,410 INFO L226 Difference]: Without dead ends: 3373 [2020-12-22 10:32:31,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-12-22 10:32:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2020-12-22 10:32:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 2730. [2020-12-22 10:32:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2020-12-22 10:32:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 10232 transitions. [2020-12-22 10:32:31,472 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 10232 transitions. Word has length 22 [2020-12-22 10:32:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:31,472 INFO L481 AbstractCegarLoop]: Abstraction has 2730 states and 10232 transitions. [2020-12-22 10:32:31,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 10:32:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 10232 transitions. [2020-12-22 10:32:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-22 10:32:31,474 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:31,474 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:31,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-22 10:32:31,474 INFO L429 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]=== [2020-12-22 10:32:31,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:31,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1544480782, now seen corresponding path program 5 times [2020-12-22 10:32:31,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:31,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918730575] [2020-12-22 10:32:31,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:31,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918730575] [2020-12-22 10:32:31,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:31,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 10:32:31,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078439930] [2020-12-22 10:32:31,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 10:32:31,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:31,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 10:32:31,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-22 10:32:31,794 INFO L87 Difference]: Start difference. First operand 2730 states and 10232 transitions. Second operand 12 states. [2020-12-22 10:32:32,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:32,370 INFO L93 Difference]: Finished difference Result 3588 states and 13121 transitions. [2020-12-22 10:32:32,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:32:32,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-12-22 10:32:32,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:32,381 INFO L225 Difference]: With dead ends: 3588 [2020-12-22 10:32:32,381 INFO L226 Difference]: Without dead ends: 3528 [2020-12-22 10:32:32,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2020-12-22 10:32:32,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2020-12-22 10:32:32,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 2670. [2020-12-22 10:32:32,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-12-22 10:32:32,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2020-12-22 10:32:32,436 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2020-12-22 10:32:32,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:32,437 INFO L481 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2020-12-22 10:32:32,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 10:32:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2020-12-22 10:32:32,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 10:32:32,439 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:32,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:32,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-22 10:32:32,439 INFO L429 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]=== [2020-12-22 10:32:32,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:32,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1499150017, now seen corresponding path program 1 times [2020-12-22 10:32:32,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:32,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736107641] [2020-12-22 10:32:32,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:32,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736107641] [2020-12-22 10:32:32,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:32,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 10:32:32,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949238976] [2020-12-22 10:32:32,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 10:32:32,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:32,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 10:32:32,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-22 10:32:32,814 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2020-12-22 10:32:33,334 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-12-22 10:32:33,470 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-12-22 10:32:33,624 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2020-12-22 10:32:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:33,882 INFO L93 Difference]: Finished difference Result 2896 states and 10368 transitions. [2020-12-22 10:32:33,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 10:32:33,883 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-22 10:32:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:33,890 INFO L225 Difference]: With dead ends: 2896 [2020-12-22 10:32:33,890 INFO L226 Difference]: Without dead ends: 2802 [2020-12-22 10:32:33,891 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2020-12-22 10:32:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2020-12-22 10:32:33,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2426. [2020-12-22 10:32:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2020-12-22 10:32:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 8840 transitions. [2020-12-22 10:32:33,938 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 8840 transitions. Word has length 23 [2020-12-22 10:32:33,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:33,938 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 8840 transitions. [2020-12-22 10:32:33,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 10:32:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 8840 transitions. [2020-12-22 10:32:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 10:32:33,940 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:33,941 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:33,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-22 10:32:33,941 INFO L429 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]=== [2020-12-22 10:32:33,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:33,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1292151056, now seen corresponding path program 1 times [2020-12-22 10:32:33,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:33,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815181669] [2020-12-22 10:32:33,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:34,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815181669] [2020-12-22 10:32:34,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:34,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 10:32:34,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123136073] [2020-12-22 10:32:34,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 10:32:34,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:34,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 10:32:34,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-22 10:32:34,307 INFO L87 Difference]: Start difference. First operand 2426 states and 8840 transitions. Second operand 12 states. [2020-12-22 10:32:34,821 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-12-22 10:32:34,995 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2020-12-22 10:32:35,150 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2020-12-22 10:32:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:35,384 INFO L93 Difference]: Finished difference Result 2538 states and 8863 transitions. [2020-12-22 10:32:35,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-22 10:32:35,385 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-22 10:32:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:35,392 INFO L225 Difference]: With dead ends: 2538 [2020-12-22 10:32:35,392 INFO L226 Difference]: Without dead ends: 2419 [2020-12-22 10:32:35,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-12-22 10:32:35,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2020-12-22 10:32:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1794. [2020-12-22 10:32:35,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-12-22 10:32:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2020-12-22 10:32:35,432 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2020-12-22 10:32:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:35,432 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2020-12-22 10:32:35,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 10:32:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2020-12-22 10:32:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 10:32:35,434 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:35,434 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:35,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-22 10:32:35,434 INFO L429 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]=== [2020-12-22 10:32:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:35,435 INFO L82 PathProgramCache]: Analyzing trace with hash -974214744, now seen corresponding path program 1 times [2020-12-22 10:32:35,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:35,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731384884] [2020-12-22 10:32:35,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:35,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731384884] [2020-12-22 10:32:35,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:35,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:32:35,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489907031] [2020-12-22 10:32:35,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:32:35,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:35,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:32:35,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:32:35,494 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 6 states. [2020-12-22 10:32:35,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:35,740 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2020-12-22 10:32:35,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 10:32:35,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-12-22 10:32:35,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:35,748 INFO L225 Difference]: With dead ends: 2291 [2020-12-22 10:32:35,748 INFO L226 Difference]: Without dead ends: 2227 [2020-12-22 10:32:35,749 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-22 10:32:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2020-12-22 10:32:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2020-12-22 10:32:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-12-22 10:32:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2020-12-22 10:32:35,814 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2020-12-22 10:32:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:35,814 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2020-12-22 10:32:35,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:32:35,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2020-12-22 10:32:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 10:32:35,818 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:35,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:35,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-22 10:32:35,819 INFO L429 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]=== [2020-12-22 10:32:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1120972762, now seen corresponding path program 2 times [2020-12-22 10:32:35,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:35,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181110952] [2020-12-22 10:32:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:35,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181110952] [2020-12-22 10:32:35,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:35,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 10:32:35,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372162919] [2020-12-22 10:32:35,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 10:32:35,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:35,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 10:32:35,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:32:35,944 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 8 states. [2020-12-22 10:32:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:36,403 INFO L93 Difference]: Finished difference Result 2599 states and 8709 transitions. [2020-12-22 10:32:36,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 10:32:36,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-22 10:32:36,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:36,410 INFO L225 Difference]: With dead ends: 2599 [2020-12-22 10:32:36,410 INFO L226 Difference]: Without dead ends: 2535 [2020-12-22 10:32:36,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-22 10:32:36,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2020-12-22 10:32:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2102. [2020-12-22 10:32:36,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-12-22 10:32:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7273 transitions. [2020-12-22 10:32:36,477 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7273 transitions. Word has length 24 [2020-12-22 10:32:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:36,477 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7273 transitions. [2020-12-22 10:32:36,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 10:32:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7273 transitions. [2020-12-22 10:32:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 10:32:36,480 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:36,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:36,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-22 10:32:36,480 INFO L429 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]=== [2020-12-22 10:32:36,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:36,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1176290112, now seen corresponding path program 3 times [2020-12-22 10:32:36,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:36,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790350041] [2020-12-22 10:32:36,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:36,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790350041] [2020-12-22 10:32:36,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:36,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-22 10:32:36,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426236060] [2020-12-22 10:32:36,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 10:32:36,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:36,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 10:32:36,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-22 10:32:36,638 INFO L87 Difference]: Start difference. First operand 2102 states and 7273 transitions. Second operand 9 states. [2020-12-22 10:32:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:37,180 INFO L93 Difference]: Finished difference Result 2898 states and 9677 transitions. [2020-12-22 10:32:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 10:32:37,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-12-22 10:32:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:37,188 INFO L225 Difference]: With dead ends: 2898 [2020-12-22 10:32:37,188 INFO L226 Difference]: Without dead ends: 2834 [2020-12-22 10:32:37,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-22 10:32:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2020-12-22 10:32:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2093. [2020-12-22 10:32:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2020-12-22 10:32:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 7255 transitions. [2020-12-22 10:32:37,230 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 7255 transitions. Word has length 24 [2020-12-22 10:32:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:37,230 INFO L481 AbstractCegarLoop]: Abstraction has 2093 states and 7255 transitions. [2020-12-22 10:32:37,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 10:32:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 7255 transitions. [2020-12-22 10:32:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 10:32:37,233 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:37,233 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:37,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-22 10:32:37,233 INFO L429 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]=== [2020-12-22 10:32:37,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1572220842, now seen corresponding path program 4 times [2020-12-22 10:32:37,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:37,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902904506] [2020-12-22 10:32:37,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:37,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902904506] [2020-12-22 10:32:37,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:37,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-22 10:32:37,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704862763] [2020-12-22 10:32:37,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-22 10:32:37,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:37,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-22 10:32:37,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-22 10:32:37,434 INFO L87 Difference]: Start difference. First operand 2093 states and 7255 transitions. Second operand 10 states. [2020-12-22 10:32:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:37,981 INFO L93 Difference]: Finished difference Result 2875 states and 9618 transitions. [2020-12-22 10:32:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 10:32:37,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-12-22 10:32:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:37,989 INFO L225 Difference]: With dead ends: 2875 [2020-12-22 10:32:37,989 INFO L226 Difference]: Without dead ends: 2811 [2020-12-22 10:32:37,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-12-22 10:32:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2020-12-22 10:32:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2079. [2020-12-22 10:32:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2020-12-22 10:32:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 7214 transitions. [2020-12-22 10:32:38,055 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 7214 transitions. Word has length 24 [2020-12-22 10:32:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:38,055 INFO L481 AbstractCegarLoop]: Abstraction has 2079 states and 7214 transitions. [2020-12-22 10:32:38,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-22 10:32:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 7214 transitions. [2020-12-22 10:32:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 10:32:38,059 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:38,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:38,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-22 10:32:38,060 INFO L429 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]=== [2020-12-22 10:32:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:38,060 INFO L82 PathProgramCache]: Analyzing trace with hash 438749216, now seen corresponding path program 5 times [2020-12-22 10:32:38,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:38,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209561854] [2020-12-22 10:32:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:38,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209561854] [2020-12-22 10:32:38,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:38,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 10:32:38,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848193739] [2020-12-22 10:32:38,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 10:32:38,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:38,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 10:32:38,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-22 10:32:38,235 INFO L87 Difference]: Start difference. First operand 2079 states and 7214 transitions. Second operand 11 states. [2020-12-22 10:32:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:38,694 INFO L93 Difference]: Finished difference Result 3106 states and 10587 transitions. [2020-12-22 10:32:38,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 10:32:38,695 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-22 10:32:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:38,703 INFO L225 Difference]: With dead ends: 3106 [2020-12-22 10:32:38,703 INFO L226 Difference]: Without dead ends: 3042 [2020-12-22 10:32:38,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-12-22 10:32:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2020-12-22 10:32:38,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2071. [2020-12-22 10:32:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2020-12-22 10:32:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7186 transitions. [2020-12-22 10:32:38,755 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7186 transitions. Word has length 24 [2020-12-22 10:32:38,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:38,755 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 7186 transitions. [2020-12-22 10:32:38,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 10:32:38,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7186 transitions. [2020-12-22 10:32:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 10:32:38,758 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:38,758 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:38,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-22 10:32:38,758 INFO L429 AbstractCegarLoop]: === Iteration 43 === [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]=== [2020-12-22 10:32:38,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:38,759 INFO L82 PathProgramCache]: Analyzing trace with hash 991769996, now seen corresponding path program 6 times [2020-12-22 10:32:38,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:38,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592998379] [2020-12-22 10:32:38,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:38,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592998379] [2020-12-22 10:32:38,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:38,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 10:32:38,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610067822] [2020-12-22 10:32:38,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 10:32:38,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:38,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 10:32:38,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-22 10:32:38,957 INFO L87 Difference]: Start difference. First operand 2071 states and 7186 transitions. Second operand 11 states. [2020-12-22 10:32:39,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:39,322 INFO L93 Difference]: Finished difference Result 2481 states and 8355 transitions. [2020-12-22 10:32:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:32:39,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-22 10:32:39,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:39,329 INFO L225 Difference]: With dead ends: 2481 [2020-12-22 10:32:39,329 INFO L226 Difference]: Without dead ends: 2417 [2020-12-22 10:32:39,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2020-12-22 10:32:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2020-12-22 10:32:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2039. [2020-12-22 10:32:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2020-12-22 10:32:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 7058 transitions. [2020-12-22 10:32:39,369 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 7058 transitions. Word has length 24 [2020-12-22 10:32:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:39,369 INFO L481 AbstractCegarLoop]: Abstraction has 2039 states and 7058 transitions. [2020-12-22 10:32:39,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 10:32:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 7058 transitions. [2020-12-22 10:32:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 10:32:39,373 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:39,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:39,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-22 10:32:39,373 INFO L429 AbstractCegarLoop]: === Iteration 44 === [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]=== [2020-12-22 10:32:39,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:39,374 INFO L82 PathProgramCache]: Analyzing trace with hash 71780478, now seen corresponding path program 7 times [2020-12-22 10:32:39,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:39,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829968269] [2020-12-22 10:32:39,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:39,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829968269] [2020-12-22 10:32:39,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:39,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 10:32:39,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133314722] [2020-12-22 10:32:39,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 10:32:39,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:39,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 10:32:39,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-12-22 10:32:39,781 INFO L87 Difference]: Start difference. First operand 2039 states and 7058 transitions. Second operand 13 states. [2020-12-22 10:32:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:40,993 INFO L93 Difference]: Finished difference Result 3018 states and 10169 transitions. [2020-12-22 10:32:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 10:32:40,994 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2020-12-22 10:32:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:41,001 INFO L225 Difference]: With dead ends: 3018 [2020-12-22 10:32:41,002 INFO L226 Difference]: Without dead ends: 2890 [2020-12-22 10:32:41,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-22 10:32:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-12-22 10:32:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1971. [2020-12-22 10:32:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2020-12-22 10:32:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 6882 transitions. [2020-12-22 10:32:41,044 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 6882 transitions. Word has length 24 [2020-12-22 10:32:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:41,044 INFO L481 AbstractCegarLoop]: Abstraction has 1971 states and 6882 transitions. [2020-12-22 10:32:41,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 10:32:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 6882 transitions. [2020-12-22 10:32:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 10:32:41,047 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:41,047 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:41,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-22 10:32:41,047 INFO L429 AbstractCegarLoop]: === Iteration 45 === [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]=== [2020-12-22 10:32:41,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:41,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1318319474, now seen corresponding path program 1 times [2020-12-22 10:32:41,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:41,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124266265] [2020-12-22 10:32:41,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:41,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124266265] [2020-12-22 10:32:41,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:41,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 10:32:41,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610276172] [2020-12-22 10:32:41,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 10:32:41,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:41,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 10:32:41,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-22 10:32:41,351 INFO L87 Difference]: Start difference. First operand 1971 states and 6882 transitions. Second operand 12 states. [2020-12-22 10:32:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:41,869 INFO L93 Difference]: Finished difference Result 3157 states and 10632 transitions. [2020-12-22 10:32:41,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 10:32:41,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-12-22 10:32:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:41,877 INFO L225 Difference]: With dead ends: 3157 [2020-12-22 10:32:41,878 INFO L226 Difference]: Without dead ends: 3133 [2020-12-22 10:32:41,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-22 10:32:41,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2020-12-22 10:32:41,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 1613. [2020-12-22 10:32:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2020-12-22 10:32:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5563 transitions. [2020-12-22 10:32:41,920 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 5563 transitions. Word has length 24 [2020-12-22 10:32:41,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:41,921 INFO L481 AbstractCegarLoop]: Abstraction has 1613 states and 5563 transitions. [2020-12-22 10:32:41,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 10:32:41,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 5563 transitions. [2020-12-22 10:32:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 10:32:41,925 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:41,925 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:41,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-22 10:32:41,925 INFO L429 AbstractCegarLoop]: === Iteration 46 === [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]=== [2020-12-22 10:32:41,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:41,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1290250801, now seen corresponding path program 1 times [2020-12-22 10:32:41,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:41,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498943384] [2020-12-22 10:32:41,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:42,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498943384] [2020-12-22 10:32:42,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:42,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 10:32:42,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337172490] [2020-12-22 10:32:42,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 10:32:42,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:42,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 10:32:42,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-22 10:32:42,185 INFO L87 Difference]: Start difference. First operand 1613 states and 5563 transitions. Second operand 12 states. [2020-12-22 10:32:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:43,032 INFO L93 Difference]: Finished difference Result 2298 states and 7608 transitions. [2020-12-22 10:32:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 10:32:43,033 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-22 10:32:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:43,038 INFO L225 Difference]: With dead ends: 2298 [2020-12-22 10:32:43,038 INFO L226 Difference]: Without dead ends: 2254 [2020-12-22 10:32:43,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2020-12-22 10:32:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2020-12-22 10:32:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1611. [2020-12-22 10:32:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2020-12-22 10:32:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 5567 transitions. [2020-12-22 10:32:43,089 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 5567 transitions. Word has length 26 [2020-12-22 10:32:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:43,089 INFO L481 AbstractCegarLoop]: Abstraction has 1611 states and 5567 transitions. [2020-12-22 10:32:43,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 10:32:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 5567 transitions. [2020-12-22 10:32:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 10:32:43,093 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:43,094 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:43,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-22 10:32:43,094 INFO L429 AbstractCegarLoop]: === Iteration 47 === [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]=== [2020-12-22 10:32:43,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash -943856693, now seen corresponding path program 2 times [2020-12-22 10:32:43,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:43,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70582731] [2020-12-22 10:32:43,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:43,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70582731] [2020-12-22 10:32:43,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:43,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 10:32:43,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290218956] [2020-12-22 10:32:43,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 10:32:43,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:43,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 10:32:43,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-22 10:32:43,362 INFO L87 Difference]: Start difference. First operand 1611 states and 5567 transitions. Second operand 12 states. [2020-12-22 10:32:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:43,937 INFO L93 Difference]: Finished difference Result 2242 states and 7477 transitions. [2020-12-22 10:32:43,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 10:32:43,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-22 10:32:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:43,942 INFO L225 Difference]: With dead ends: 2242 [2020-12-22 10:32:43,943 INFO L226 Difference]: Without dead ends: 2198 [2020-12-22 10:32:43,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-22 10:32:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2020-12-22 10:32:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1587. [2020-12-22 10:32:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-12-22 10:32:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 5509 transitions. [2020-12-22 10:32:43,968 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 5509 transitions. Word has length 26 [2020-12-22 10:32:43,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:43,968 INFO L481 AbstractCegarLoop]: Abstraction has 1587 states and 5509 transitions. [2020-12-22 10:32:43,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 10:32:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 5509 transitions. [2020-12-22 10:32:43,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 10:32:43,970 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:43,970 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:43,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-22 10:32:43,970 INFO L429 AbstractCegarLoop]: === Iteration 48 === [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]=== [2020-12-22 10:32:43,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:43,971 INFO L82 PathProgramCache]: Analyzing trace with hash -390835913, now seen corresponding path program 3 times [2020-12-22 10:32:43,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:43,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146072481] [2020-12-22 10:32:43,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:44,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:44,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146072481] [2020-12-22 10:32:44,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:44,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 10:32:44,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813841388] [2020-12-22 10:32:44,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 10:32:44,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:44,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 10:32:44,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-22 10:32:44,218 INFO L87 Difference]: Start difference. First operand 1587 states and 5509 transitions. Second operand 12 states. [2020-12-22 10:32:44,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:44,735 INFO L93 Difference]: Finished difference Result 1640 states and 5473 transitions. [2020-12-22 10:32:44,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 10:32:44,736 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-22 10:32:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:44,741 INFO L225 Difference]: With dead ends: 1640 [2020-12-22 10:32:44,741 INFO L226 Difference]: Without dead ends: 1596 [2020-12-22 10:32:44,741 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-22 10:32:44,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2020-12-22 10:32:44,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 885. [2020-12-22 10:32:44,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-22 10:32:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-12-22 10:32:44,761 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-12-22 10:32:44,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:44,761 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-12-22 10:32:44,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 10:32:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-12-22 10:32:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-22 10:32:44,763 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:44,764 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:44,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-22 10:32:44,764 INFO L429 AbstractCegarLoop]: === Iteration 49 === [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]=== [2020-12-22 10:32:44,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:44,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1977826857, now seen corresponding path program 1 times [2020-12-22 10:32:44,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:44,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065534096] [2020-12-22 10:32:44,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:44,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065534096] [2020-12-22 10:32:44,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:44,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-22 10:32:44,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081983269] [2020-12-22 10:32:44,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 10:32:44,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:44,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 10:32:44,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:32:44,946 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-12-22 10:32:45,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:45,253 INFO L93 Difference]: Finished difference Result 885 states and 3021 transitions. [2020-12-22 10:32:45,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:32:45,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-22 10:32:45,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:45,257 INFO L225 Difference]: With dead ends: 885 [2020-12-22 10:32:45,257 INFO L226 Difference]: Without dead ends: 885 [2020-12-22 10:32:45,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-22 10:32:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2020-12-22 10:32:45,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2020-12-22 10:32:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-22 10:32:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3021 transitions. [2020-12-22 10:32:45,281 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3021 transitions. Word has length 41 [2020-12-22 10:32:45,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:45,281 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3021 transitions. [2020-12-22 10:32:45,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 10:32:45,281 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3021 transitions. [2020-12-22 10:32:45,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-22 10:32:45,284 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:45,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:45,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-22 10:32:45,285 INFO L429 AbstractCegarLoop]: === Iteration 50 === [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]=== [2020-12-22 10:32:45,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:45,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1154622732, now seen corresponding path program 1 times [2020-12-22 10:32:45,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:45,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421921607] [2020-12-22 10:32:45,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:45,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421921607] [2020-12-22 10:32:45,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:45,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 10:32:45,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235764111] [2020-12-22 10:32:45,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 10:32:45,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:45,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 10:32:45,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:32:45,385 INFO L87 Difference]: Start difference. First operand 885 states and 3021 transitions. Second operand 7 states. [2020-12-22 10:32:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:45,548 INFO L93 Difference]: Finished difference Result 885 states and 3017 transitions. [2020-12-22 10:32:45,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:32:45,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-22 10:32:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:45,551 INFO L225 Difference]: With dead ends: 885 [2020-12-22 10:32:45,551 INFO L226 Difference]: Without dead ends: 741 [2020-12-22 10:32:45,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-22 10:32:45,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-22 10:32:45,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-22 10:32:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-22 10:32:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2489 transitions. [2020-12-22 10:32:45,567 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2489 transitions. Word has length 41 [2020-12-22 10:32:45,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:45,568 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2489 transitions. [2020-12-22 10:32:45,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 10:32:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2489 transitions. [2020-12-22 10:32:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-22 10:32:45,570 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:45,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:45,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-22 10:32:45,570 INFO L429 AbstractCegarLoop]: === Iteration 51 === [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]=== [2020-12-22 10:32:45,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:45,571 INFO L82 PathProgramCache]: Analyzing trace with hash -267308717, now seen corresponding path program 1 times [2020-12-22 10:32:45,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:45,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490430321] [2020-12-22 10:32:45,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:45,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490430321] [2020-12-22 10:32:45,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:45,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-22 10:32:45,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833060745] [2020-12-22 10:32:45,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 10:32:45,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:45,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 10:32:45,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:32:45,734 INFO L87 Difference]: Start difference. First operand 741 states and 2489 transitions. Second operand 8 states. [2020-12-22 10:32:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:45,974 INFO L93 Difference]: Finished difference Result 741 states and 2481 transitions. [2020-12-22 10:32:45,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:32:45,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-22 10:32:45,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:45,978 INFO L225 Difference]: With dead ends: 741 [2020-12-22 10:32:45,978 INFO L226 Difference]: Without dead ends: 741 [2020-12-22 10:32:45,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-22 10:32:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-22 10:32:45,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-22 10:32:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-22 10:32:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2481 transitions. [2020-12-22 10:32:45,997 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2481 transitions. Word has length 41 [2020-12-22 10:32:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:45,998 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2481 transitions. [2020-12-22 10:32:45,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 10:32:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2481 transitions. [2020-12-22 10:32:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-22 10:32:46,000 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:46,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:46,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-22 10:32:46,000 INFO L429 AbstractCegarLoop]: === Iteration 52 === [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]=== [2020-12-22 10:32:46,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:46,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1194300753, now seen corresponding path program 1 times [2020-12-22 10:32:46,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:46,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682618906] [2020-12-22 10:32:46,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:32:46,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:32:46,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682618906] [2020-12-22 10:32:46,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:32:46,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-22 10:32:46,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407922928] [2020-12-22 10:32:46,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 10:32:46,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:32:46,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 10:32:46,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:32:46,111 INFO L87 Difference]: Start difference. First operand 741 states and 2481 transitions. Second operand 7 states. [2020-12-22 10:32:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:32:46,268 INFO L93 Difference]: Finished difference Result 741 states and 2477 transitions. [2020-12-22 10:32:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:32:46,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-22 10:32:46,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:32:46,271 INFO L225 Difference]: With dead ends: 741 [2020-12-22 10:32:46,272 INFO L226 Difference]: Without dead ends: 495 [2020-12-22 10:32:46,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-22 10:32:46,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-12-22 10:32:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2020-12-22 10:32:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2020-12-22 10:32:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1606 transitions. [2020-12-22 10:32:46,290 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1606 transitions. Word has length 41 [2020-12-22 10:32:46,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:32:46,290 INFO L481 AbstractCegarLoop]: Abstraction has 495 states and 1606 transitions. [2020-12-22 10:32:46,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 10:32:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1606 transitions. [2020-12-22 10:32:46,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-22 10:32:46,293 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:32:46,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:32:46,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-22 10:32:46,293 INFO L429 AbstractCegarLoop]: === Iteration 53 === [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]=== [2020-12-22 10:32:46,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:32:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1766059350, now seen corresponding path program 1 times [2020-12-22 10:32:46,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:32:46,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416108815] [2020-12-22 10:32:46,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:32:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 10:32:46,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 10:32:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 10:32:46,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 10:32:46,390 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 10:32:46,391 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 10:32:46,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-22 10:32:46,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 10:32:46 BasicIcfg [2020-12-22 10:32:46,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 10:32:46,567 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 10:32:46,567 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 10:32:46,569 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 10:32:46,569 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:31:53" (3/4) ... [2020-12-22 10:32:46,572 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 10:32:46,759 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread/singleton.i-witness.graphml [2020-12-22 10:32:46,759 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 10:32:46,761 INFO L168 Benchmark]: Toolchain (without parser) took 55606.72 ms. Allocated memory was 151.0 MB in the beginning and 1.1 GB in the end (delta: 971.0 MB). Free memory was 124.7 MB in the beginning and 710.7 MB in the end (delta: -586.0 MB). Peak memory consumption was 385.6 MB. Max. memory is 8.0 GB. [2020-12-22 10:32:46,761 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory was 123.0 MB in the beginning and 122.9 MB in the end (delta: 96.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 10:32:46,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1104.81 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 87.1 MB in the end (delta: 37.4 MB). Peak memory consumption was 37.7 MB. Max. memory is 8.0 GB. [2020-12-22 10:32:46,762 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.12 ms. Allocated memory is still 151.0 MB. Free memory was 87.1 MB in the beginning and 84.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 10:32:46,762 INFO L168 Benchmark]: Boogie Preprocessor took 40.84 ms. Allocated memory is still 151.0 MB. Free memory was 84.4 MB in the beginning and 83.4 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-22 10:32:46,763 INFO L168 Benchmark]: RCFGBuilder took 697.02 ms. Allocated memory is still 151.0 MB. Free memory was 82.9 MB in the beginning and 56.1 MB in the end (delta: 26.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. [2020-12-22 10:32:46,763 INFO L168 Benchmark]: TraceAbstraction took 53469.33 ms. Allocated memory was 151.0 MB in the beginning and 1.1 GB in the end (delta: 971.0 MB). Free memory was 56.1 MB in the beginning and 731.7 MB in the end (delta: -675.5 MB). Peak memory consumption was 295.4 MB. Max. memory is 8.0 GB. [2020-12-22 10:32:46,764 INFO L168 Benchmark]: Witness Printer took 192.30 ms. Allocated memory is still 1.1 GB. Free memory was 731.7 MB in the beginning and 710.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. [2020-12-22 10:32:46,768 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.23 ms. Allocated memory is still 151.0 MB. Free memory was 123.0 MB in the beginning and 122.9 MB in the end (delta: 96.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1104.81 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 87.1 MB in the end (delta: 37.4 MB). Peak memory consumption was 37.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 92.12 ms. Allocated memory is still 151.0 MB. Free memory was 87.1 MB in the beginning and 84.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 40.84 ms. Allocated memory is still 151.0 MB. Free memory was 84.4 MB in the beginning and 83.4 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 697.02 ms. Allocated memory is still 151.0 MB. Free memory was 82.9 MB in the beginning and 56.1 MB in the end (delta: 26.7 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 53469.33 ms. Allocated memory was 151.0 MB in the beginning and 1.1 GB in the end (delta: 971.0 MB). Free memory was 56.1 MB in the beginning and 731.7 MB in the end (delta: -675.5 MB). Peak memory consumption was 295.4 MB. Max. memory is 8.0 GB. * Witness Printer took 192.30 ms. Allocated memory is still 1.1 GB. Free memory was 731.7 MB in the beginning and 710.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 3374 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 1145 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.4s, 167 PlacesBefore, 93 PlacesAfterwards, 248 TransitionsBefore, 173 TransitionsAfterwards, 4156 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 49018 MoverChecksTotal - 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; [L1161] 0 pthread_t t; [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; [L1163] 0 \read(t) VAL [arg={0:0}, arg={0:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14: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={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) [L1128] 2 return 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))={7:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={7: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))={7:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={7: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))={7:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={7: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))={7:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={7:0}] [L1133] 5 v[0] = 'X' [L1135] 5 return 0; [L1133] 3 v[0] = 'X' [L1135] 3 return 0; [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={7:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={7: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))={7:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={7: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))={7:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={7:0}] [L1154] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={7:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={7:0}] [L1133] 6 v[0] = 'X' [L1135] 6 return 0; [L1140] 4 v[0] = 'Y' [L1142] 4 return 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))={7:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={7: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))={7:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={7: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))={7:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={7: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))={7:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={7: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))={7:0}, t1={15:0}, t2={9:0}, t3={17:0}, t4={16:0}, t5={14:0}, v={7:0}] [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 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))={7:0}, v={7:0}] [L1164] 0 v[0] [L1123] COND TRUE 0 !expression [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))={7:0}, v={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 52.8s, OverallIterations: 53, TraceHistogramMax: 1, AutomataDifference: 29.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 5380 SDtfs, 11076 SDslu, 16167 SDs, 0 SdLazy, 10055 SolverSat, 1668 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 60 SyntacticMatches, 18 SemanticMatches, 625 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 18.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4305occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.3s AutomataMinimizationTime, 52 MinimizatonAttempts, 47589 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 1193 NumberOfCodeBlocks, 1193 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1100 ConstructedInterpolants, 0 QuantifiedInterpolants, 426321 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 52 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...