/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-bitabs-178dd20 [2021-01-06 22:56:48,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 22:56:48,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 22:56:48,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 22:56:48,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 22:56:48,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 22:56:48,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 22:56:48,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 22:56:48,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 22:56:48,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 22:56:48,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 22:56:49,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 22:56:49,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 22:56:49,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 22:56:49,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 22:56:49,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 22:56:49,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 22:56:49,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 22:56:49,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 22:56:49,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 22:56:49,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 22:56:49,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 22:56:49,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 22:56:49,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 22:56:49,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 22:56:49,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 22:56:49,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 22:56:49,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 22:56:49,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 22:56:49,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 22:56:49,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 22:56:49,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 22:56:49,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 22:56:49,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 22:56:49,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 22:56:49,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 22:56:49,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 22:56:49,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 22:56:49,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 22:56:49,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 22:56:49,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 22:56:49,105 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 22:56:49,175 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 22:56:49,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 22:56:49,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 22:56:49,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 22:56:49,182 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 22:56:49,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 22:56:49,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 22:56:49,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 22:56:49,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 22:56:49,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 22:56:49,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 22:56:49,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 22:56:49,186 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 22:56:49,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 22:56:49,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 22:56:49,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 22:56:49,187 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 22:56:49,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 22:56:49,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 22:56:49,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 22:56:49,188 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 22:56:49,188 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 22:56:49,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 22:56:49,189 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 22:56:49,189 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 22:56:49,190 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-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 22:56:49,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 22:56:49,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 22:56:49,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 22:56:49,766 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 22:56:49,770 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 22:56:49,771 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton.i [2021-01-06 22:56:49,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7497df97a/5c16e102a2184220a971722ea060a169/FLAG2908b93c7 [2021-01-06 22:56:51,057 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 22:56:51,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i [2021-01-06 22:56:51,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7497df97a/5c16e102a2184220a971722ea060a169/FLAG2908b93c7 [2021-01-06 22:56:51,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/7497df97a/5c16e102a2184220a971722ea060a169 [2021-01-06 22:56:51,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 22:56:51,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 22:56:51,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 22:56:51,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 22:56:51,181 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 22:56:51,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 10:56:51" (1/1) ... [2021-01-06 22:56:51,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643e877b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:51, skipping insertion in model container [2021-01-06 22:56:51,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 10:56:51" (1/1) ... [2021-01-06 22:56:51,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 22:56:51,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 22:56:51,564 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-01-06 22:56:51,998 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i[55547,55560] left hand side expression in assignment: lhs: VariableLHS[~v~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~v~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~v~0,GLOBAL],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~v~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~v~0,GLOBAL],offset]]] [2021-01-06 22:56:52,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 22:56:52,045 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 22:56:52,093 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-01-06 22:56:52,141 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i[55547,55560] left hand side expression in assignment: lhs: VariableLHS[~v~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~v~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~v~0,GLOBAL],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~v~0,GLOBAL],base],StructAccessExpression[IdentifierExpression[~v~0,GLOBAL],offset]]] [2021-01-06 22:56:52,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 22:56:52,417 INFO L208 MainTranslator]: Completed translation [2021-01-06 22:56:52,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:52 WrapperNode [2021-01-06 22:56:52,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 22:56:52,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 22:56:52,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 22:56:52,425 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 22:56:52,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:52" (1/1) ... [2021-01-06 22:56:52,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:52" (1/1) ... [2021-01-06 22:56:52,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 22:56:52,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 22:56:52,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 22:56:52,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 22:56:52,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:52" (1/1) ... [2021-01-06 22:56:52,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:52" (1/1) ... [2021-01-06 22:56:52,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:52" (1/1) ... [2021-01-06 22:56:52,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:52" (1/1) ... [2021-01-06 22:56:52,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:52" (1/1) ... [2021-01-06 22:56:52,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:52" (1/1) ... [2021-01-06 22:56:52,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:52" (1/1) ... [2021-01-06 22:56:52,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 22:56:52,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 22:56:52,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 22:56:52,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 22:56:52,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 22:56:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-01-06 22:56:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 22:56:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 22:56:52,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-01-06 22:56:52,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 22:56:52,729 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-01-06 22:56:52,729 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-01-06 22:56:52,729 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-01-06 22:56:52,729 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-01-06 22:56:52,730 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-01-06 22:56:52,730 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-01-06 22:56:52,730 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-01-06 22:56:52,730 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-01-06 22:56:52,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 22:56:52,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 22:56:52,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 22:56:52,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 22:56:52,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 22:56:52,734 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-01-06 22:56:53,549 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 22:56:53,550 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-01-06 22:56:53,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:56:53 BoogieIcfgContainer [2021-01-06 22:56:53,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 22:56:53,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 22:56:53,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 22:56:53,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 22:56:53,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 10:56:51" (1/3) ... [2021-01-06 22:56:53,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788d1ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 10:56:53, skipping insertion in model container [2021-01-06 22:56:53,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:52" (2/3) ... [2021-01-06 22:56:53,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788d1ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 10:56:53, skipping insertion in model container [2021-01-06 22:56:53,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:56:53" (3/3) ... [2021-01-06 22:56:53,568 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2021-01-06 22:56:53,578 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-01-06 22:56:53,579 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 22:56:53,586 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 22:56:53,587 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-01-06 22:56:53,684 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,684 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,685 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,685 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,685 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,686 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,686 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,686 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,686 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,686 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,687 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,687 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,688 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,688 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,689 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,689 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,689 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,690 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,690 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,690 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,691 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,691 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,691 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,691 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,692 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,692 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,692 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,692 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,693 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,693 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,693 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,693 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,694 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,695 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,695 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,695 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,696 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,696 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,696 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,696 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,698 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,698 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,698 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,698 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,699 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,699 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,699 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,700 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,700 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,700 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,701 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,701 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,701 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,701 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,702 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,702 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,702 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,702 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,703 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,703 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,703 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,704 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,704 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,704 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,704 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,705 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,705 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,705 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,705 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,705 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,706 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,706 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,706 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,707 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,707 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,707 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,707 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,708 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,708 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,708 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,709 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,709 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,709 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,709 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,710 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,710 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,710 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,710 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,711 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,711 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,711 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,711 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,712 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,712 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,712 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,712 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,713 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,713 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,713 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,714 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,714 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,714 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,714 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,715 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,715 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,715 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,716 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,716 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,716 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,716 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,716 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,717 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,717 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,717 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,717 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,718 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,718 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,718 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,718 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,718 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,718 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,719 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,719 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,719 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,719 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,720 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,720 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,720 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,720 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,721 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,721 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,721 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,721 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,722 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,722 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,722 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,722 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,722 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,723 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,723 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,723 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,723 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,724 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,724 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,724 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,724 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,725 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,725 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,725 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,725 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,726 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,726 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,726 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,727 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,727 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,727 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,727 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,728 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,728 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,728 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,728 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,728 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,729 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,729 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,729 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,730 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,730 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,733 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,734 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,734 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,734 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,734 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,734 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,734 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,735 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,735 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,738 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,739 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,739 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,739 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,739 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,740 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,740 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,740 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,740 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,741 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,741 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,741 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,741 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,742 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,742 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,743 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,744 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,744 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,744 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,744 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,745 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,745 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,745 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,745 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,753 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,754 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,755 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,755 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,764 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,765 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,765 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,765 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,768 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,769 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,769 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,769 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,772 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,772 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,773 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,773 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,773 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,773 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,776 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,777 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,777 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,777 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,778 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,778 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,778 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,778 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,778 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,779 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,779 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,779 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,779 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,780 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,780 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,780 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,780 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,780 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,781 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,781 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,781 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,781 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,781 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,782 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,785 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,785 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,786 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,786 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,789 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,790 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,790 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,790 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,790 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,791 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,794 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,795 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,795 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,795 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,798 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,799 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,799 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,799 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,802 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,803 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,803 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,803 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,807 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,807 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,808 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:53,808 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:54,015 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-01-06 22:56:54,042 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-01-06 22:56:54,091 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 22:56:54,092 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 22:56:54,092 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 22:56:54,092 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 22:56:54,092 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 22:56:54,092 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 22:56:54,093 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 22:56:54,093 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 22:56:54,116 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-01-06 22:56:54,119 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 248 transitions, 876 flow [2021-01-06 22:56:54,124 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 248 transitions, 876 flow [2021-01-06 22:56:54,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 248 transitions, 876 flow [2021-01-06 22:56:54,258 INFO L129 PetriNetUnfolder]: 61/274 cut-off events. [2021-01-06 22:56:54,258 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-01-06 22:56:54,282 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. [2021-01-06 22:56:54,304 INFO L116 LiptonReduction]: Number of co-enabled transitions 4156 [2021-01-06 22:56:57,767 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-01-06 22:56:57,900 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-06 22:56:58,042 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-01-06 22:56:58,165 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2021-01-06 22:56:58,619 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-01-06 22:56:58,874 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-01-06 22:56:59,084 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-01-06 22:56:59,222 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-01-06 22:56:59,357 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-01-06 22:56:59,488 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-01-06 22:56:59,838 INFO L131 LiptonReduction]: Checked pairs total: 49018 [2021-01-06 22:56:59,838 INFO L133 LiptonReduction]: Total number of compositions: 81 [2021-01-06 22:56:59,848 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 173 transitions, 726 flow [2021-01-06 22:57:00,496 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2021-01-06 22:57:00,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2021-01-06 22:57:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-06 22:57:00,509 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:00,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:00,511 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]=== [2021-01-06 22:57:00,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:00,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1391244601, now seen corresponding path program 1 times [2021-01-06 22:57:00,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:00,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765516863] [2021-01-06 22:57:00,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:01,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765516863] [2021-01-06 22:57:01,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:01,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:01,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628673510] [2021-01-06 22:57:01,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:01,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:01,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:01,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:01,043 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2021-01-06 22:57:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:01,476 INFO L93 Difference]: Finished difference Result 6012 states and 25679 transitions. [2021-01-06 22:57:01,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:01,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2021-01-06 22:57:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:01,659 INFO L225 Difference]: With dead ends: 6012 [2021-01-06 22:57:01,659 INFO L226 Difference]: Without dead ends: 5524 [2021-01-06 22:57:01,661 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 [2021-01-06 22:57:01,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2021-01-06 22:57:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 3018. [2021-01-06 22:57:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2021-01-06 22:57:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2021-01-06 22:57:02,074 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2021-01-06 22:57:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:02,075 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2021-01-06 22:57:02,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2021-01-06 22:57:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-06 22:57:02,076 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:02,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:02,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 22:57:02,077 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]=== [2021-01-06 22:57:02,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:02,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1473766845, now seen corresponding path program 2 times [2021-01-06 22:57:02,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:02,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430340972] [2021-01-06 22:57:02,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:02,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430340972] [2021-01-06 22:57:02,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:02,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:02,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513221883] [2021-01-06 22:57:02,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:02,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:02,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:02,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:02,190 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2021-01-06 22:57:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:02,479 INFO L93 Difference]: Finished difference Result 4266 states and 18042 transitions. [2021-01-06 22:57:02,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 22:57:02,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2021-01-06 22:57:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:02,536 INFO L225 Difference]: With dead ends: 4266 [2021-01-06 22:57:02,536 INFO L226 Difference]: Without dead ends: 4266 [2021-01-06 22:57:02,537 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 [2021-01-06 22:57:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2021-01-06 22:57:02,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 3008. [2021-01-06 22:57:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2021-01-06 22:57:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2021-01-06 22:57:02,907 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2021-01-06 22:57:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:02,907 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2021-01-06 22:57:02,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2021-01-06 22:57:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 22:57:02,911 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:02,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:02,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 22:57:02,912 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]=== [2021-01-06 22:57:02,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:02,913 INFO L82 PathProgramCache]: Analyzing trace with hash -658761216, now seen corresponding path program 1 times [2021-01-06 22:57:02,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:02,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927277408] [2021-01-06 22:57:02,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:03,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927277408] [2021-01-06 22:57:03,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:03,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 22:57:03,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404735675] [2021-01-06 22:57:03,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 22:57:03,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:03,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 22:57:03,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 22:57:03,045 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2021-01-06 22:57:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:03,182 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2021-01-06 22:57:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 22:57:03,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2021-01-06 22:57:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:03,225 INFO L225 Difference]: With dead ends: 4848 [2021-01-06 22:57:03,225 INFO L226 Difference]: Without dead ends: 3558 [2021-01-06 22:57:03,226 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 [2021-01-06 22:57:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2021-01-06 22:57:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2021-01-06 22:57:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2021-01-06 22:57:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2021-01-06 22:57:03,499 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2021-01-06 22:57:03,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:03,500 INFO L481 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2021-01-06 22:57:03,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 22:57:03,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2021-01-06 22:57:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 22:57:03,506 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:03,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:03,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 22:57:03,507 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]=== [2021-01-06 22:57:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:03,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1053238145, now seen corresponding path program 1 times [2021-01-06 22:57:03,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:03,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626459980] [2021-01-06 22:57:03,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:03,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626459980] [2021-01-06 22:57:03,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:03,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:03,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685104438] [2021-01-06 22:57:03,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:03,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:03,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:03,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:03,652 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2021-01-06 22:57:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:04,064 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2021-01-06 22:57:04,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:04,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2021-01-06 22:57:04,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:04,098 INFO L225 Difference]: With dead ends: 4417 [2021-01-06 22:57:04,098 INFO L226 Difference]: Without dead ends: 4393 [2021-01-06 22:57:04,100 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 [2021-01-06 22:57:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2021-01-06 22:57:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2021-01-06 22:57:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2021-01-06 22:57:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2021-01-06 22:57:04,403 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2021-01-06 22:57:04,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:04,405 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2021-01-06 22:57:04,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2021-01-06 22:57:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 22:57:04,411 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:04,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:04,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 22:57:04,415 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]=== [2021-01-06 22:57:04,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:04,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1471262403, now seen corresponding path program 2 times [2021-01-06 22:57:04,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:04,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65794667] [2021-01-06 22:57:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:04,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65794667] [2021-01-06 22:57:04,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:04,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:04,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473290410] [2021-01-06 22:57:04,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:04,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:04,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:04,569 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2021-01-06 22:57:04,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:04,749 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2021-01-06 22:57:04,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 22:57:04,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2021-01-06 22:57:04,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:04,775 INFO L225 Difference]: With dead ends: 4024 [2021-01-06 22:57:04,775 INFO L226 Difference]: Without dead ends: 4024 [2021-01-06 22:57:04,776 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 [2021-01-06 22:57:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2021-01-06 22:57:05,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2021-01-06 22:57:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2021-01-06 22:57:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2021-01-06 22:57:05,068 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2021-01-06 22:57:05,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:05,070 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2021-01-06 22:57:05,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2021-01-06 22:57:05,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 22:57:05,071 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:05,072 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:05,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 22:57:05,072 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]=== [2021-01-06 22:57:05,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:05,073 INFO L82 PathProgramCache]: Analyzing trace with hash -564581282, now seen corresponding path program 1 times [2021-01-06 22:57:05,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:05,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923488131] [2021-01-06 22:57:05,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:05,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923488131] [2021-01-06 22:57:05,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:05,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:05,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505151416] [2021-01-06 22:57:05,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:05,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:05,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:05,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:05,193 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2021-01-06 22:57:05,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:05,525 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2021-01-06 22:57:05,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:05,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-01-06 22:57:05,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:05,560 INFO L225 Difference]: With dead ends: 4225 [2021-01-06 22:57:05,560 INFO L226 Difference]: Without dead ends: 4129 [2021-01-06 22:57:05,561 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 [2021-01-06 22:57:05,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2021-01-06 22:57:05,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2021-01-06 22:57:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2021-01-06 22:57:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2021-01-06 22:57:05,836 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2021-01-06 22:57:05,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:05,837 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2021-01-06 22:57:05,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2021-01-06 22:57:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 22:57:05,839 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:05,839 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:05,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 22:57:05,839 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]=== [2021-01-06 22:57:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:05,840 INFO L82 PathProgramCache]: Analyzing trace with hash -490731172, now seen corresponding path program 2 times [2021-01-06 22:57:05,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:05,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953372930] [2021-01-06 22:57:05,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:06,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953372930] [2021-01-06 22:57:06,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:06,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:06,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666087895] [2021-01-06 22:57:06,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:06,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:06,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:06,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:06,038 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2021-01-06 22:57:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:06,596 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2021-01-06 22:57:06,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 22:57:06,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2021-01-06 22:57:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:06,635 INFO L225 Difference]: With dead ends: 4979 [2021-01-06 22:57:06,635 INFO L226 Difference]: Without dead ends: 4905 [2021-01-06 22:57:06,636 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 [2021-01-06 22:57:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2021-01-06 22:57:06,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2021-01-06 22:57:06,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2021-01-06 22:57:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2021-01-06 22:57:06,906 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2021-01-06 22:57:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:06,907 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2021-01-06 22:57:06,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2021-01-06 22:57:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 22:57:06,909 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:06,909 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:06,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 22:57:06,909 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]=== [2021-01-06 22:57:06,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:06,910 INFO L82 PathProgramCache]: Analyzing trace with hash 991975414, now seen corresponding path program 3 times [2021-01-06 22:57:06,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:06,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090813365] [2021-01-06 22:57:06,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:07,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090813365] [2021-01-06 22:57:07,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:07,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 22:57:07,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449785285] [2021-01-06 22:57:07,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 22:57:07,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:07,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 22:57:07,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 22:57:07,089 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 9 states. [2021-01-06 22:57:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:07,766 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2021-01-06 22:57:07,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:07,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2021-01-06 22:57:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:07,818 INFO L225 Difference]: With dead ends: 6735 [2021-01-06 22:57:07,819 INFO L226 Difference]: Without dead ends: 6661 [2021-01-06 22:57:07,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-01-06 22:57:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2021-01-06 22:57:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2021-01-06 22:57:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2021-01-06 22:57:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2021-01-06 22:57:08,057 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2021-01-06 22:57:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:08,058 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2021-01-06 22:57:08,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 22:57:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2021-01-06 22:57:08,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 22:57:08,060 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:08,061 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:08,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 22:57:08,061 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]=== [2021-01-06 22:57:08,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:08,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1869283970, now seen corresponding path program 4 times [2021-01-06 22:57:08,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:08,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71978462] [2021-01-06 22:57:08,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:08,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71978462] [2021-01-06 22:57:08,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:08,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 22:57:08,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68712955] [2021-01-06 22:57:08,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 22:57:08,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 22:57:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 22:57:08,258 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 9 states. [2021-01-06 22:57:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:08,795 INFO L93 Difference]: Finished difference Result 5385 states and 21914 transitions. [2021-01-06 22:57:08,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:08,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2021-01-06 22:57:08,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:08,825 INFO L225 Difference]: With dead ends: 5385 [2021-01-06 22:57:08,826 INFO L226 Difference]: Without dead ends: 5311 [2021-01-06 22:57:08,827 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 [2021-01-06 22:57:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2021-01-06 22:57:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4125. [2021-01-06 22:57:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2021-01-06 22:57:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 16604 transitions. [2021-01-06 22:57:09,056 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 16604 transitions. Word has length 18 [2021-01-06 22:57:09,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:09,061 INFO L481 AbstractCegarLoop]: Abstraction has 4125 states and 16604 transitions. [2021-01-06 22:57:09,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 22:57:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 16604 transitions. [2021-01-06 22:57:09,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 22:57:09,063 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:09,064 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:09,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 22:57:09,064 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]=== [2021-01-06 22:57:09,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:09,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1339896726, now seen corresponding path program 5 times [2021-01-06 22:57:09,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:09,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233226394] [2021-01-06 22:57:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:09,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233226394] [2021-01-06 22:57:09,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:09,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 22:57:09,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845351955] [2021-01-06 22:57:09,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 22:57:09,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:09,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 22:57:09,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:09,378 INFO L87 Difference]: Start difference. First operand 4125 states and 16604 transitions. Second operand 11 states. [2021-01-06 22:57:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:10,449 INFO L93 Difference]: Finished difference Result 5686 states and 23415 transitions. [2021-01-06 22:57:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 22:57:10,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2021-01-06 22:57:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:10,480 INFO L225 Difference]: With dead ends: 5686 [2021-01-06 22:57:10,480 INFO L226 Difference]: Without dead ends: 5630 [2021-01-06 22:57:10,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-01-06 22:57:10,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2021-01-06 22:57:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4116. [2021-01-06 22:57:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2021-01-06 22:57:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2021-01-06 22:57:10,715 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2021-01-06 22:57:10,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:10,716 INFO L481 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2021-01-06 22:57:10,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 22:57:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2021-01-06 22:57:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 22:57:10,718 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:10,719 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:10,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 22:57:10,719 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]=== [2021-01-06 22:57:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:10,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1845549347, now seen corresponding path program 1 times [2021-01-06 22:57:10,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:10,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603798476] [2021-01-06 22:57:10,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:10,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603798476] [2021-01-06 22:57:10,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:10,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:10,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879018670] [2021-01-06 22:57:10,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:10,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:10,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:10,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:10,797 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 6 states. [2021-01-06 22:57:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:10,974 INFO L93 Difference]: Finished difference Result 4687 states and 18325 transitions. [2021-01-06 22:57:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 22:57:10,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2021-01-06 22:57:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:10,994 INFO L225 Difference]: With dead ends: 4687 [2021-01-06 22:57:10,995 INFO L226 Difference]: Without dead ends: 4687 [2021-01-06 22:57:10,995 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 [2021-01-06 22:57:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2021-01-06 22:57:11,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4131. [2021-01-06 22:57:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2021-01-06 22:57:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16621 transitions. [2021-01-06 22:57:11,207 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16621 transitions. Word has length 19 [2021-01-06 22:57:11,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:11,208 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16621 transitions. [2021-01-06 22:57:11,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16621 transitions. [2021-01-06 22:57:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 22:57:11,210 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:11,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:11,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 22:57:11,211 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]=== [2021-01-06 22:57:11,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:11,211 INFO L82 PathProgramCache]: Analyzing trace with hash 838752707, now seen corresponding path program 2 times [2021-01-06 22:57:11,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:11,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102295259] [2021-01-06 22:57:11,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:11,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102295259] [2021-01-06 22:57:11,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:11,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 22:57:11,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048067440] [2021-01-06 22:57:11,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 22:57:11,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:11,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 22:57:11,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 22:57:11,371 INFO L87 Difference]: Start difference. First operand 4131 states and 16621 transitions. Second operand 7 states. [2021-01-06 22:57:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:11,561 INFO L93 Difference]: Finished difference Result 4619 states and 18100 transitions. [2021-01-06 22:57:11,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 22:57:11,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2021-01-06 22:57:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:11,584 INFO L225 Difference]: With dead ends: 4619 [2021-01-06 22:57:11,585 INFO L226 Difference]: Without dead ends: 4619 [2021-01-06 22:57:11,585 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 [2021-01-06 22:57:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2021-01-06 22:57:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4078. [2021-01-06 22:57:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2021-01-06 22:57:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2021-01-06 22:57:11,783 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2021-01-06 22:57:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:11,784 INFO L481 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2021-01-06 22:57:11,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 22:57:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2021-01-06 22:57:11,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 22:57:11,786 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:11,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:11,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 22:57:11,787 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]=== [2021-01-06 22:57:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:11,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1368539430, now seen corresponding path program 1 times [2021-01-06 22:57:11,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:11,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110146221] [2021-01-06 22:57:11,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:12,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110146221] [2021-01-06 22:57:12,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:12,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 22:57:12,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513595308] [2021-01-06 22:57:12,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 22:57:12,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:12,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 22:57:12,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:12,047 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 10 states. [2021-01-06 22:57:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:12,927 INFO L93 Difference]: Finished difference Result 5300 states and 21612 transitions. [2021-01-06 22:57:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:12,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2021-01-06 22:57:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:12,953 INFO L225 Difference]: With dead ends: 5300 [2021-01-06 22:57:12,954 INFO L226 Difference]: Without dead ends: 5226 [2021-01-06 22:57:12,954 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 [2021-01-06 22:57:12,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2021-01-06 22:57:13,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 4066. [2021-01-06 22:57:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4066 states. [2021-01-06 22:57:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 16392 transitions. [2021-01-06 22:57:13,139 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 16392 transitions. Word has length 19 [2021-01-06 22:57:13,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:13,140 INFO L481 AbstractCegarLoop]: Abstraction has 4066 states and 16392 transitions. [2021-01-06 22:57:13,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 22:57:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 16392 transitions. [2021-01-06 22:57:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 22:57:13,143 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:13,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] [2021-01-06 22:57:13,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 22:57:13,143 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]=== [2021-01-06 22:57:13,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:13,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1392670140, now seen corresponding path program 2 times [2021-01-06 22:57:13,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:13,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156998544] [2021-01-06 22:57:13,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:13,308 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2021-01-06 22:57:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:13,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156998544] [2021-01-06 22:57:13,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:13,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:13,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343076065] [2021-01-06 22:57:13,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:13,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:13,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:13,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:13,584 INFO L87 Difference]: Start difference. First operand 4066 states and 16392 transitions. Second operand 12 states. [2021-01-06 22:57:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:14,799 INFO L93 Difference]: Finished difference Result 5713 states and 23638 transitions. [2021-01-06 22:57:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 22:57:14,800 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2021-01-06 22:57:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:14,821 INFO L225 Difference]: With dead ends: 5713 [2021-01-06 22:57:14,821 INFO L226 Difference]: Without dead ends: 5651 [2021-01-06 22:57:14,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-01-06 22:57:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2021-01-06 22:57:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 4021. [2021-01-06 22:57:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2021-01-06 22:57:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 16226 transitions. [2021-01-06 22:57:15,000 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 16226 transitions. Word has length 19 [2021-01-06 22:57:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:15,001 INFO L481 AbstractCegarLoop]: Abstraction has 4021 states and 16226 transitions. [2021-01-06 22:57:15,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 16226 transitions. [2021-01-06 22:57:15,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 22:57:15,007 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:15,007 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] [2021-01-06 22:57:15,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 22:57:15,008 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]=== [2021-01-06 22:57:15,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:15,008 INFO L82 PathProgramCache]: Analyzing trace with hash -638770199, now seen corresponding path program 1 times [2021-01-06 22:57:15,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:15,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25386373] [2021-01-06 22:57:15,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:15,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25386373] [2021-01-06 22:57:15,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:15,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:15,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807740553] [2021-01-06 22:57:15,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:15,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:15,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:15,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:15,121 INFO L87 Difference]: Start difference. First operand 4021 states and 16226 transitions. Second operand 8 states. [2021-01-06 22:57:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:15,547 INFO L93 Difference]: Finished difference Result 6240 states and 25278 transitions. [2021-01-06 22:57:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:15,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2021-01-06 22:57:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:15,580 INFO L225 Difference]: With dead ends: 6240 [2021-01-06 22:57:15,581 INFO L226 Difference]: Without dead ends: 6194 [2021-01-06 22:57:15,581 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 [2021-01-06 22:57:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6194 states. [2021-01-06 22:57:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6194 to 4020. [2021-01-06 22:57:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2021-01-06 22:57:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 16225 transitions. [2021-01-06 22:57:15,789 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 16225 transitions. Word has length 20 [2021-01-06 22:57:15,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:15,789 INFO L481 AbstractCegarLoop]: Abstraction has 4020 states and 16225 transitions. [2021-01-06 22:57:15,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 16225 transitions. [2021-01-06 22:57:15,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 22:57:15,794 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:15,795 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] [2021-01-06 22:57:15,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 22:57:15,795 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]=== [2021-01-06 22:57:15,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:15,796 INFO L82 PathProgramCache]: Analyzing trace with hash -78568143, now seen corresponding path program 2 times [2021-01-06 22:57:15,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:15,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867827612] [2021-01-06 22:57:15,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:15,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867827612] [2021-01-06 22:57:15,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:15,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:15,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228182440] [2021-01-06 22:57:15,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:15,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:15,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:15,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:15,932 INFO L87 Difference]: Start difference. First operand 4020 states and 16225 transitions. Second operand 8 states. [2021-01-06 22:57:16,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:16,279 INFO L93 Difference]: Finished difference Result 5057 states and 20246 transitions. [2021-01-06 22:57:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:16,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2021-01-06 22:57:16,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:16,308 INFO L225 Difference]: With dead ends: 5057 [2021-01-06 22:57:16,309 INFO L226 Difference]: Without dead ends: 5011 [2021-01-06 22:57:16,309 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 [2021-01-06 22:57:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2021-01-06 22:57:16,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 4017. [2021-01-06 22:57:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4017 states. [2021-01-06 22:57:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 16218 transitions. [2021-01-06 22:57:16,493 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 16218 transitions. Word has length 20 [2021-01-06 22:57:16,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:16,493 INFO L481 AbstractCegarLoop]: Abstraction has 4017 states and 16218 transitions. [2021-01-06 22:57:16,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:16,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 16218 transitions. [2021-01-06 22:57:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 22:57:16,501 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:16,501 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] [2021-01-06 22:57:16,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 22:57:16,501 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]=== [2021-01-06 22:57:16,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:16,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1686883325, now seen corresponding path program 3 times [2021-01-06 22:57:16,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:16,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943067880] [2021-01-06 22:57:16,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:16,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943067880] [2021-01-06 22:57:16,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:16,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 22:57:16,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720163895] [2021-01-06 22:57:16,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 22:57:16,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:16,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 22:57:16,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-06 22:57:16,746 INFO L87 Difference]: Start difference. First operand 4017 states and 16218 transitions. Second operand 9 states. [2021-01-06 22:57:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:17,360 INFO L93 Difference]: Finished difference Result 5047 states and 20222 transitions. [2021-01-06 22:57:17,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:17,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2021-01-06 22:57:17,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:17,378 INFO L225 Difference]: With dead ends: 5047 [2021-01-06 22:57:17,378 INFO L226 Difference]: Without dead ends: 5001 [2021-01-06 22:57:17,379 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 [2021-01-06 22:57:17,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2021-01-06 22:57:17,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 4010. [2021-01-06 22:57:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4010 states. [2021-01-06 22:57:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 16199 transitions. [2021-01-06 22:57:17,542 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 16199 transitions. Word has length 20 [2021-01-06 22:57:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:17,542 INFO L481 AbstractCegarLoop]: Abstraction has 4010 states and 16199 transitions. [2021-01-06 22:57:17,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 22:57:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 16199 transitions. [2021-01-06 22:57:17,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 22:57:17,547 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:17,547 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] [2021-01-06 22:57:17,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 22:57:17,547 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]=== [2021-01-06 22:57:17,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1644928641, now seen corresponding path program 4 times [2021-01-06 22:57:17,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:17,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408948523] [2021-01-06 22:57:17,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:17,884 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2021-01-06 22:57:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:17,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408948523] [2021-01-06 22:57:17,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:17,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 22:57:17,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076381797] [2021-01-06 22:57:17,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 22:57:17,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:17,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 22:57:17,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:17,931 INFO L87 Difference]: Start difference. First operand 4010 states and 16199 transitions. Second operand 11 states. [2021-01-06 22:57:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:18,846 INFO L93 Difference]: Finished difference Result 5545 states and 22382 transitions. [2021-01-06 22:57:18,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 22:57:18,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2021-01-06 22:57:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:18,866 INFO L225 Difference]: With dead ends: 5545 [2021-01-06 22:57:18,867 INFO L226 Difference]: Without dead ends: 5499 [2021-01-06 22:57:18,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-01-06 22:57:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2021-01-06 22:57:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 4140. [2021-01-06 22:57:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2021-01-06 22:57:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16867 transitions. [2021-01-06 22:57:19,056 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16867 transitions. Word has length 20 [2021-01-06 22:57:19,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:19,057 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16867 transitions. [2021-01-06 22:57:19,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 22:57:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16867 transitions. [2021-01-06 22:57:19,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 22:57:19,061 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:19,061 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] [2021-01-06 22:57:19,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 22:57:19,061 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]=== [2021-01-06 22:57:19,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:19,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1818104208, now seen corresponding path program 1 times [2021-01-06 22:57:19,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:19,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221915198] [2021-01-06 22:57:19,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:19,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221915198] [2021-01-06 22:57:19,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:19,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 22:57:19,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901042204] [2021-01-06 22:57:19,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 22:57:19,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:19,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 22:57:19,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:19,329 INFO L87 Difference]: Start difference. First operand 4140 states and 16867 transitions. Second operand 11 states. [2021-01-06 22:57:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:20,463 INFO L93 Difference]: Finished difference Result 6397 states and 25724 transitions. [2021-01-06 22:57:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 22:57:20,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2021-01-06 22:57:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:20,497 INFO L225 Difference]: With dead ends: 6397 [2021-01-06 22:57:20,498 INFO L226 Difference]: Without dead ends: 6351 [2021-01-06 22:57:20,498 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 [2021-01-06 22:57:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6351 states. [2021-01-06 22:57:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6351 to 4140. [2021-01-06 22:57:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2021-01-06 22:57:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16868 transitions. [2021-01-06 22:57:20,678 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16868 transitions. Word has length 20 [2021-01-06 22:57:20,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:20,679 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16868 transitions. [2021-01-06 22:57:20,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 22:57:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16868 transitions. [2021-01-06 22:57:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 22:57:20,683 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:20,683 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] [2021-01-06 22:57:20,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 22:57:20,683 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]=== [2021-01-06 22:57:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1599554532, now seen corresponding path program 2 times [2021-01-06 22:57:20,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:20,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723685706] [2021-01-06 22:57:20,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:20,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723685706] [2021-01-06 22:57:20,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:20,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 22:57:20,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616337492] [2021-01-06 22:57:20,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 22:57:20,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:20,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 22:57:20,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:20,930 INFO L87 Difference]: Start difference. First operand 4140 states and 16868 transitions. Second operand 11 states. [2021-01-06 22:57:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:21,907 INFO L93 Difference]: Finished difference Result 5409 states and 21869 transitions. [2021-01-06 22:57:21,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 22:57:21,908 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2021-01-06 22:57:21,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:21,926 INFO L225 Difference]: With dead ends: 5409 [2021-01-06 22:57:21,926 INFO L226 Difference]: Without dead ends: 5363 [2021-01-06 22:57:21,926 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 [2021-01-06 22:57:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2021-01-06 22:57:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 4142. [2021-01-06 22:57:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4142 states. [2021-01-06 22:57:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 16874 transitions. [2021-01-06 22:57:22,090 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 16874 transitions. Word has length 20 [2021-01-06 22:57:22,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:22,090 INFO L481 AbstractCegarLoop]: Abstraction has 4142 states and 16874 transitions. [2021-01-06 22:57:22,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 22:57:22,090 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 16874 transitions. [2021-01-06 22:57:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 22:57:22,094 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:22,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] [2021-01-06 22:57:22,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 22:57:22,095 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]=== [2021-01-06 22:57:22,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:22,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1117675172, now seen corresponding path program 3 times [2021-01-06 22:57:22,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:22,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176847999] [2021-01-06 22:57:22,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:22,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176847999] [2021-01-06 22:57:22,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:22,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 22:57:22,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127825416] [2021-01-06 22:57:22,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 22:57:22,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:22,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 22:57:22,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:22,286 INFO L87 Difference]: Start difference. First operand 4142 states and 16874 transitions. Second operand 10 states. [2021-01-06 22:57:23,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:23,064 INFO L93 Difference]: Finished difference Result 6189 states and 24832 transitions. [2021-01-06 22:57:23,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 22:57:23,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2021-01-06 22:57:23,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:23,086 INFO L225 Difference]: With dead ends: 6189 [2021-01-06 22:57:23,087 INFO L226 Difference]: Without dead ends: 6143 [2021-01-06 22:57:23,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-01-06 22:57:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2021-01-06 22:57:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 4141. [2021-01-06 22:57:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4141 states. [2021-01-06 22:57:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 16873 transitions. [2021-01-06 22:57:23,221 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 16873 transitions. Word has length 20 [2021-01-06 22:57:23,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:23,221 INFO L481 AbstractCegarLoop]: Abstraction has 4141 states and 16873 transitions. [2021-01-06 22:57:23,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 22:57:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 16873 transitions. [2021-01-06 22:57:23,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 22:57:23,225 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:23,225 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] [2021-01-06 22:57:23,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 22:57:23,226 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]=== [2021-01-06 22:57:23,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:23,226 INFO L82 PathProgramCache]: Analyzing trace with hash -240366616, now seen corresponding path program 4 times [2021-01-06 22:57:23,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:23,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164478604] [2021-01-06 22:57:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:23,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164478604] [2021-01-06 22:57:23,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:23,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 22:57:23,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646863912] [2021-01-06 22:57:23,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 22:57:23,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:23,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 22:57:23,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:23,399 INFO L87 Difference]: Start difference. First operand 4141 states and 16873 transitions. Second operand 10 states. [2021-01-06 22:57:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:23,990 INFO L93 Difference]: Finished difference Result 5246 states and 21125 transitions. [2021-01-06 22:57:23,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:23,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2021-01-06 22:57:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:24,017 INFO L225 Difference]: With dead ends: 5246 [2021-01-06 22:57:24,017 INFO L226 Difference]: Without dead ends: 5200 [2021-01-06 22:57:24,017 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 [2021-01-06 22:57:24,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2021-01-06 22:57:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 3983. [2021-01-06 22:57:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2021-01-06 22:57:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 16133 transitions. [2021-01-06 22:57:24,160 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 16133 transitions. Word has length 20 [2021-01-06 22:57:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:24,160 INFO L481 AbstractCegarLoop]: Abstraction has 3983 states and 16133 transitions. [2021-01-06 22:57:24,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 22:57:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 16133 transitions. [2021-01-06 22:57:24,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 22:57:24,164 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:24,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, 1, 1] [2021-01-06 22:57:24,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 22:57:24,165 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]=== [2021-01-06 22:57:24,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:24,166 INFO L82 PathProgramCache]: Analyzing trace with hash -565771751, now seen corresponding path program 1 times [2021-01-06 22:57:24,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:24,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356822836] [2021-01-06 22:57:24,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:24,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356822836] [2021-01-06 22:57:24,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:24,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:24,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148474275] [2021-01-06 22:57:24,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:24,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:24,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:24,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:24,233 INFO L87 Difference]: Start difference. First operand 3983 states and 16133 transitions. Second operand 6 states. [2021-01-06 22:57:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:24,511 INFO L93 Difference]: Finished difference Result 4762 states and 18800 transitions. [2021-01-06 22:57:24,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:24,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2021-01-06 22:57:24,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:24,533 INFO L225 Difference]: With dead ends: 4762 [2021-01-06 22:57:24,534 INFO L226 Difference]: Without dead ends: 4687 [2021-01-06 22:57:24,534 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 [2021-01-06 22:57:24,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2021-01-06 22:57:24,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4305. [2021-01-06 22:57:24,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2021-01-06 22:57:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 17320 transitions. [2021-01-06 22:57:24,671 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 17320 transitions. Word has length 21 [2021-01-06 22:57:24,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:24,671 INFO L481 AbstractCegarLoop]: Abstraction has 4305 states and 17320 transitions. [2021-01-06 22:57:24,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 17320 transitions. [2021-01-06 22:57:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 22:57:24,674 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:24,674 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] [2021-01-06 22:57:24,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 22:57:24,675 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]=== [2021-01-06 22:57:24,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:24,675 INFO L82 PathProgramCache]: Analyzing trace with hash 479599707, now seen corresponding path program 2 times [2021-01-06 22:57:24,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:24,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959608067] [2021-01-06 22:57:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:24,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959608067] [2021-01-06 22:57:24,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:24,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:24,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819874193] [2021-01-06 22:57:24,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:24,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:24,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:24,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:24,739 INFO L87 Difference]: Start difference. First operand 4305 states and 17320 transitions. Second operand 6 states. [2021-01-06 22:57:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:24,907 INFO L93 Difference]: Finished difference Result 5233 states and 20429 transitions. [2021-01-06 22:57:24,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 22:57:24,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2021-01-06 22:57:24,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:24,934 INFO L225 Difference]: With dead ends: 5233 [2021-01-06 22:57:24,934 INFO L226 Difference]: Without dead ends: 4707 [2021-01-06 22:57:24,935 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 [2021-01-06 22:57:24,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4707 states. [2021-01-06 22:57:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4707 to 3933. [2021-01-06 22:57:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3933 states. [2021-01-06 22:57:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 15536 transitions. [2021-01-06 22:57:25,096 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 15536 transitions. Word has length 21 [2021-01-06 22:57:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:25,096 INFO L481 AbstractCegarLoop]: Abstraction has 3933 states and 15536 transitions. [2021-01-06 22:57:25,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:25,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 15536 transitions. [2021-01-06 22:57:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 22:57:25,101 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:25,101 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] [2021-01-06 22:57:25,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 22:57:25,101 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]=== [2021-01-06 22:57:25,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:25,102 INFO L82 PathProgramCache]: Analyzing trace with hash -586116813, now seen corresponding path program 1 times [2021-01-06 22:57:25,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:25,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4445850] [2021-01-06 22:57:25,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:25,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:25,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4445850] [2021-01-06 22:57:25,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:25,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 22:57:25,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081682598] [2021-01-06 22:57:25,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 22:57:25,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:25,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 22:57:25,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:25,384 INFO L87 Difference]: Start difference. First operand 3933 states and 15536 transitions. Second operand 10 states. [2021-01-06 22:57:26,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:26,189 INFO L93 Difference]: Finished difference Result 4734 states and 18567 transitions. [2021-01-06 22:57:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:26,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2021-01-06 22:57:26,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:26,207 INFO L225 Difference]: With dead ends: 4734 [2021-01-06 22:57:26,207 INFO L226 Difference]: Without dead ends: 4685 [2021-01-06 22:57:26,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-01-06 22:57:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4685 states. [2021-01-06 22:57:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 3841. [2021-01-06 22:57:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2021-01-06 22:57:26,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 15162 transitions. [2021-01-06 22:57:26,302 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 15162 transitions. Word has length 21 [2021-01-06 22:57:26,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:26,302 INFO L481 AbstractCegarLoop]: Abstraction has 3841 states and 15162 transitions. [2021-01-06 22:57:26,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 22:57:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 15162 transitions. [2021-01-06 22:57:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 22:57:26,304 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:26,305 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] [2021-01-06 22:57:26,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 22:57:26,305 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]=== [2021-01-06 22:57:26,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:26,305 INFO L82 PathProgramCache]: Analyzing trace with hash -757352757, now seen corresponding path program 1 times [2021-01-06 22:57:26,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:26,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795778385] [2021-01-06 22:57:26,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:26,642 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-01-06 22:57:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:26,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795778385] [2021-01-06 22:57:26,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:26,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:26,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287824405] [2021-01-06 22:57:26,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:26,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:26,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:26,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:26,803 INFO L87 Difference]: Start difference. First operand 3841 states and 15162 transitions. Second operand 12 states. [2021-01-06 22:57:27,250 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2021-01-06 22:57:27,507 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2021-01-06 22:57:27,648 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2021-01-06 22:57:27,804 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2021-01-06 22:57:27,975 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2021-01-06 22:57:28,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:28,388 INFO L93 Difference]: Finished difference Result 5118 states and 20406 transitions. [2021-01-06 22:57:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 22:57:28,389 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2021-01-06 22:57:28,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:28,408 INFO L225 Difference]: With dead ends: 5118 [2021-01-06 22:57:28,408 INFO L226 Difference]: Without dead ends: 4964 [2021-01-06 22:57:28,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2021-01-06 22:57:28,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4964 states. [2021-01-06 22:57:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4964 to 3443. [2021-01-06 22:57:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2021-01-06 22:57:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 13378 transitions. [2021-01-06 22:57:28,524 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 13378 transitions. Word has length 21 [2021-01-06 22:57:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:28,525 INFO L481 AbstractCegarLoop]: Abstraction has 3443 states and 13378 transitions. [2021-01-06 22:57:28,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 13378 transitions. [2021-01-06 22:57:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 22:57:28,527 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:28,528 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] [2021-01-06 22:57:28,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 22:57:28,528 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]=== [2021-01-06 22:57:28,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:28,528 INFO L82 PathProgramCache]: Analyzing trace with hash 820571943, now seen corresponding path program 2 times [2021-01-06 22:57:28,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:28,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060930668] [2021-01-06 22:57:28,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:28,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060930668] [2021-01-06 22:57:28,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:28,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:28,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325871240] [2021-01-06 22:57:28,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:28,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:28,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:28,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:28,927 INFO L87 Difference]: Start difference. First operand 3443 states and 13378 transitions. Second operand 12 states. [2021-01-06 22:57:29,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:29,818 INFO L93 Difference]: Finished difference Result 4562 states and 17491 transitions. [2021-01-06 22:57:29,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:29,819 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2021-01-06 22:57:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:29,838 INFO L225 Difference]: With dead ends: 4562 [2021-01-06 22:57:29,838 INFO L226 Difference]: Without dead ends: 4510 [2021-01-06 22:57:29,838 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-01-06 22:57:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2021-01-06 22:57:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 3368. [2021-01-06 22:57:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3368 states. [2021-01-06 22:57:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 12841 transitions. [2021-01-06 22:57:29,957 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 12841 transitions. Word has length 21 [2021-01-06 22:57:29,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:29,958 INFO L481 AbstractCegarLoop]: Abstraction has 3368 states and 12841 transitions. [2021-01-06 22:57:29,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 12841 transitions. [2021-01-06 22:57:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 22:57:29,961 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:29,961 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] [2021-01-06 22:57:29,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 22:57:29,961 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]=== [2021-01-06 22:57:29,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:29,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1673753334, now seen corresponding path program 1 times [2021-01-06 22:57:29,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:29,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809291258] [2021-01-06 22:57:29,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:30,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809291258] [2021-01-06 22:57:30,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:30,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 22:57:30,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511552154] [2021-01-06 22:57:30,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 22:57:30,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:30,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 22:57:30,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 22:57:30,070 INFO L87 Difference]: Start difference. First operand 3368 states and 12841 transitions. Second operand 7 states. [2021-01-06 22:57:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:30,264 INFO L93 Difference]: Finished difference Result 3879 states and 14497 transitions. [2021-01-06 22:57:30,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 22:57:30,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2021-01-06 22:57:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:30,286 INFO L225 Difference]: With dead ends: 3879 [2021-01-06 22:57:30,287 INFO L226 Difference]: Without dead ends: 3785 [2021-01-06 22:57:30,287 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 [2021-01-06 22:57:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2021-01-06 22:57:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3369. [2021-01-06 22:57:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3369 states. [2021-01-06 22:57:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 12845 transitions. [2021-01-06 22:57:30,453 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 12845 transitions. Word has length 21 [2021-01-06 22:57:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:30,454 INFO L481 AbstractCegarLoop]: Abstraction has 3369 states and 12845 transitions. [2021-01-06 22:57:30,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 22:57:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 12845 transitions. [2021-01-06 22:57:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 22:57:30,460 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:30,460 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] [2021-01-06 22:57:30,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 22:57:30,460 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]=== [2021-01-06 22:57:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:30,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1208728268, now seen corresponding path program 1 times [2021-01-06 22:57:30,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:30,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374016664] [2021-01-06 22:57:30,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:30,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374016664] [2021-01-06 22:57:30,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:30,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 22:57:30,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016666405] [2021-01-06 22:57:30,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 22:57:30,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:30,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 22:57:30,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:30,854 INFO L87 Difference]: Start difference. First operand 3369 states and 12845 transitions. Second operand 11 states. [2021-01-06 22:57:31,350 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2021-01-06 22:57:31,505 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2021-01-06 22:57:31,647 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-01-06 22:57:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:31,998 INFO L93 Difference]: Finished difference Result 4138 states and 15694 transitions. [2021-01-06 22:57:31,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 22:57:31,999 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2021-01-06 22:57:31,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:32,015 INFO L225 Difference]: With dead ends: 4138 [2021-01-06 22:57:32,015 INFO L226 Difference]: Without dead ends: 4089 [2021-01-06 22:57:32,016 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-01-06 22:57:32,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2021-01-06 22:57:32,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 3004. [2021-01-06 22:57:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2021-01-06 22:57:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 11303 transitions. [2021-01-06 22:57:32,121 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 11303 transitions. Word has length 21 [2021-01-06 22:57:32,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:32,122 INFO L481 AbstractCegarLoop]: Abstraction has 3004 states and 11303 transitions. [2021-01-06 22:57:32,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 22:57:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 11303 transitions. [2021-01-06 22:57:32,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 22:57:32,125 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:32,125 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] [2021-01-06 22:57:32,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 22:57:32,126 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]=== [2021-01-06 22:57:32,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:32,126 INFO L82 PathProgramCache]: Analyzing trace with hash 172061386, now seen corresponding path program 2 times [2021-01-06 22:57:32,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:32,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354144222] [2021-01-06 22:57:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:32,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354144222] [2021-01-06 22:57:32,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:32,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:32,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670962283] [2021-01-06 22:57:32,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:32,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:32,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:32,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:32,255 INFO L87 Difference]: Start difference. First operand 3004 states and 11303 transitions. Second operand 8 states. [2021-01-06 22:57:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:32,465 INFO L93 Difference]: Finished difference Result 3058 states and 11357 transitions. [2021-01-06 22:57:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 22:57:32,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2021-01-06 22:57:32,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:32,476 INFO L225 Difference]: With dead ends: 3058 [2021-01-06 22:57:32,476 INFO L226 Difference]: Without dead ends: 3058 [2021-01-06 22:57:32,477 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 [2021-01-06 22:57:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2021-01-06 22:57:32,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2831. [2021-01-06 22:57:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2021-01-06 22:57:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2021-01-06 22:57:32,544 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2021-01-06 22:57:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:32,544 INFO L481 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2021-01-06 22:57:32,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2021-01-06 22:57:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 22:57:32,548 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:32,548 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] [2021-01-06 22:57:32,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 22:57:32,548 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]=== [2021-01-06 22:57:32,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:32,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1320448504, now seen corresponding path program 1 times [2021-01-06 22:57:32,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:32,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440783907] [2021-01-06 22:57:32,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:32,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440783907] [2021-01-06 22:57:32,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:32,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:32,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547587381] [2021-01-06 22:57:32,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:32,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:32,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:32,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:32,678 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2021-01-06 22:57:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:33,131 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2021-01-06 22:57:33,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 22:57:33,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2021-01-06 22:57:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:33,142 INFO L225 Difference]: With dead ends: 3550 [2021-01-06 22:57:33,142 INFO L226 Difference]: Without dead ends: 3490 [2021-01-06 22:57:33,142 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 [2021-01-06 22:57:33,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2021-01-06 22:57:33,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2021-01-06 22:57:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2021-01-06 22:57:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2021-01-06 22:57:33,191 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2021-01-06 22:57:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:33,191 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2021-01-06 22:57:33,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2021-01-06 22:57:33,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 22:57:33,193 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:33,193 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] [2021-01-06 22:57:33,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 22:57:33,193 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]=== [2021-01-06 22:57:33,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:33,194 INFO L82 PathProgramCache]: Analyzing trace with hash -893918318, now seen corresponding path program 2 times [2021-01-06 22:57:33,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:33,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080241411] [2021-01-06 22:57:33,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:33,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080241411] [2021-01-06 22:57:33,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:33,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 22:57:33,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854028326] [2021-01-06 22:57:33,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 22:57:33,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:33,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 22:57:33,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-06 22:57:33,340 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2021-01-06 22:57:33,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:33,794 INFO L93 Difference]: Finished difference Result 3862 states and 14252 transitions. [2021-01-06 22:57:33,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 22:57:33,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2021-01-06 22:57:33,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:33,807 INFO L225 Difference]: With dead ends: 3862 [2021-01-06 22:57:33,807 INFO L226 Difference]: Without dead ends: 3802 [2021-01-06 22:57:33,808 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 [2021-01-06 22:57:33,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2021-01-06 22:57:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2822. [2021-01-06 22:57:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2021-01-06 22:57:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2021-01-06 22:57:33,965 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2021-01-06 22:57:33,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:33,966 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2021-01-06 22:57:33,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 22:57:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2021-01-06 22:57:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 22:57:33,969 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:33,969 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] [2021-01-06 22:57:33,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 22:57:33,969 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]=== [2021-01-06 22:57:33,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:33,970 INFO L82 PathProgramCache]: Analyzing trace with hash 131153448, now seen corresponding path program 3 times [2021-01-06 22:57:33,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:33,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660086677] [2021-01-06 22:57:33,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:34,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660086677] [2021-01-06 22:57:34,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:34,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 22:57:34,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746900488] [2021-01-06 22:57:34,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 22:57:34,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:34,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 22:57:34,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:34,117 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 10 states. [2021-01-06 22:57:34,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:34,643 INFO L93 Difference]: Finished difference Result 4277 states and 15941 transitions. [2021-01-06 22:57:34,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:34,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2021-01-06 22:57:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:34,656 INFO L225 Difference]: With dead ends: 4277 [2021-01-06 22:57:34,656 INFO L226 Difference]: Without dead ends: 4217 [2021-01-06 22:57:34,657 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 [2021-01-06 22:57:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2021-01-06 22:57:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 2818. [2021-01-06 22:57:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2021-01-06 22:57:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 10596 transitions. [2021-01-06 22:57:34,718 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 10596 transitions. Word has length 22 [2021-01-06 22:57:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:34,719 INFO L481 AbstractCegarLoop]: Abstraction has 2818 states and 10596 transitions. [2021-01-06 22:57:34,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 22:57:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 10596 transitions. [2021-01-06 22:57:34,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 22:57:34,721 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:34,721 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] [2021-01-06 22:57:34,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 22:57:34,721 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]=== [2021-01-06 22:57:34,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:34,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1026439080, now seen corresponding path program 4 times [2021-01-06 22:57:34,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:34,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855986978] [2021-01-06 22:57:34,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:34,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855986978] [2021-01-06 22:57:34,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:34,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 22:57:34,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653066614] [2021-01-06 22:57:34,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 22:57:34,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:34,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 22:57:34,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:34,861 INFO L87 Difference]: Start difference. First operand 2818 states and 10596 transitions. Second operand 10 states. [2021-01-06 22:57:35,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:35,169 INFO L93 Difference]: Finished difference Result 3433 states and 12660 transitions. [2021-01-06 22:57:35,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:35,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2021-01-06 22:57:35,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:35,179 INFO L225 Difference]: With dead ends: 3433 [2021-01-06 22:57:35,179 INFO L226 Difference]: Without dead ends: 3373 [2021-01-06 22:57:35,180 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 [2021-01-06 22:57:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2021-01-06 22:57:35,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 2730. [2021-01-06 22:57:35,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2021-01-06 22:57:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 10232 transitions. [2021-01-06 22:57:35,233 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 10232 transitions. Word has length 22 [2021-01-06 22:57:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:35,233 INFO L481 AbstractCegarLoop]: Abstraction has 2730 states and 10232 transitions. [2021-01-06 22:57:35,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 22:57:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 10232 transitions. [2021-01-06 22:57:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 22:57:35,235 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:35,235 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] [2021-01-06 22:57:35,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 22:57:35,235 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]=== [2021-01-06 22:57:35,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1544480782, now seen corresponding path program 5 times [2021-01-06 22:57:35,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:35,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333486084] [2021-01-06 22:57:35,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:35,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333486084] [2021-01-06 22:57:35,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:35,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:35,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693340478] [2021-01-06 22:57:35,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:35,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:35,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:35,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:35,510 INFO L87 Difference]: Start difference. First operand 2730 states and 10232 transitions. Second operand 12 states. [2021-01-06 22:57:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:36,048 INFO L93 Difference]: Finished difference Result 3588 states and 13121 transitions. [2021-01-06 22:57:36,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:36,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2021-01-06 22:57:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:36,058 INFO L225 Difference]: With dead ends: 3588 [2021-01-06 22:57:36,058 INFO L226 Difference]: Without dead ends: 3528 [2021-01-06 22:57:36,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-01-06 22:57:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2021-01-06 22:57:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 2670. [2021-01-06 22:57:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2021-01-06 22:57:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2021-01-06 22:57:36,111 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2021-01-06 22:57:36,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:36,111 INFO L481 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2021-01-06 22:57:36,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:36,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2021-01-06 22:57:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 22:57:36,113 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:36,113 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] [2021-01-06 22:57:36,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 22:57:36,114 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]=== [2021-01-06 22:57:36,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:36,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1499150017, now seen corresponding path program 1 times [2021-01-06 22:57:36,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:36,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628697662] [2021-01-06 22:57:36,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:36,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628697662] [2021-01-06 22:57:36,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:36,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:36,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435426925] [2021-01-06 22:57:36,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:36,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:36,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:36,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:36,474 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2021-01-06 22:57:36,990 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2021-01-06 22:57:37,126 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2021-01-06 22:57:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:37,491 INFO L93 Difference]: Finished difference Result 2896 states and 10368 transitions. [2021-01-06 22:57:37,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 22:57:37,492 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2021-01-06 22:57:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:37,500 INFO L225 Difference]: With dead ends: 2896 [2021-01-06 22:57:37,500 INFO L226 Difference]: Without dead ends: 2802 [2021-01-06 22:57:37,501 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 [2021-01-06 22:57:37,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2021-01-06 22:57:37,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2426. [2021-01-06 22:57:37,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2021-01-06 22:57:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 8840 transitions. [2021-01-06 22:57:37,548 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 8840 transitions. Word has length 23 [2021-01-06 22:57:37,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:37,549 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 8840 transitions. [2021-01-06 22:57:37,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:37,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 8840 transitions. [2021-01-06 22:57:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 22:57:37,551 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:37,551 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] [2021-01-06 22:57:37,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 22:57:37,551 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]=== [2021-01-06 22:57:37,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:37,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1292151056, now seen corresponding path program 1 times [2021-01-06 22:57:37,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:37,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654748710] [2021-01-06 22:57:37,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:37,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:37,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654748710] [2021-01-06 22:57:37,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:37,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:37,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746716060] [2021-01-06 22:57:37,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:37,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:37,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:37,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:37,895 INFO L87 Difference]: Start difference. First operand 2426 states and 8840 transitions. Second operand 12 states. [2021-01-06 22:57:38,391 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2021-01-06 22:57:38,551 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2021-01-06 22:57:38,698 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2021-01-06 22:57:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:38,909 INFO L93 Difference]: Finished difference Result 2538 states and 8863 transitions. [2021-01-06 22:57:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 22:57:38,910 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2021-01-06 22:57:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:38,917 INFO L225 Difference]: With dead ends: 2538 [2021-01-06 22:57:38,917 INFO L226 Difference]: Without dead ends: 2419 [2021-01-06 22:57:38,917 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 [2021-01-06 22:57:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2021-01-06 22:57:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1794. [2021-01-06 22:57:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2021-01-06 22:57:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2021-01-06 22:57:38,953 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2021-01-06 22:57:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:38,953 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2021-01-06 22:57:38,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2021-01-06 22:57:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 22:57:38,955 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:38,955 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] [2021-01-06 22:57:38,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 22:57:38,955 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]=== [2021-01-06 22:57:38,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:38,955 INFO L82 PathProgramCache]: Analyzing trace with hash -974214744, now seen corresponding path program 1 times [2021-01-06 22:57:38,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:38,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339109593] [2021-01-06 22:57:38,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:39,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339109593] [2021-01-06 22:57:39,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:39,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:39,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214998605] [2021-01-06 22:57:39,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:39,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:39,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:39,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:39,007 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 6 states. [2021-01-06 22:57:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:39,210 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2021-01-06 22:57:39,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:39,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2021-01-06 22:57:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:39,216 INFO L225 Difference]: With dead ends: 2291 [2021-01-06 22:57:39,216 INFO L226 Difference]: Without dead ends: 2227 [2021-01-06 22:57:39,216 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 [2021-01-06 22:57:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2021-01-06 22:57:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2021-01-06 22:57:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2021-01-06 22:57:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2021-01-06 22:57:39,252 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2021-01-06 22:57:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:39,252 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2021-01-06 22:57:39,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2021-01-06 22:57:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 22:57:39,254 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:39,255 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] [2021-01-06 22:57:39,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 22:57:39,255 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]=== [2021-01-06 22:57:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:39,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1120972762, now seen corresponding path program 2 times [2021-01-06 22:57:39,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:39,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986266048] [2021-01-06 22:57:39,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:39,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986266048] [2021-01-06 22:57:39,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:39,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:39,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963170688] [2021-01-06 22:57:39,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:39,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:39,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:39,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:39,360 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 8 states. [2021-01-06 22:57:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:39,813 INFO L93 Difference]: Finished difference Result 2599 states and 8709 transitions. [2021-01-06 22:57:39,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 22:57:39,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2021-01-06 22:57:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:39,820 INFO L225 Difference]: With dead ends: 2599 [2021-01-06 22:57:39,820 INFO L226 Difference]: Without dead ends: 2535 [2021-01-06 22:57:39,820 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 [2021-01-06 22:57:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2021-01-06 22:57:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2102. [2021-01-06 22:57:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2021-01-06 22:57:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7273 transitions. [2021-01-06 22:57:39,856 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7273 transitions. Word has length 24 [2021-01-06 22:57:39,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:39,856 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7273 transitions. [2021-01-06 22:57:39,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7273 transitions. [2021-01-06 22:57:39,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 22:57:39,858 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:39,858 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] [2021-01-06 22:57:39,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 22:57:39,858 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]=== [2021-01-06 22:57:39,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:39,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1176290112, now seen corresponding path program 3 times [2021-01-06 22:57:39,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:39,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846129470] [2021-01-06 22:57:39,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:39,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846129470] [2021-01-06 22:57:39,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:39,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 22:57:39,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767889748] [2021-01-06 22:57:39,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 22:57:39,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:39,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 22:57:39,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-06 22:57:39,999 INFO L87 Difference]: Start difference. First operand 2102 states and 7273 transitions. Second operand 9 states. [2021-01-06 22:57:40,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:40,544 INFO L93 Difference]: Finished difference Result 2898 states and 9677 transitions. [2021-01-06 22:57:40,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 22:57:40,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2021-01-06 22:57:40,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:40,555 INFO L225 Difference]: With dead ends: 2898 [2021-01-06 22:57:40,555 INFO L226 Difference]: Without dead ends: 2834 [2021-01-06 22:57:40,556 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 [2021-01-06 22:57:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2021-01-06 22:57:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2093. [2021-01-06 22:57:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2021-01-06 22:57:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 7255 transitions. [2021-01-06 22:57:40,622 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 7255 transitions. Word has length 24 [2021-01-06 22:57:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:40,623 INFO L481 AbstractCegarLoop]: Abstraction has 2093 states and 7255 transitions. [2021-01-06 22:57:40,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 22:57:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 7255 transitions. [2021-01-06 22:57:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 22:57:40,626 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:40,626 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] [2021-01-06 22:57:40,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 22:57:40,626 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]=== [2021-01-06 22:57:40,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:40,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1572220842, now seen corresponding path program 4 times [2021-01-06 22:57:40,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:40,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012166671] [2021-01-06 22:57:40,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:40,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012166671] [2021-01-06 22:57:40,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:40,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 22:57:40,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571933849] [2021-01-06 22:57:40,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 22:57:40,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:40,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 22:57:40,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:40,820 INFO L87 Difference]: Start difference. First operand 2093 states and 7255 transitions. Second operand 10 states. [2021-01-06 22:57:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:41,366 INFO L93 Difference]: Finished difference Result 2875 states and 9618 transitions. [2021-01-06 22:57:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 22:57:41,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2021-01-06 22:57:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:41,374 INFO L225 Difference]: With dead ends: 2875 [2021-01-06 22:57:41,374 INFO L226 Difference]: Without dead ends: 2811 [2021-01-06 22:57:41,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-01-06 22:57:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2021-01-06 22:57:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2079. [2021-01-06 22:57:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2021-01-06 22:57:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 7214 transitions. [2021-01-06 22:57:41,428 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 7214 transitions. Word has length 24 [2021-01-06 22:57:41,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:41,428 INFO L481 AbstractCegarLoop]: Abstraction has 2079 states and 7214 transitions. [2021-01-06 22:57:41,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 22:57:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 7214 transitions. [2021-01-06 22:57:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 22:57:41,431 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:41,432 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] [2021-01-06 22:57:41,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 22:57:41,432 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]=== [2021-01-06 22:57:41,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:41,432 INFO L82 PathProgramCache]: Analyzing trace with hash 438749216, now seen corresponding path program 5 times [2021-01-06 22:57:41,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:41,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334133275] [2021-01-06 22:57:41,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:41,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334133275] [2021-01-06 22:57:41,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:41,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 22:57:41,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040573706] [2021-01-06 22:57:41,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 22:57:41,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:41,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 22:57:41,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:41,588 INFO L87 Difference]: Start difference. First operand 2079 states and 7214 transitions. Second operand 11 states. [2021-01-06 22:57:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:41,976 INFO L93 Difference]: Finished difference Result 3106 states and 10587 transitions. [2021-01-06 22:57:41,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:41,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2021-01-06 22:57:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:41,984 INFO L225 Difference]: With dead ends: 3106 [2021-01-06 22:57:41,985 INFO L226 Difference]: Without dead ends: 3042 [2021-01-06 22:57:41,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-01-06 22:57:41,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2021-01-06 22:57:42,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2071. [2021-01-06 22:57:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2021-01-06 22:57:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7186 transitions. [2021-01-06 22:57:42,027 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7186 transitions. Word has length 24 [2021-01-06 22:57:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:42,027 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 7186 transitions. [2021-01-06 22:57:42,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 22:57:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7186 transitions. [2021-01-06 22:57:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 22:57:42,029 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:42,029 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] [2021-01-06 22:57:42,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 22:57:42,030 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]=== [2021-01-06 22:57:42,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:42,030 INFO L82 PathProgramCache]: Analyzing trace with hash 991769996, now seen corresponding path program 6 times [2021-01-06 22:57:42,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:42,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233007420] [2021-01-06 22:57:42,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:42,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233007420] [2021-01-06 22:57:42,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:42,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 22:57:42,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917600563] [2021-01-06 22:57:42,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 22:57:42,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:42,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 22:57:42,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:42,194 INFO L87 Difference]: Start difference. First operand 2071 states and 7186 transitions. Second operand 11 states. [2021-01-06 22:57:42,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:42,532 INFO L93 Difference]: Finished difference Result 2481 states and 8355 transitions. [2021-01-06 22:57:42,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:42,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2021-01-06 22:57:42,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:42,538 INFO L225 Difference]: With dead ends: 2481 [2021-01-06 22:57:42,538 INFO L226 Difference]: Without dead ends: 2417 [2021-01-06 22:57:42,539 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 [2021-01-06 22:57:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2021-01-06 22:57:42,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2039. [2021-01-06 22:57:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2021-01-06 22:57:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 7058 transitions. [2021-01-06 22:57:42,576 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 7058 transitions. Word has length 24 [2021-01-06 22:57:42,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:42,576 INFO L481 AbstractCegarLoop]: Abstraction has 2039 states and 7058 transitions. [2021-01-06 22:57:42,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 22:57:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 7058 transitions. [2021-01-06 22:57:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 22:57:42,579 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:42,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:42,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 22:57:42,579 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]=== [2021-01-06 22:57:42,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:42,580 INFO L82 PathProgramCache]: Analyzing trace with hash 71780478, now seen corresponding path program 7 times [2021-01-06 22:57:42,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:42,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983241522] [2021-01-06 22:57:42,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:42,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983241522] [2021-01-06 22:57:42,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:42,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 22:57:42,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835957700] [2021-01-06 22:57:42,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 22:57:42,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:42,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 22:57:42,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-01-06 22:57:42,907 INFO L87 Difference]: Start difference. First operand 2039 states and 7058 transitions. Second operand 13 states. [2021-01-06 22:57:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:44,005 INFO L93 Difference]: Finished difference Result 3018 states and 10169 transitions. [2021-01-06 22:57:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 22:57:44,006 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2021-01-06 22:57:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:44,013 INFO L225 Difference]: With dead ends: 3018 [2021-01-06 22:57:44,013 INFO L226 Difference]: Without dead ends: 2890 [2021-01-06 22:57:44,014 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2021-01-06 22:57:44,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2021-01-06 22:57:44,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1971. [2021-01-06 22:57:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2021-01-06 22:57:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 6882 transitions. [2021-01-06 22:57:44,050 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 6882 transitions. Word has length 24 [2021-01-06 22:57:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:44,051 INFO L481 AbstractCegarLoop]: Abstraction has 1971 states and 6882 transitions. [2021-01-06 22:57:44,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 22:57:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 6882 transitions. [2021-01-06 22:57:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 22:57:44,054 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:44,054 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] [2021-01-06 22:57:44,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 22:57:44,054 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]=== [2021-01-06 22:57:44,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:44,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1318319474, now seen corresponding path program 1 times [2021-01-06 22:57:44,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:44,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752281435] [2021-01-06 22:57:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:44,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752281435] [2021-01-06 22:57:44,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:44,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:44,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699561381] [2021-01-06 22:57:44,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:44,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:44,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:44,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:44,327 INFO L87 Difference]: Start difference. First operand 1971 states and 6882 transitions. Second operand 12 states. [2021-01-06 22:57:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:44,800 INFO L93 Difference]: Finished difference Result 3157 states and 10632 transitions. [2021-01-06 22:57:44,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:44,801 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2021-01-06 22:57:44,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:44,808 INFO L225 Difference]: With dead ends: 3157 [2021-01-06 22:57:44,808 INFO L226 Difference]: Without dead ends: 3133 [2021-01-06 22:57:44,808 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 [2021-01-06 22:57:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2021-01-06 22:57:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 1613. [2021-01-06 22:57:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2021-01-06 22:57:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5563 transitions. [2021-01-06 22:57:44,850 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 5563 transitions. Word has length 24 [2021-01-06 22:57:44,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:44,850 INFO L481 AbstractCegarLoop]: Abstraction has 1613 states and 5563 transitions. [2021-01-06 22:57:44,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 5563 transitions. [2021-01-06 22:57:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 22:57:44,853 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:44,853 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] [2021-01-06 22:57:44,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 22:57:44,853 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]=== [2021-01-06 22:57:44,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:44,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1290250801, now seen corresponding path program 1 times [2021-01-06 22:57:44,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:44,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645472436] [2021-01-06 22:57:44,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:45,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645472436] [2021-01-06 22:57:45,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:45,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:45,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815073766] [2021-01-06 22:57:45,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:45,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:45,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:45,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:45,087 INFO L87 Difference]: Start difference. First operand 1613 states and 5563 transitions. Second operand 12 states. [2021-01-06 22:57:45,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:45,843 INFO L93 Difference]: Finished difference Result 2298 states and 7608 transitions. [2021-01-06 22:57:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 22:57:45,844 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2021-01-06 22:57:45,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:45,850 INFO L225 Difference]: With dead ends: 2298 [2021-01-06 22:57:45,850 INFO L226 Difference]: Without dead ends: 2254 [2021-01-06 22:57:45,850 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-01-06 22:57:45,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2021-01-06 22:57:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1611. [2021-01-06 22:57:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2021-01-06 22:57:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 5567 transitions. [2021-01-06 22:57:45,891 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 5567 transitions. Word has length 26 [2021-01-06 22:57:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:45,891 INFO L481 AbstractCegarLoop]: Abstraction has 1611 states and 5567 transitions. [2021-01-06 22:57:45,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 5567 transitions. [2021-01-06 22:57:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 22:57:45,894 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:45,895 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] [2021-01-06 22:57:45,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 22:57:45,895 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]=== [2021-01-06 22:57:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:45,895 INFO L82 PathProgramCache]: Analyzing trace with hash -943856693, now seen corresponding path program 2 times [2021-01-06 22:57:45,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:45,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895355145] [2021-01-06 22:57:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:46,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895355145] [2021-01-06 22:57:46,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:46,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:46,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594555646] [2021-01-06 22:57:46,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:46,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:46,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:46,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:46,116 INFO L87 Difference]: Start difference. First operand 1611 states and 5567 transitions. Second operand 12 states. [2021-01-06 22:57:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:46,658 INFO L93 Difference]: Finished difference Result 2242 states and 7477 transitions. [2021-01-06 22:57:46,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:46,659 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2021-01-06 22:57:46,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:46,664 INFO L225 Difference]: With dead ends: 2242 [2021-01-06 22:57:46,664 INFO L226 Difference]: Without dead ends: 2198 [2021-01-06 22:57:46,664 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 [2021-01-06 22:57:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2021-01-06 22:57:46,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1587. [2021-01-06 22:57:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2021-01-06 22:57:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 5509 transitions. [2021-01-06 22:57:46,726 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 5509 transitions. Word has length 26 [2021-01-06 22:57:46,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:46,726 INFO L481 AbstractCegarLoop]: Abstraction has 1587 states and 5509 transitions. [2021-01-06 22:57:46,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:46,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 5509 transitions. [2021-01-06 22:57:46,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 22:57:46,729 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:46,729 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] [2021-01-06 22:57:46,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 22:57:46,729 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]=== [2021-01-06 22:57:46,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:46,730 INFO L82 PathProgramCache]: Analyzing trace with hash -390835913, now seen corresponding path program 3 times [2021-01-06 22:57:46,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:46,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301134908] [2021-01-06 22:57:46,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:46,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301134908] [2021-01-06 22:57:46,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:46,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:46,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401650] [2021-01-06 22:57:46,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:46,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:46,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:46,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:46,976 INFO L87 Difference]: Start difference. First operand 1587 states and 5509 transitions. Second operand 12 states. [2021-01-06 22:57:47,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:47,453 INFO L93 Difference]: Finished difference Result 1640 states and 5473 transitions. [2021-01-06 22:57:47,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:47,454 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2021-01-06 22:57:47,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:47,459 INFO L225 Difference]: With dead ends: 1640 [2021-01-06 22:57:47,459 INFO L226 Difference]: Without dead ends: 1596 [2021-01-06 22:57:47,459 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 [2021-01-06 22:57:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2021-01-06 22:57:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 885. [2021-01-06 22:57:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2021-01-06 22:57:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2021-01-06 22:57:47,475 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2021-01-06 22:57:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:47,475 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2021-01-06 22:57:47,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2021-01-06 22:57:47,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 22:57:47,477 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:47,477 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] [2021-01-06 22:57:47,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-01-06 22:57:47,477 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]=== [2021-01-06 22:57:47,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:47,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1977826857, now seen corresponding path program 1 times [2021-01-06 22:57:47,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:47,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410824331] [2021-01-06 22:57:47,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:47,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410824331] [2021-01-06 22:57:47,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:47,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 22:57:47,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886138475] [2021-01-06 22:57:47,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:47,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:47,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:47,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:47,619 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2021-01-06 22:57:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:47,872 INFO L93 Difference]: Finished difference Result 885 states and 3021 transitions. [2021-01-06 22:57:47,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:47,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2021-01-06 22:57:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:47,875 INFO L225 Difference]: With dead ends: 885 [2021-01-06 22:57:47,875 INFO L226 Difference]: Without dead ends: 885 [2021-01-06 22:57:47,876 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 [2021-01-06 22:57:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2021-01-06 22:57:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2021-01-06 22:57:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2021-01-06 22:57:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3021 transitions. [2021-01-06 22:57:47,890 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3021 transitions. Word has length 41 [2021-01-06 22:57:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:47,890 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3021 transitions. [2021-01-06 22:57:47,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3021 transitions. [2021-01-06 22:57:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 22:57:47,892 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:47,892 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] [2021-01-06 22:57:47,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-01-06 22:57:47,892 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]=== [2021-01-06 22:57:47,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1154622732, now seen corresponding path program 1 times [2021-01-06 22:57:47,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:47,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902304707] [2021-01-06 22:57:47,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:47,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902304707] [2021-01-06 22:57:47,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:47,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:47,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855737810] [2021-01-06 22:57:47,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 22:57:47,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:47,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 22:57:47,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 22:57:47,980 INFO L87 Difference]: Start difference. First operand 885 states and 3021 transitions. Second operand 7 states. [2021-01-06 22:57:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:48,146 INFO L93 Difference]: Finished difference Result 885 states and 3017 transitions. [2021-01-06 22:57:48,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:48,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2021-01-06 22:57:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:48,150 INFO L225 Difference]: With dead ends: 885 [2021-01-06 22:57:48,150 INFO L226 Difference]: Without dead ends: 741 [2021-01-06 22:57:48,150 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 [2021-01-06 22:57:48,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2021-01-06 22:57:48,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2021-01-06 22:57:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2021-01-06 22:57:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2489 transitions. [2021-01-06 22:57:48,170 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2489 transitions. Word has length 41 [2021-01-06 22:57:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:48,171 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2489 transitions. [2021-01-06 22:57:48,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 22:57:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2489 transitions. [2021-01-06 22:57:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 22:57:48,173 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:48,173 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] [2021-01-06 22:57:48,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-01-06 22:57:48,174 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]=== [2021-01-06 22:57:48,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:48,174 INFO L82 PathProgramCache]: Analyzing trace with hash -267308717, now seen corresponding path program 1 times [2021-01-06 22:57:48,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:48,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888183372] [2021-01-06 22:57:48,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:48,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888183372] [2021-01-06 22:57:48,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:48,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 22:57:48,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140499254] [2021-01-06 22:57:48,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:48,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:48,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:48,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:48,349 INFO L87 Difference]: Start difference. First operand 741 states and 2489 transitions. Second operand 8 states. [2021-01-06 22:57:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:48,574 INFO L93 Difference]: Finished difference Result 741 states and 2481 transitions. [2021-01-06 22:57:48,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:48,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2021-01-06 22:57:48,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:48,577 INFO L225 Difference]: With dead ends: 741 [2021-01-06 22:57:48,577 INFO L226 Difference]: Without dead ends: 741 [2021-01-06 22:57:48,577 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 [2021-01-06 22:57:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2021-01-06 22:57:48,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2021-01-06 22:57:48,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2021-01-06 22:57:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2481 transitions. [2021-01-06 22:57:48,594 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2481 transitions. Word has length 41 [2021-01-06 22:57:48,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:48,595 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2481 transitions. [2021-01-06 22:57:48,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2481 transitions. [2021-01-06 22:57:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 22:57:48,598 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:48,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:48,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-01-06 22:57:48,598 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]=== [2021-01-06 22:57:48,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:48,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1194300753, now seen corresponding path program 1 times [2021-01-06 22:57:48,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:48,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660489816] [2021-01-06 22:57:48,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:48,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660489816] [2021-01-06 22:57:48,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:48,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:48,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021696507] [2021-01-06 22:57:48,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 22:57:48,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:48,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 22:57:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 22:57:48,692 INFO L87 Difference]: Start difference. First operand 741 states and 2481 transitions. Second operand 7 states. [2021-01-06 22:57:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:48,821 INFO L93 Difference]: Finished difference Result 741 states and 2477 transitions. [2021-01-06 22:57:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:48,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2021-01-06 22:57:48,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:48,823 INFO L225 Difference]: With dead ends: 741 [2021-01-06 22:57:48,823 INFO L226 Difference]: Without dead ends: 495 [2021-01-06 22:57:48,823 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 [2021-01-06 22:57:48,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2021-01-06 22:57:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2021-01-06 22:57:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2021-01-06 22:57:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1606 transitions. [2021-01-06 22:57:48,838 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1606 transitions. Word has length 41 [2021-01-06 22:57:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:48,838 INFO L481 AbstractCegarLoop]: Abstraction has 495 states and 1606 transitions. [2021-01-06 22:57:48,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 22:57:48,838 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1606 transitions. [2021-01-06 22:57:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 22:57:48,840 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:48,840 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] [2021-01-06 22:57:48,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-01-06 22:57:48,840 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]=== [2021-01-06 22:57:48,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:48,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1766059350, now seen corresponding path program 1 times [2021-01-06 22:57:48,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:48,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489824306] [2021-01-06 22:57:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 22:57:48,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 22:57:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 22:57:48,882 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 22:57:48,934 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 22:57:48,934 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 22:57:48,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-01-06 22:57:49,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 10:57:49 BasicIcfg [2021-01-06 22:57:49,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 22:57:49,095 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 22:57:49,095 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 22:57:49,096 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 22:57:49,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:56:53" (3/4) ... [2021-01-06 22:57:49,098 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 22:57:49,187 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread/singleton.i-witness.graphml [2021-01-06 22:57:49,187 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 22:57:49,188 INFO L168 Benchmark]: Toolchain (without parser) took 58018.09 ms. Allocated memory was 151.0 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 124.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 610.6 MB. Max. memory is 8.0 GB. [2021-01-06 22:57:49,188 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 151.0 MB. Free memory is still 124.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 22:57:49,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1246.40 ms. Allocated memory is still 151.0 MB. Free memory was 123.9 MB in the beginning and 83.0 MB in the end (delta: 40.8 MB). Peak memory consumption was 41.0 MB. Max. memory is 8.0 GB. [2021-01-06 22:57:49,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.47 ms. Allocated memory is still 151.0 MB. Free memory was 83.0 MB in the beginning and 81.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 22:57:49,189 INFO L168 Benchmark]: Boogie Preprocessor took 41.32 ms. Allocated memory is still 151.0 MB. Free memory was 81.0 MB in the beginning and 79.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 22:57:49,190 INFO L168 Benchmark]: RCFGBuilder took 975.61 ms. Allocated memory is still 151.0 MB. Free memory was 79.4 MB in the beginning and 51.6 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. [2021-01-06 22:57:49,190 INFO L168 Benchmark]: TraceAbstraction took 55538.65 ms. Allocated memory was 151.0 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 51.6 MB in the beginning and 1.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 516.1 MB. Max. memory is 8.0 GB. [2021-01-06 22:57:49,191 INFO L168 Benchmark]: Witness Printer took 91.68 ms. Allocated memory is still 1.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. [2021-01-06 22:57:49,194 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.53 ms. Allocated memory is still 151.0 MB. Free memory is still 124.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1246.40 ms. Allocated memory is still 151.0 MB. Free memory was 123.9 MB in the beginning and 83.0 MB in the end (delta: 40.8 MB). Peak memory consumption was 41.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 112.47 ms. Allocated memory is still 151.0 MB. Free memory was 83.0 MB in the beginning and 81.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 41.32 ms. Allocated memory is still 151.0 MB. Free memory was 81.0 MB in the beginning and 79.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 975.61 ms. Allocated memory is still 151.0 MB. Free memory was 79.4 MB in the beginning and 51.6 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 55538.65 ms. Allocated memory was 151.0 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 51.6 MB in the beginning and 1.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 516.1 MB. Max. memory is 8.0 GB. * Witness Printer took 91.68 ms. Allocated memory is still 1.8 GB. Free memory was 1.2 GB in the beginning and 1.2 GB 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.5s, 1145 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.7s, 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: 54.8s, OverallIterations: 53, TraceHistogramMax: 1, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 5380 SDtfs, 11076 SDslu, 16167 SDs, 0 SdLazy, 10055 SolverSat, 1668 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 60 SyntacticMatches, 18 SemanticMatches, 625 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 19.1s 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.9s AutomataMinimizationTime, 52 MinimizatonAttempts, 47589 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.1s 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...