/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_with-uninit-problems.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 22:56:51,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 22:56:51,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 22:56:51,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 22:56:51,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 22:56:51,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 22:56:51,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 22:56:51,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 22:56:51,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 22:56:51,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 22:56:51,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 22:56:51,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 22:56:51,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 22:56:51,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 22:56:51,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 22:56:51,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 22:56:51,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 22:56:51,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 22:56:51,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 22:56:51,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 22:56:51,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 22:56:51,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 22:56:51,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 22:56:51,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 22:56:51,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 22:56:51,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 22:56:51,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 22:56:51,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 22:56:51,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 22:56:51,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 22:56:51,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 22:56:51,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 22:56:51,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 22:56:51,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 22:56:51,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 22:56:51,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 22:56:51,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 22:56:51,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 22:56:51,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 22:56:51,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 22:56:51,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 22:56:51,345 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:51,376 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 22:56:51,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 22:56:51,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 22:56:51,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 22:56:51,380 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 22:56:51,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 22:56:51,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 22:56:51,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 22:56:51,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 22:56:51,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 22:56:51,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 22:56:51,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 22:56:51,382 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 22:56:51,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 22:56:51,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 22:56:51,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 22:56:51,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 22:56:51,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 22:56:51,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 22:56:51,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 22:56:51,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 22:56:51,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 22:56:51,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 22:56:51,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 22:56:51,384 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 22:56:51,385 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:51,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 22:56:51,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 22:56:51,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 22:56:51,880 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 22:56:51,881 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 22:56:51,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton_with-uninit-problems.i [2021-01-06 22:56:51,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a47f11bf1/16e7fceca2ad4fe58e714c646280640c/FLAG89b9eec8b [2021-01-06 22:56:52,917 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 22:56:52,918 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread/singleton_with-uninit-problems.i [2021-01-06 22:56:52,952 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a47f11bf1/16e7fceca2ad4fe58e714c646280640c/FLAG89b9eec8b [2021-01-06 22:56:53,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a47f11bf1/16e7fceca2ad4fe58e714c646280640c [2021-01-06 22:56:53,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 22:56:53,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 22:56:53,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 22:56:53,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 22:56:53,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 22:56:53,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 10:56:53" (1/1) ... [2021-01-06 22:56:53,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c408d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:53, skipping insertion in model container [2021-01-06 22:56:53,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 10:56:53" (1/1) ... [2021-01-06 22:56:53,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 22:56:53,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 22:56:53,459 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-01-06 22:56:53,816 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_with-uninit-problems.i[55568,55581] 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:53,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 22:56:53,857 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 22:56:53,878 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-01-06 22:56:53,905 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_with-uninit-problems.i[55568,55581] 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:53,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 22:56:54,160 INFO L208 MainTranslator]: Completed translation [2021-01-06 22:56:54,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:54 WrapperNode [2021-01-06 22:56:54,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 22:56:54,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 22:56:54,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 22:56:54,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 22:56:54,175 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:54" (1/1) ... [2021-01-06 22:56:54,213 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:54" (1/1) ... [2021-01-06 22:56:54,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 22:56:54,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 22:56:54,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 22:56:54,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 22:56:54,259 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:54" (1/1) ... [2021-01-06 22:56:54,259 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:54" (1/1) ... [2021-01-06 22:56:54,263 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:54" (1/1) ... [2021-01-06 22:56:54,264 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:54" (1/1) ... [2021-01-06 22:56:54,274 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:54" (1/1) ... [2021-01-06 22:56:54,277 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:54" (1/1) ... [2021-01-06 22:56:54,280 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:54" (1/1) ... [2021-01-06 22:56:54,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 22:56:54,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 22:56:54,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 22:56:54,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 22:56:54,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:54" (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:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-01-06 22:56:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 22:56:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 22:56:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-01-06 22:56:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 22:56:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-01-06 22:56:54,438 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-01-06 22:56:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-01-06 22:56:54,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-01-06 22:56:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-01-06 22:56:54,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-01-06 22:56:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-01-06 22:56:54,440 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-01-06 22:56:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 22:56:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 22:56:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 22:56:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 22:56:54,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 22:56:54,444 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:55,091 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 22:56:55,091 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-01-06 22:56:55,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:56:55 BoogieIcfgContainer [2021-01-06 22:56:55,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 22:56:55,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 22:56:55,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 22:56:55,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 22:56:55,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 10:56:53" (1/3) ... [2021-01-06 22:56:55,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a77a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 10:56:55, skipping insertion in model container [2021-01-06 22:56:55,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:56:54" (2/3) ... [2021-01-06 22:56:55,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a77a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 10:56:55, skipping insertion in model container [2021-01-06 22:56:55,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:56:55" (3/3) ... [2021-01-06 22:56:55,108 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2021-01-06 22:56:55,122 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-01-06 22:56:55,123 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 22:56:55,129 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 22:56:55,130 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-01-06 22:56:55,208 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,208 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,208 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,209 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,209 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,209 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,209 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,209 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,210 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,210 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,210 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,211 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,211 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,211 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,212 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,212 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,212 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,212 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,213 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,213 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,213 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,214 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,214 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,214 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,214 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,215 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,215 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,215 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,215 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,216 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,216 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,216 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,217 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,217 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,217 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,217 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,218 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,218 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,218 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,218 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,219 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,220 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,220 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,220 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,220 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,221 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,221 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,221 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,221 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,222 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,222 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,222 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,223 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,223 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,223 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,223 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,223 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,224 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,224 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,224 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,225 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,225 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,225 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,225 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,226 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,226 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,226 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,226 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,227 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,227 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,227 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,227 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,228 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,228 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,228 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,228 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,228 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,229 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,229 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,229 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,230 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,230 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,230 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,230 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,230 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,241 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,242 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,242 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,243 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,243 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,244 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,244 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,244 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,244 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,244 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,245 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,245 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,245 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,245 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,246 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,246 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,246 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,246 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,246 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,247 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,247 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,247 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,248 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,248 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,248 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,248 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,248 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,248 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,249 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,249 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,249 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,250 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,250 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,250 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,250 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,251 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,251 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,251 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,251 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,251 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,251 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,252 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,252 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,252 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,252 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,253 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,253 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,253 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,253 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,254 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,254 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,254 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,254 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,255 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,256 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,256 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,256 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,256 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,256 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,257 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,257 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,257 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,258 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,258 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,258 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,258 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,261 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,262 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,262 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,262 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,272 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,273 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,273 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,273 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,279 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,280 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,281 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,281 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,284 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,284 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,284 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,285 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,285 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,290 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,298 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,299 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,299 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,299 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,300 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,300 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,300 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,300 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,301 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,301 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,303 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,303 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,303 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,304 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,306 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,307 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,307 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,307 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,307 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,308 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,308 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,308 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,308 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,309 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,321 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,321 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,322 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,322 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,331 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,332 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,332 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,332 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,333 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,333 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,343 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,344 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,344 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,344 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,355 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,356 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,356 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,357 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,368 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,369 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,369 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,370 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,381 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,381 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,382 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,382 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 22:56:55,617 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-01-06 22:56:55,637 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-01-06 22:56:55,664 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 22:56:55,664 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 22:56:55,664 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 22:56:55,665 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 22:56:55,665 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 22:56:55,665 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 22:56:55,665 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 22:56:55,665 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 22:56:55,688 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-01-06 22:56:55,691 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 255 transitions, 890 flow [2021-01-06 22:56:55,695 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 255 transitions, 890 flow [2021-01-06 22:56:55,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 255 transitions, 890 flow [2021-01-06 22:56:55,835 INFO L129 PetriNetUnfolder]: 67/316 cut-off events. [2021-01-06 22:56:55,835 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-01-06 22:56:55,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 316 events. 67/316 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 990 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 365. Up to 24 conditions per place. [2021-01-06 22:56:55,872 INFO L116 LiptonReduction]: Number of co-enabled transitions 4982 [2021-01-06 22:56:59,765 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2021-01-06 22:57:00,002 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2021-01-06 22:57:00,236 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-01-06 22:57:00,356 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-01-06 22:57:00,494 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-01-06 22:57:00,629 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-01-06 22:57:01,150 INFO L131 LiptonReduction]: Checked pairs total: 55868 [2021-01-06 22:57:01,150 INFO L133 LiptonReduction]: Total number of compositions: 87 [2021-01-06 22:57:01,158 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 176 transitions, 732 flow [2021-01-06 22:57:01,899 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4478 states. [2021-01-06 22:57:01,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4478 states. [2021-01-06 22:57:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-06 22:57:01,910 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:01,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:01,911 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:01,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:01,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1918747806, now seen corresponding path program 1 times [2021-01-06 22:57:01,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:01,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038115701] [2021-01-06 22:57:01,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:02,244 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,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038115701] [2021-01-06 22:57:02,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:02,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 22:57:02,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957349801] [2021-01-06 22:57:02,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 22:57:02,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:02,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 22:57:02,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 22:57:02,287 INFO L87 Difference]: Start difference. First operand 4478 states. Second operand 5 states. [2021-01-06 22:57:02,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:02,667 INFO L93 Difference]: Finished difference Result 5737 states and 24083 transitions. [2021-01-06 22:57:02,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 22:57:02,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-01-06 22:57:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:02,755 INFO L225 Difference]: With dead ends: 5737 [2021-01-06 22:57:02,755 INFO L226 Difference]: Without dead ends: 5249 [2021-01-06 22:57:02,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 22:57:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5249 states. [2021-01-06 22:57:03,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5249 to 3995. [2021-01-06 22:57:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3995 states. [2021-01-06 22:57:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3995 states to 3995 states and 16455 transitions. [2021-01-06 22:57:03,093 INFO L78 Accepts]: Start accepts. Automaton has 3995 states and 16455 transitions. Word has length 10 [2021-01-06 22:57:03,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:03,093 INFO L481 AbstractCegarLoop]: Abstraction has 3995 states and 16455 transitions. [2021-01-06 22:57:03,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 22:57:03,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3995 states and 16455 transitions. [2021-01-06 22:57:03,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-06 22:57:03,094 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:03,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:03,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 22:57:03,095 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:03,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:03,096 INFO L82 PathProgramCache]: Analyzing trace with hash -410908784, now seen corresponding path program 2 times [2021-01-06 22:57:03,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:03,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880255232] [2021-01-06 22:57:03,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:03,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880255232] [2021-01-06 22:57:03,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:03,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 22:57:03,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668022939] [2021-01-06 22:57:03,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 22:57:03,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:03,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 22:57:03,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 22:57:03,170 INFO L87 Difference]: Start difference. First operand 3995 states and 16455 transitions. Second operand 3 states. [2021-01-06 22:57:03,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:03,322 INFO L93 Difference]: Finished difference Result 4483 states and 17814 transitions. [2021-01-06 22:57:03,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 22:57:03,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2021-01-06 22:57:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:03,378 INFO L225 Difference]: With dead ends: 4483 [2021-01-06 22:57:03,378 INFO L226 Difference]: Without dead ends: 3995 [2021-01-06 22:57:03,379 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,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3995 states. [2021-01-06 22:57:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3995 to 3995. [2021-01-06 22:57:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3995 states. [2021-01-06 22:57:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3995 states to 3995 states and 15967 transitions. [2021-01-06 22:57:03,666 INFO L78 Accepts]: Start accepts. Automaton has 3995 states and 15967 transitions. Word has length 10 [2021-01-06 22:57:03,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:03,667 INFO L481 AbstractCegarLoop]: Abstraction has 3995 states and 15967 transitions. [2021-01-06 22:57:03,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 22:57:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3995 states and 15967 transitions. [2021-01-06 22:57:03,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 22:57:03,668 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:03,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:03,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 22:57:03,669 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:03,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:03,671 INFO L82 PathProgramCache]: Analyzing trace with hash 146714135, now seen corresponding path program 1 times [2021-01-06 22:57:03,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:03,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515254625] [2021-01-06 22:57:03,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:03,865 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,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515254625] [2021-01-06 22:57:03,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:03,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:03,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177173953] [2021-01-06 22:57:03,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:03,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:03,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:03,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:03,874 INFO L87 Difference]: Start difference. First operand 3995 states and 15967 transitions. Second operand 6 states. [2021-01-06 22:57:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:04,295 INFO L93 Difference]: Finished difference Result 6505 states and 27533 transitions. [2021-01-06 22:57:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:04,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2021-01-06 22:57:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:04,354 INFO L225 Difference]: With dead ends: 6505 [2021-01-06 22:57:04,354 INFO L226 Difference]: Without dead ends: 6505 [2021-01-06 22:57:04,355 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:04,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6505 states. [2021-01-06 22:57:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6505 to 3994. [2021-01-06 22:57:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3994 states. [2021-01-06 22:57:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 15966 transitions. [2021-01-06 22:57:04,639 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 15966 transitions. Word has length 11 [2021-01-06 22:57:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:04,640 INFO L481 AbstractCegarLoop]: Abstraction has 3994 states and 15966 transitions. [2021-01-06 22:57:04,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 15966 transitions. [2021-01-06 22:57:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 22:57:04,642 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:04,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:04,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 22:57:04,643 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:04,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1573475595, now seen corresponding path program 2 times [2021-01-06 22:57:04,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:04,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24044095] [2021-01-06 22:57:04,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:04,774 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,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24044095] [2021-01-06 22:57:04,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:04,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:04,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969885953] [2021-01-06 22:57:04,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:04,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:04,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:04,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:04,777 INFO L87 Difference]: Start difference. First operand 3994 states and 15966 transitions. Second operand 6 states. [2021-01-06 22:57:05,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:05,072 INFO L93 Difference]: Finished difference Result 5238 states and 21730 transitions. [2021-01-06 22:57:05,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 22:57:05,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2021-01-06 22:57:05,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:05,108 INFO L225 Difference]: With dead ends: 5238 [2021-01-06 22:57:05,108 INFO L226 Difference]: Without dead ends: 5238 [2021-01-06 22:57:05,109 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:05,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5238 states. [2021-01-06 22:57:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5238 to 3980. [2021-01-06 22:57:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3980 states. [2021-01-06 22:57:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 15943 transitions. [2021-01-06 22:57:05,377 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 15943 transitions. Word has length 11 [2021-01-06 22:57:05,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:05,377 INFO L481 AbstractCegarLoop]: Abstraction has 3980 states and 15943 transitions. [2021-01-06 22:57:05,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:05,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 15943 transitions. [2021-01-06 22:57:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 22:57:05,385 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:05,386 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,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 22:57:05,386 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:05,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:05,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1473362807, now seen corresponding path program 1 times [2021-01-06 22:57:05,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:05,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672759203] [2021-01-06 22:57:05,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:05,463 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,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672759203] [2021-01-06 22:57:05,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:05,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 22:57:05,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426861707] [2021-01-06 22:57:05,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 22:57:05,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:05,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 22:57:05,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 22:57:05,467 INFO L87 Difference]: Start difference. First operand 3980 states and 15943 transitions. Second operand 5 states. [2021-01-06 22:57:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:05,647 INFO L93 Difference]: Finished difference Result 5159 states and 21026 transitions. [2021-01-06 22:57:05,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 22:57:05,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2021-01-06 22:57:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:05,678 INFO L225 Difference]: With dead ends: 5159 [2021-01-06 22:57:05,678 INFO L226 Difference]: Without dead ends: 5159 [2021-01-06 22:57:05,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 22:57:05,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5159 states. [2021-01-06 22:57:05,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5159 to 4561. [2021-01-06 22:57:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4561 states. [2021-01-06 22:57:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4561 states to 4561 states and 18704 transitions. [2021-01-06 22:57:06,022 INFO L78 Accepts]: Start accepts. Automaton has 4561 states and 18704 transitions. Word has length 18 [2021-01-06 22:57:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:06,022 INFO L481 AbstractCegarLoop]: Abstraction has 4561 states and 18704 transitions. [2021-01-06 22:57:06,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 22:57:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 4561 states and 18704 transitions. [2021-01-06 22:57:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 22:57:06,028 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:06,029 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,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 22:57:06,029 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:06,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:06,030 INFO L82 PathProgramCache]: Analyzing trace with hash -540147017, now seen corresponding path program 2 times [2021-01-06 22:57:06,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:06,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631237632] [2021-01-06 22:57:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:06,077 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,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631237632] [2021-01-06 22:57:06,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:06,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 22:57:06,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150295027] [2021-01-06 22:57:06,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 22:57:06,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:06,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 22:57:06,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 22:57:06,081 INFO L87 Difference]: Start difference. First operand 4561 states and 18704 transitions. Second operand 3 states. [2021-01-06 22:57:06,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:06,179 INFO L93 Difference]: Finished difference Result 7157 states and 28806 transitions. [2021-01-06 22:57:06,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 22:57:06,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2021-01-06 22:57:06,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:06,207 INFO L225 Difference]: With dead ends: 7157 [2021-01-06 22:57:06,207 INFO L226 Difference]: Without dead ends: 5563 [2021-01-06 22:57:06,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:06,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5563 states. [2021-01-06 22:57:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5563 to 4481. [2021-01-06 22:57:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4481 states. [2021-01-06 22:57:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4481 states to 4481 states and 17410 transitions. [2021-01-06 22:57:06,506 INFO L78 Accepts]: Start accepts. Automaton has 4481 states and 17410 transitions. Word has length 18 [2021-01-06 22:57:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:06,508 INFO L481 AbstractCegarLoop]: Abstraction has 4481 states and 17410 transitions. [2021-01-06 22:57:06,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 22:57:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 4481 states and 17410 transitions. [2021-01-06 22:57:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 22:57:06,510 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:06,510 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:06,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 22:57:06,511 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:06,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:06,512 INFO L82 PathProgramCache]: Analyzing trace with hash 434667714, now seen corresponding path program 1 times [2021-01-06 22:57:06,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:06,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585970178] [2021-01-06 22:57:06,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:06,619 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,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585970178] [2021-01-06 22:57:06,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:06,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:06,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166403371] [2021-01-06 22:57:06,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:06,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:06,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:06,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:06,624 INFO L87 Difference]: Start difference. First operand 4481 states and 17410 transitions. Second operand 6 states. [2021-01-06 22:57:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:06,847 INFO L93 Difference]: Finished difference Result 5717 states and 22451 transitions. [2021-01-06 22:57:06,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:06,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2021-01-06 22:57:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:06,874 INFO L225 Difference]: With dead ends: 5717 [2021-01-06 22:57:06,875 INFO L226 Difference]: Without dead ends: 5693 [2021-01-06 22:57:06,875 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:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5693 states. [2021-01-06 22:57:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5693 to 4474. [2021-01-06 22:57:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4474 states. [2021-01-06 22:57:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 17401 transitions. [2021-01-06 22:57:07,171 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 17401 transitions. Word has length 19 [2021-01-06 22:57:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:07,172 INFO L481 AbstractCegarLoop]: Abstraction has 4474 states and 17401 transitions. [2021-01-06 22:57:07,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 17401 transitions. [2021-01-06 22:57:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 22:57:07,175 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:07,175 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:07,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 22:57:07,176 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:07,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:07,177 INFO L82 PathProgramCache]: Analyzing trace with hash 780836658, now seen corresponding path program 2 times [2021-01-06 22:57:07,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:07,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939190173] [2021-01-06 22:57:07,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:07,280 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,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939190173] [2021-01-06 22:57:07,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:07,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 22:57:07,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064746300] [2021-01-06 22:57:07,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:07,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:07,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:07,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:07,284 INFO L87 Difference]: Start difference. First operand 4474 states and 17401 transitions. Second operand 6 states. [2021-01-06 22:57:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:07,435 INFO L93 Difference]: Finished difference Result 5418 states and 20587 transitions. [2021-01-06 22:57:07,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 22:57:07,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2021-01-06 22:57:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:07,468 INFO L225 Difference]: With dead ends: 5418 [2021-01-06 22:57:07,469 INFO L226 Difference]: Without dead ends: 5418 [2021-01-06 22:57:07,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5418 states. [2021-01-06 22:57:07,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5418 to 4453. [2021-01-06 22:57:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4453 states. [2021-01-06 22:57:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 17345 transitions. [2021-01-06 22:57:07,812 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 17345 transitions. Word has length 19 [2021-01-06 22:57:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:07,812 INFO L481 AbstractCegarLoop]: Abstraction has 4453 states and 17345 transitions. [2021-01-06 22:57:07,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 17345 transitions. [2021-01-06 22:57:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 22:57:07,818 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:07,819 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:07,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 22:57:07,819 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:07,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:07,820 INFO L82 PathProgramCache]: Analyzing trace with hash -51062012, now seen corresponding path program 1 times [2021-01-06 22:57:07,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:07,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641059465] [2021-01-06 22:57:07,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:07,864 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,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641059465] [2021-01-06 22:57:07,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:07,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 22:57:07,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249476488] [2021-01-06 22:57:07,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 22:57:07,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:07,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 22:57:07,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 22:57:07,867 INFO L87 Difference]: Start difference. First operand 4453 states and 17345 transitions. Second operand 5 states. [2021-01-06 22:57:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:08,048 INFO L93 Difference]: Finished difference Result 5519 states and 21448 transitions. [2021-01-06 22:57:08,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 22:57:08,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2021-01-06 22:57:08,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:08,081 INFO L225 Difference]: With dead ends: 5519 [2021-01-06 22:57:08,082 INFO L226 Difference]: Without dead ends: 5423 [2021-01-06 22:57:08,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 22:57:08,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2021-01-06 22:57:08,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 4983. [2021-01-06 22:57:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4983 states. [2021-01-06 22:57:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 19584 transitions. [2021-01-06 22:57:08,291 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 19584 transitions. Word has length 20 [2021-01-06 22:57:08,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:08,292 INFO L481 AbstractCegarLoop]: Abstraction has 4983 states and 19584 transitions. [2021-01-06 22:57:08,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 22:57:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 19584 transitions. [2021-01-06 22:57:08,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 22:57:08,297 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:08,297 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:08,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 22:57:08,297 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:08,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:08,299 INFO L82 PathProgramCache]: Analyzing trace with hash -878852686, now seen corresponding path program 2 times [2021-01-06 22:57:08,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:08,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231117369] [2021-01-06 22:57:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:08,361 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,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231117369] [2021-01-06 22:57:08,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:08,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 22:57:08,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737686502] [2021-01-06 22:57:08,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 22:57:08,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:08,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 22:57:08,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 22:57:08,366 INFO L87 Difference]: Start difference. First operand 4983 states and 19584 transitions. Second operand 4 states. [2021-01-06 22:57:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:08,590 INFO L93 Difference]: Finished difference Result 6724 states and 25076 transitions. [2021-01-06 22:57:08,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 22:57:08,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2021-01-06 22:57:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:08,626 INFO L225 Difference]: With dead ends: 6724 [2021-01-06 22:57:08,626 INFO L226 Difference]: Without dead ends: 5604 [2021-01-06 22:57:08,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 22:57:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5604 states. [2021-01-06 22:57:08,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5604 to 5230. [2021-01-06 22:57:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5230 states. [2021-01-06 22:57:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 19603 transitions. [2021-01-06 22:57:08,835 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 19603 transitions. Word has length 20 [2021-01-06 22:57:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:08,837 INFO L481 AbstractCegarLoop]: Abstraction has 5230 states and 19603 transitions. [2021-01-06 22:57:08,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 22:57:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 19603 transitions. [2021-01-06 22:57:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 22:57:08,843 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:08,843 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:08,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 22:57:08,844 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:08,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:08,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1476107581, now seen corresponding path program 1 times [2021-01-06 22:57:08,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:08,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008886944] [2021-01-06 22:57:08,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:08,948 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,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008886944] [2021-01-06 22:57:08,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:08,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:08,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533073153] [2021-01-06 22:57:08,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:08,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:08,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:08,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:08,953 INFO L87 Difference]: Start difference. First operand 5230 states and 19603 transitions. Second operand 6 states. [2021-01-06 22:57:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:09,160 INFO L93 Difference]: Finished difference Result 5940 states and 21833 transitions. [2021-01-06 22:57:09,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:09,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2021-01-06 22:57:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:09,182 INFO L225 Difference]: With dead ends: 5940 [2021-01-06 22:57:09,182 INFO L226 Difference]: Without dead ends: 5718 [2021-01-06 22:57:09,182 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:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5718 states. [2021-01-06 22:57:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5718 to 4887. [2021-01-06 22:57:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4887 states. [2021-01-06 22:57:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 18065 transitions. [2021-01-06 22:57:09,479 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 18065 transitions. Word has length 21 [2021-01-06 22:57:09,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:09,479 INFO L481 AbstractCegarLoop]: Abstraction has 4887 states and 18065 transitions. [2021-01-06 22:57:09,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 18065 transitions. [2021-01-06 22:57:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 22:57:09,484 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:09,484 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:09,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 22:57:09,485 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:09,485 INFO L82 PathProgramCache]: Analyzing trace with hash -658120403, now seen corresponding path program 1 times [2021-01-06 22:57:09,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:09,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127970624] [2021-01-06 22:57:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:09,588 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,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127970624] [2021-01-06 22:57:09,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:09,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 22:57:09,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866963391] [2021-01-06 22:57:09,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:09,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:09,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:09,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:09,592 INFO L87 Difference]: Start difference. First operand 4887 states and 18065 transitions. Second operand 6 states. [2021-01-06 22:57:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:09,762 INFO L93 Difference]: Finished difference Result 5654 states and 20566 transitions. [2021-01-06 22:57:09,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 22:57:09,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2021-01-06 22:57:09,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:09,786 INFO L225 Difference]: With dead ends: 5654 [2021-01-06 22:57:09,786 INFO L226 Difference]: Without dead ends: 5654 [2021-01-06 22:57:09,787 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5654 states. [2021-01-06 22:57:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5654 to 4899. [2021-01-06 22:57:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4899 states. [2021-01-06 22:57:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4899 states to 4899 states and 18097 transitions. [2021-01-06 22:57:09,978 INFO L78 Accepts]: Start accepts. Automaton has 4899 states and 18097 transitions. Word has length 21 [2021-01-06 22:57:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:09,978 INFO L481 AbstractCegarLoop]: Abstraction has 4899 states and 18097 transitions. [2021-01-06 22:57:09,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:09,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4899 states and 18097 transitions. [2021-01-06 22:57:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 22:57:09,987 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:09,988 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:09,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 22:57:09,988 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:09,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:09,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1403528625, now seen corresponding path program 2 times [2021-01-06 22:57:09,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:09,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121930031] [2021-01-06 22:57:09,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:10,104 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,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121930031] [2021-01-06 22:57:10,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:10,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:10,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14565092] [2021-01-06 22:57:10,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 22:57:10,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:10,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 22:57:10,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 22:57:10,112 INFO L87 Difference]: Start difference. First operand 4899 states and 18097 transitions. Second operand 7 states. [2021-01-06 22:57:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:10,259 INFO L93 Difference]: Finished difference Result 5577 states and 20321 transitions. [2021-01-06 22:57:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 22:57:10,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2021-01-06 22:57:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:10,280 INFO L225 Difference]: With dead ends: 5577 [2021-01-06 22:57:10,280 INFO L226 Difference]: Without dead ends: 5577 [2021-01-06 22:57:10,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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:10,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5577 states. [2021-01-06 22:57:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5577 to 4839. [2021-01-06 22:57:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4839 states. [2021-01-06 22:57:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 17895 transitions. [2021-01-06 22:57:10,493 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 17895 transitions. Word has length 21 [2021-01-06 22:57:10,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:10,497 INFO L481 AbstractCegarLoop]: Abstraction has 4839 states and 17895 transitions. [2021-01-06 22:57:10,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 22:57:10,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 17895 transitions. [2021-01-06 22:57:10,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-06 22:57:10,504 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:10,505 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:10,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 22:57:10,507 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:10,508 INFO L82 PathProgramCache]: Analyzing trace with hash 479765811, now seen corresponding path program 2 times [2021-01-06 22:57:10,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:10,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469818134] [2021-01-06 22:57:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:10,638 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,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469818134] [2021-01-06 22:57:10,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:10,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 22:57:10,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220369519] [2021-01-06 22:57:10,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 22:57:10,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:10,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 22:57:10,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 22:57:10,643 INFO L87 Difference]: Start difference. First operand 4839 states and 17895 transitions. Second operand 7 states. [2021-01-06 22:57:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:10,828 INFO L93 Difference]: Finished difference Result 5375 states and 19365 transitions. [2021-01-06 22:57:10,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:10,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2021-01-06 22:57:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:10,846 INFO L225 Difference]: With dead ends: 5375 [2021-01-06 22:57:10,846 INFO L226 Difference]: Without dead ends: 5140 [2021-01-06 22:57:10,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2021-01-06 22:57:11,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 4770. [2021-01-06 22:57:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4770 states. [2021-01-06 22:57:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4770 states to 4770 states and 17663 transitions. [2021-01-06 22:57:11,054 INFO L78 Accepts]: Start accepts. Automaton has 4770 states and 17663 transitions. Word has length 21 [2021-01-06 22:57:11,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:11,054 INFO L481 AbstractCegarLoop]: Abstraction has 4770 states and 17663 transitions. [2021-01-06 22:57:11,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 22:57:11,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4770 states and 17663 transitions. [2021-01-06 22:57:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 22:57:11,061 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:11,062 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:11,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 22:57:11,062 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:11,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:11,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2022418832, now seen corresponding path program 1 times [2021-01-06 22:57:11,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:11,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99629225] [2021-01-06 22:57:11,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:11,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99629225] [2021-01-06 22:57:11,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:11,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:11,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886539973] [2021-01-06 22:57:11,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:11,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:11,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:11,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:11,228 INFO L87 Difference]: Start difference. First operand 4770 states and 17663 transitions. Second operand 8 states. [2021-01-06 22:57:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:11,755 INFO L93 Difference]: Finished difference Result 6062 states and 22739 transitions. [2021-01-06 22:57:11,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 22:57:11,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2021-01-06 22:57:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:11,778 INFO L225 Difference]: With dead ends: 6062 [2021-01-06 22:57:11,779 INFO L226 Difference]: Without dead ends: 5902 [2021-01-06 22:57:11,782 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:11,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5902 states. [2021-01-06 22:57:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5902 to 5126. [2021-01-06 22:57:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5126 states. [2021-01-06 22:57:12,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5126 states to 5126 states and 19402 transitions. [2021-01-06 22:57:12,007 INFO L78 Accepts]: Start accepts. Automaton has 5126 states and 19402 transitions. Word has length 22 [2021-01-06 22:57:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:12,008 INFO L481 AbstractCegarLoop]: Abstraction has 5126 states and 19402 transitions. [2021-01-06 22:57:12,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 5126 states and 19402 transitions. [2021-01-06 22:57:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 22:57:12,016 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:12,017 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:12,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 22:57:12,017 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:12,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:12,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1501683984, now seen corresponding path program 2 times [2021-01-06 22:57:12,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:12,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297080757] [2021-01-06 22:57:12,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:12,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297080757] [2021-01-06 22:57:12,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:12,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 22:57:12,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854326048] [2021-01-06 22:57:12,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 22:57:12,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 22:57:12,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 22:57:12,188 INFO L87 Difference]: Start difference. First operand 5126 states and 19402 transitions. Second operand 9 states. [2021-01-06 22:57:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:12,579 INFO L93 Difference]: Finished difference Result 7825 states and 30453 transitions. [2021-01-06 22:57:12,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:12,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2021-01-06 22:57:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:12,604 INFO L225 Difference]: With dead ends: 7825 [2021-01-06 22:57:12,604 INFO L226 Difference]: Without dead ends: 7665 [2021-01-06 22:57:12,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-01-06 22:57:12,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7665 states. [2021-01-06 22:57:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7665 to 5124. [2021-01-06 22:57:12,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2021-01-06 22:57:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 19398 transitions. [2021-01-06 22:57:12,844 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 19398 transitions. Word has length 22 [2021-01-06 22:57:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:12,844 INFO L481 AbstractCegarLoop]: Abstraction has 5124 states and 19398 transitions. [2021-01-06 22:57:12,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 22:57:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 19398 transitions. [2021-01-06 22:57:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 22:57:12,852 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:12,852 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:12,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 22:57:12,852 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1670308188, now seen corresponding path program 3 times [2021-01-06 22:57:12,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:12,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995806331] [2021-01-06 22:57:12,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:12,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995806331] [2021-01-06 22:57:12,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:12,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 22:57:12,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567261730] [2021-01-06 22:57:12,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 22:57:12,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:12,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 22:57:12,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 22:57:12,991 INFO L87 Difference]: Start difference. First operand 5124 states and 19398 transitions. Second operand 9 states. [2021-01-06 22:57:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:13,324 INFO L93 Difference]: Finished difference Result 6406 states and 24448 transitions. [2021-01-06 22:57:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:13,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2021-01-06 22:57:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:13,346 INFO L225 Difference]: With dead ends: 6406 [2021-01-06 22:57:13,347 INFO L226 Difference]: Without dead ends: 6246 [2021-01-06 22:57:13,347 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:13,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2021-01-06 22:57:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 5120. [2021-01-06 22:57:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5120 states. [2021-01-06 22:57:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5120 states to 5120 states and 19386 transitions. [2021-01-06 22:57:13,563 INFO L78 Accepts]: Start accepts. Automaton has 5120 states and 19386 transitions. Word has length 22 [2021-01-06 22:57:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:13,564 INFO L481 AbstractCegarLoop]: Abstraction has 5120 states and 19386 transitions. [2021-01-06 22:57:13,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 22:57:13,564 INFO L276 IsEmpty]: Start isEmpty. Operand 5120 states and 19386 transitions. [2021-01-06 22:57:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 22:57:13,571 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:13,571 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:13,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 22:57:13,572 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:13,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:13,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1267239594, now seen corresponding path program 4 times [2021-01-06 22:57:13,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:13,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221603051] [2021-01-06 22:57:13,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:13,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221603051] [2021-01-06 22:57:13,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:13,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 22:57:13,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857994313] [2021-01-06 22:57:13,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 22:57:13,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:13,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 22:57:13,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:13,827 INFO L87 Difference]: Start difference. First operand 5120 states and 19386 transitions. Second operand 11 states. [2021-01-06 22:57:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:14,686 INFO L93 Difference]: Finished difference Result 6594 states and 25441 transitions. [2021-01-06 22:57:14,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 22:57:14,687 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2021-01-06 22:57:14,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:14,706 INFO L225 Difference]: With dead ends: 6594 [2021-01-06 22:57:14,707 INFO L226 Difference]: Without dead ends: 6496 [2021-01-06 22:57:14,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-01-06 22:57:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2021-01-06 22:57:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 5108. [2021-01-06 22:57:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5108 states. [2021-01-06 22:57:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5108 states to 5108 states and 19355 transitions. [2021-01-06 22:57:14,910 INFO L78 Accepts]: Start accepts. Automaton has 5108 states and 19355 transitions. Word has length 22 [2021-01-06 22:57:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:14,911 INFO L481 AbstractCegarLoop]: Abstraction has 5108 states and 19355 transitions. [2021-01-06 22:57:14,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 22:57:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 5108 states and 19355 transitions. [2021-01-06 22:57:14,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 22:57:14,925 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:14,925 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:14,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 22:57:14,925 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:14,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:14,926 INFO L82 PathProgramCache]: Analyzing trace with hash -335513452, now seen corresponding path program 1 times [2021-01-06 22:57:14,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:14,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106005142] [2021-01-06 22:57:14,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:14,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106005142] [2021-01-06 22:57:14,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:14,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 22:57:14,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179160536] [2021-01-06 22:57:14,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 22:57:14,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:14,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 22:57:14,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 22:57:14,983 INFO L87 Difference]: Start difference. First operand 5108 states and 19355 transitions. Second operand 5 states. [2021-01-06 22:57:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:15,140 INFO L93 Difference]: Finished difference Result 5740 states and 21369 transitions. [2021-01-06 22:57:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 22:57:15,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2021-01-06 22:57:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:15,165 INFO L225 Difference]: With dead ends: 5740 [2021-01-06 22:57:15,165 INFO L226 Difference]: Without dead ends: 5538 [2021-01-06 22:57:15,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 22:57:15,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5538 states. [2021-01-06 22:57:15,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5538 to 5288. [2021-01-06 22:57:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5288 states. [2021-01-06 22:57:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5288 states to 5288 states and 19964 transitions. [2021-01-06 22:57:15,321 INFO L78 Accepts]: Start accepts. Automaton has 5288 states and 19964 transitions. Word has length 23 [2021-01-06 22:57:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:15,322 INFO L481 AbstractCegarLoop]: Abstraction has 5288 states and 19964 transitions. [2021-01-06 22:57:15,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 22:57:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 5288 states and 19964 transitions. [2021-01-06 22:57:15,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 22:57:15,331 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:15,331 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:15,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 22:57:15,331 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:15,332 INFO L82 PathProgramCache]: Analyzing trace with hash 654731046, now seen corresponding path program 2 times [2021-01-06 22:57:15,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:15,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530983285] [2021-01-06 22:57:15,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:15,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530983285] [2021-01-06 22:57:15,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:15,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:15,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64198489] [2021-01-06 22:57:15,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:15,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:15,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:15,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:15,402 INFO L87 Difference]: Start difference. First operand 5288 states and 19964 transitions. Second operand 6 states. [2021-01-06 22:57:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:15,617 INFO L93 Difference]: Finished difference Result 5634 states and 20831 transitions. [2021-01-06 22:57:15,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:15,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2021-01-06 22:57:15,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:15,633 INFO L225 Difference]: With dead ends: 5634 [2021-01-06 22:57:15,633 INFO L226 Difference]: Without dead ends: 5432 [2021-01-06 22:57:15,633 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:15,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5432 states. [2021-01-06 22:57:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5432 to 5044. [2021-01-06 22:57:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5044 states. [2021-01-06 22:57:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5044 states to 5044 states and 18964 transitions. [2021-01-06 22:57:15,765 INFO L78 Accepts]: Start accepts. Automaton has 5044 states and 18964 transitions. Word has length 23 [2021-01-06 22:57:15,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:15,765 INFO L481 AbstractCegarLoop]: Abstraction has 5044 states and 18964 transitions. [2021-01-06 22:57:15,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 5044 states and 18964 transitions. [2021-01-06 22:57:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 22:57:15,772 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:15,772 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:15,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 22:57:15,772 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:15,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:15,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1393943423, now seen corresponding path program 1 times [2021-01-06 22:57:15,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:15,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738836793] [2021-01-06 22:57:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:15,831 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,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738836793] [2021-01-06 22:57:15,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:15,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 22:57:15,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44231356] [2021-01-06 22:57:15,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:15,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:15,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:15,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:15,839 INFO L87 Difference]: Start difference. First operand 5044 states and 18964 transitions. Second operand 6 states. [2021-01-06 22:57:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:15,952 INFO L93 Difference]: Finished difference Result 5955 states and 22016 transitions. [2021-01-06 22:57:15,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 22:57:15,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2021-01-06 22:57:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:15,966 INFO L225 Difference]: With dead ends: 5955 [2021-01-06 22:57:15,966 INFO L226 Difference]: Without dead ends: 5444 [2021-01-06 22:57:15,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:15,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5444 states. [2021-01-06 22:57:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5444 to 4599. [2021-01-06 22:57:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4599 states. [2021-01-06 22:57:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 17009 transitions. [2021-01-06 22:57:16,089 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 17009 transitions. Word has length 23 [2021-01-06 22:57:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:16,089 INFO L481 AbstractCegarLoop]: Abstraction has 4599 states and 17009 transitions. [2021-01-06 22:57:16,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 17009 transitions. [2021-01-06 22:57:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 22:57:16,095 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:16,095 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:16,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 22:57:16,095 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:16,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1259322281, now seen corresponding path program 2 times [2021-01-06 22:57:16,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:16,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399533751] [2021-01-06 22:57:16,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:16,182 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,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399533751] [2021-01-06 22:57:16,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:16,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:16,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443234819] [2021-01-06 22:57:16,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 22:57:16,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:16,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 22:57:16,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 22:57:16,185 INFO L87 Difference]: Start difference. First operand 4599 states and 17009 transitions. Second operand 7 states. [2021-01-06 22:57:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:16,344 INFO L93 Difference]: Finished difference Result 5350 states and 19634 transitions. [2021-01-06 22:57:16,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 22:57:16,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2021-01-06 22:57:16,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:16,359 INFO L225 Difference]: With dead ends: 5350 [2021-01-06 22:57:16,359 INFO L226 Difference]: Without dead ends: 5181 [2021-01-06 22:57:16,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5181 states. [2021-01-06 22:57:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5181 to 4587. [2021-01-06 22:57:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4587 states. [2021-01-06 22:57:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4587 states to 4587 states and 16982 transitions. [2021-01-06 22:57:16,474 INFO L78 Accepts]: Start accepts. Automaton has 4587 states and 16982 transitions. Word has length 23 [2021-01-06 22:57:16,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:16,474 INFO L481 AbstractCegarLoop]: Abstraction has 4587 states and 16982 transitions. [2021-01-06 22:57:16,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 22:57:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4587 states and 16982 transitions. [2021-01-06 22:57:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 22:57:16,479 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:16,479 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:16,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 22:57:16,480 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash -337085191, now seen corresponding path program 3 times [2021-01-06 22:57:16,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:16,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139040520] [2021-01-06 22:57:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:16,587 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,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139040520] [2021-01-06 22:57:16,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:16,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:16,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668267904] [2021-01-06 22:57:16,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:16,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:16,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:16,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:16,590 INFO L87 Difference]: Start difference. First operand 4587 states and 16982 transitions. Second operand 8 states. [2021-01-06 22:57:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:16,987 INFO L93 Difference]: Finished difference Result 6441 states and 23994 transitions. [2021-01-06 22:57:16,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:16,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2021-01-06 22:57:16,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:17,007 INFO L225 Difference]: With dead ends: 6441 [2021-01-06 22:57:17,007 INFO L226 Difference]: Without dead ends: 6333 [2021-01-06 22:57:17,008 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:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6333 states. [2021-01-06 22:57:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6333 to 4776. [2021-01-06 22:57:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4776 states. [2021-01-06 22:57:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4776 states to 4776 states and 17749 transitions. [2021-01-06 22:57:17,100 INFO L78 Accepts]: Start accepts. Automaton has 4776 states and 17749 transitions. Word has length 23 [2021-01-06 22:57:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:17,101 INFO L481 AbstractCegarLoop]: Abstraction has 4776 states and 17749 transitions. [2021-01-06 22:57:17,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 4776 states and 17749 transitions. [2021-01-06 22:57:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 22:57:17,106 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:17,106 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:17,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 22:57:17,106 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:17,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1845797673, now seen corresponding path program 4 times [2021-01-06 22:57:17,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:17,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659745069] [2021-01-06 22:57:17,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:17,187 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,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659745069] [2021-01-06 22:57:17,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:17,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:17,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524286685] [2021-01-06 22:57:17,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:17,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:17,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:17,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:17,190 INFO L87 Difference]: Start difference. First operand 4776 states and 17749 transitions. Second operand 8 states. [2021-01-06 22:57:17,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:17,474 INFO L93 Difference]: Finished difference Result 5607 states and 20671 transitions. [2021-01-06 22:57:17,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:17,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2021-01-06 22:57:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:17,490 INFO L225 Difference]: With dead ends: 5607 [2021-01-06 22:57:17,490 INFO L226 Difference]: Without dead ends: 5499 [2021-01-06 22:57:17,491 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:17,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2021-01-06 22:57:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 4744. [2021-01-06 22:57:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4744 states. [2021-01-06 22:57:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4744 states to 4744 states and 17579 transitions. [2021-01-06 22:57:17,598 INFO L78 Accepts]: Start accepts. Automaton has 4744 states and 17579 transitions. Word has length 23 [2021-01-06 22:57:17,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:17,598 INFO L481 AbstractCegarLoop]: Abstraction has 4744 states and 17579 transitions. [2021-01-06 22:57:17,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:17,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4744 states and 17579 transitions. [2021-01-06 22:57:17,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 22:57:17,604 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:17,604 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:17,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 22:57:17,605 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:17,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:17,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1362361899, now seen corresponding path program 1 times [2021-01-06 22:57:17,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:17,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020890978] [2021-01-06 22:57:17,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:17,873 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,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020890978] [2021-01-06 22:57:17,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:17,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 22:57:17,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495027278] [2021-01-06 22:57:17,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 22:57:17,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:17,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 22:57:17,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:17,876 INFO L87 Difference]: Start difference. First operand 4744 states and 17579 transitions. Second operand 11 states. [2021-01-06 22:57:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:18,671 INFO L93 Difference]: Finished difference Result 5846 states and 21883 transitions. [2021-01-06 22:57:18,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 22:57:18,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2021-01-06 22:57:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:18,694 INFO L225 Difference]: With dead ends: 5846 [2021-01-06 22:57:18,694 INFO L226 Difference]: Without dead ends: 5680 [2021-01-06 22:57:18,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-01-06 22:57:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5680 states. [2021-01-06 22:57:18,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5680 to 4707. [2021-01-06 22:57:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4707 states. [2021-01-06 22:57:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4707 states to 4707 states and 17526 transitions. [2021-01-06 22:57:18,847 INFO L78 Accepts]: Start accepts. Automaton has 4707 states and 17526 transitions. Word has length 23 [2021-01-06 22:57:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:18,847 INFO L481 AbstractCegarLoop]: Abstraction has 4707 states and 17526 transitions. [2021-01-06 22:57:18,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 22:57:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4707 states and 17526 transitions. [2021-01-06 22:57:18,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 22:57:18,854 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:18,854 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:18,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 22:57:18,855 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:18,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:18,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1508198191, now seen corresponding path program 5 times [2021-01-06 22:57:18,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:18,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212191141] [2021-01-06 22:57:18,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:18,998 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:18,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212191141] [2021-01-06 22:57:18,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:18,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 22:57:18,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881227931] [2021-01-06 22:57:18,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 22:57:19,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:19,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 22:57:19,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:19,001 INFO L87 Difference]: Start difference. First operand 4707 states and 17526 transitions. Second operand 10 states. [2021-01-06 22:57:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:19,353 INFO L93 Difference]: Finished difference Result 5834 states and 21729 transitions. [2021-01-06 22:57:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:19,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2021-01-06 22:57:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:19,372 INFO L225 Difference]: With dead ends: 5834 [2021-01-06 22:57:19,372 INFO L226 Difference]: Without dead ends: 5792 [2021-01-06 22:57:19,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-01-06 22:57:19,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5792 states. [2021-01-06 22:57:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5792 to 4835. [2021-01-06 22:57:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4835 states. [2021-01-06 22:57:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4835 states to 4835 states and 18085 transitions. [2021-01-06 22:57:19,515 INFO L78 Accepts]: Start accepts. Automaton has 4835 states and 18085 transitions. Word has length 23 [2021-01-06 22:57:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:19,515 INFO L481 AbstractCegarLoop]: Abstraction has 4835 states and 18085 transitions. [2021-01-06 22:57:19,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 22:57:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4835 states and 18085 transitions. [2021-01-06 22:57:19,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 22:57:19,522 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:19,523 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:19,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 22:57:19,523 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:19,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:19,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1172688247, now seen corresponding path program 6 times [2021-01-06 22:57:19,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:19,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026538972] [2021-01-06 22:57:19,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:19,641 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,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026538972] [2021-01-06 22:57:19,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:19,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 22:57:19,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382412697] [2021-01-06 22:57:19,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:19,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:19,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:19,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:19,643 INFO L87 Difference]: Start difference. First operand 4835 states and 18085 transitions. Second operand 8 states. [2021-01-06 22:57:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:19,774 INFO L93 Difference]: Finished difference Result 4832 states and 18017 transitions. [2021-01-06 22:57:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 22:57:19,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2021-01-06 22:57:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:19,784 INFO L225 Difference]: With dead ends: 4832 [2021-01-06 22:57:19,785 INFO L226 Difference]: Without dead ends: 4832 [2021-01-06 22:57:19,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:19,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2021-01-06 22:57:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 4441. [2021-01-06 22:57:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4441 states. [2021-01-06 22:57:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4441 states to 4441 states and 16520 transitions. [2021-01-06 22:57:19,868 INFO L78 Accepts]: Start accepts. Automaton has 4441 states and 16520 transitions. Word has length 23 [2021-01-06 22:57:19,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:19,868 INFO L481 AbstractCegarLoop]: Abstraction has 4441 states and 16520 transitions. [2021-01-06 22:57:19,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 4441 states and 16520 transitions. [2021-01-06 22:57:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 22:57:19,872 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:19,873 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:19,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 22:57:19,873 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:19,873 INFO L82 PathProgramCache]: Analyzing trace with hash -28113609, now seen corresponding path program 1 times [2021-01-06 22:57:19,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:19,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089784901] [2021-01-06 22:57:19,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:19,970 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,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089784901] [2021-01-06 22:57:19,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:19,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:19,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223023039] [2021-01-06 22:57:19,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:19,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:19,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:19,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:19,972 INFO L87 Difference]: Start difference. First operand 4441 states and 16520 transitions. Second operand 8 states. [2021-01-06 22:57:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:20,142 INFO L93 Difference]: Finished difference Result 4773 states and 17401 transitions. [2021-01-06 22:57:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:20,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2021-01-06 22:57:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:20,157 INFO L225 Difference]: With dead ends: 4773 [2021-01-06 22:57:20,157 INFO L226 Difference]: Without dead ends: 4444 [2021-01-06 22:57:20,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4444 states. [2021-01-06 22:57:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4444 to 3748. [2021-01-06 22:57:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3748 states. [2021-01-06 22:57:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3748 states to 3748 states and 13965 transitions. [2021-01-06 22:57:20,269 INFO L78 Accepts]: Start accepts. Automaton has 3748 states and 13965 transitions. Word has length 23 [2021-01-06 22:57:20,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:20,270 INFO L481 AbstractCegarLoop]: Abstraction has 3748 states and 13965 transitions. [2021-01-06 22:57:20,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3748 states and 13965 transitions. [2021-01-06 22:57:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 22:57:20,278 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:20,278 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] [2021-01-06 22:57:20,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 22:57:20,278 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2056704833, now seen corresponding path program 1 times [2021-01-06 22:57:20,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:20,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715066307] [2021-01-06 22:57:20,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:20,618 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,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715066307] [2021-01-06 22:57:20,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:20,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:20,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751485318] [2021-01-06 22:57:20,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:20,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:20,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:20,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:20,620 INFO L87 Difference]: Start difference. First operand 3748 states and 13965 transitions. Second operand 12 states. [2021-01-06 22:57:21,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:21,636 INFO L93 Difference]: Finished difference Result 4511 states and 17017 transitions. [2021-01-06 22:57:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 22:57:21,636 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2021-01-06 22:57:21,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:21,646 INFO L225 Difference]: With dead ends: 4511 [2021-01-06 22:57:21,647 INFO L226 Difference]: Without dead ends: 4283 [2021-01-06 22:57:21,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2021-01-06 22:57:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4283 states. [2021-01-06 22:57:21,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4283 to 3048. [2021-01-06 22:57:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3048 states. [2021-01-06 22:57:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 11102 transitions. [2021-01-06 22:57:21,711 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 11102 transitions. Word has length 25 [2021-01-06 22:57:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:21,711 INFO L481 AbstractCegarLoop]: Abstraction has 3048 states and 11102 transitions. [2021-01-06 22:57:21,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 11102 transitions. [2021-01-06 22:57:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 22:57:21,716 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:21,716 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:21,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 22:57:21,716 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:21,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:21,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1187319537, now seen corresponding path program 1 times [2021-01-06 22:57:21,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:21,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514098194] [2021-01-06 22:57:21,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:21,805 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:21,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514098194] [2021-01-06 22:57:21,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:21,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:21,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935556807] [2021-01-06 22:57:21,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:21,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:21,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:21,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:21,808 INFO L87 Difference]: Start difference. First operand 3048 states and 11102 transitions. Second operand 8 states. [2021-01-06 22:57:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:22,159 INFO L93 Difference]: Finished difference Result 3362 states and 12023 transitions. [2021-01-06 22:57:22,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 22:57:22,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2021-01-06 22:57:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:22,168 INFO L225 Difference]: With dead ends: 3362 [2021-01-06 22:57:22,168 INFO L226 Difference]: Without dead ends: 3242 [2021-01-06 22:57:22,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-01-06 22:57:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2021-01-06 22:57:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 2875. [2021-01-06 22:57:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2875 states. [2021-01-06 22:57:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 10403 transitions. [2021-01-06 22:57:22,287 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 10403 transitions. Word has length 26 [2021-01-06 22:57:22,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:22,287 INFO L481 AbstractCegarLoop]: Abstraction has 2875 states and 10403 transitions. [2021-01-06 22:57:22,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 10403 transitions. [2021-01-06 22:57:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 22:57:22,294 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:22,294 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:22,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 22:57:22,294 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:22,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:22,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1028221071, now seen corresponding path program 2 times [2021-01-06 22:57:22,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:22,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086120602] [2021-01-06 22:57:22,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:22,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086120602] [2021-01-06 22:57:22,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:22,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 22:57:22,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783249384] [2021-01-06 22:57:22,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 22:57:22,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:22,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 22:57:22,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-06 22:57:22,451 INFO L87 Difference]: Start difference. First operand 2875 states and 10403 transitions. Second operand 9 states. [2021-01-06 22:57:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:22,935 INFO L93 Difference]: Finished difference Result 3797 states and 13773 transitions. [2021-01-06 22:57:22,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 22:57:22,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2021-01-06 22:57:22,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:22,945 INFO L225 Difference]: With dead ends: 3797 [2021-01-06 22:57:22,945 INFO L226 Difference]: Without dead ends: 3725 [2021-01-06 22:57:22,946 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:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3725 states. [2021-01-06 22:57:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3725 to 3043. [2021-01-06 22:57:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2021-01-06 22:57:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 11114 transitions. [2021-01-06 22:57:23,039 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 11114 transitions. Word has length 26 [2021-01-06 22:57:23,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:23,040 INFO L481 AbstractCegarLoop]: Abstraction has 3043 states and 11114 transitions. [2021-01-06 22:57:23,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 22:57:23,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 11114 transitions. [2021-01-06 22:57:23,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 22:57:23,047 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:23,047 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 22:57:23,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 22:57:23,047 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:23,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:23,048 INFO L82 PathProgramCache]: Analyzing trace with hash 184481335, now seen corresponding path program 1 times [2021-01-06 22:57:23,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:23,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351935078] [2021-01-06 22:57:23,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:23,200 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,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351935078] [2021-01-06 22:57:23,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:23,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 22:57:23,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715627233] [2021-01-06 22:57:23,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 22:57:23,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:23,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 22:57:23,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-06 22:57:23,203 INFO L87 Difference]: Start difference. First operand 3043 states and 11114 transitions. Second operand 9 states. [2021-01-06 22:57:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:23,668 INFO L93 Difference]: Finished difference Result 3389 states and 12128 transitions. [2021-01-06 22:57:23,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:23,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2021-01-06 22:57:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:23,679 INFO L225 Difference]: With dead ends: 3389 [2021-01-06 22:57:23,679 INFO L226 Difference]: Without dead ends: 3267 [2021-01-06 22:57:23,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-01-06 22:57:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3267 states. [2021-01-06 22:57:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3267 to 2868. [2021-01-06 22:57:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2868 states. [2021-01-06 22:57:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 10386 transitions. [2021-01-06 22:57:23,748 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 10386 transitions. Word has length 26 [2021-01-06 22:57:23,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:23,748 INFO L481 AbstractCegarLoop]: Abstraction has 2868 states and 10386 transitions. [2021-01-06 22:57:23,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 22:57:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 10386 transitions. [2021-01-06 22:57:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 22:57:23,754 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:23,754 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:23,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 22:57:23,754 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:23,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:23,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2021023853, now seen corresponding path program 3 times [2021-01-06 22:57:23,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:23,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882244791] [2021-01-06 22:57:23,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:23,882 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,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882244791] [2021-01-06 22:57:23,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:23,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 22:57:23,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544772750] [2021-01-06 22:57:23,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 22:57:23,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:23,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 22:57:23,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:23,886 INFO L87 Difference]: Start difference. First operand 2868 states and 10386 transitions. Second operand 10 states. [2021-01-06 22:57:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:24,213 INFO L93 Difference]: Finished difference Result 4342 states and 16142 transitions. [2021-01-06 22:57:24,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:24,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2021-01-06 22:57:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:24,227 INFO L225 Difference]: With dead ends: 4342 [2021-01-06 22:57:24,227 INFO L226 Difference]: Without dead ends: 4270 [2021-01-06 22:57:24,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-01-06 22:57:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4270 states. [2021-01-06 22:57:24,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4270 to 3030. [2021-01-06 22:57:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2021-01-06 22:57:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 11079 transitions. [2021-01-06 22:57:24,306 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 11079 transitions. Word has length 26 [2021-01-06 22:57:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:24,307 INFO L481 AbstractCegarLoop]: Abstraction has 3030 states and 11079 transitions. [2021-01-06 22:57:24,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 22:57:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 11079 transitions. [2021-01-06 22:57:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 22:57:24,313 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:24,313 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:24,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 22:57:24,313 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:24,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:24,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1061241037, now seen corresponding path program 2 times [2021-01-06 22:57:24,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:24,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851753064] [2021-01-06 22:57:24,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:24,515 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,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851753064] [2021-01-06 22:57:24,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:24,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 22:57:24,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47832349] [2021-01-06 22:57:24,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 22:57:24,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:24,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 22:57:24,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:24,518 INFO L87 Difference]: Start difference. First operand 3030 states and 11079 transitions. Second operand 10 states. [2021-01-06 22:57:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:25,095 INFO L93 Difference]: Finished difference Result 3755 states and 13672 transitions. [2021-01-06 22:57:25,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:25,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2021-01-06 22:57:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:25,110 INFO L225 Difference]: With dead ends: 3755 [2021-01-06 22:57:25,111 INFO L226 Difference]: Without dead ends: 3634 [2021-01-06 22:57:25,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-01-06 22:57:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2021-01-06 22:57:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 3010. [2021-01-06 22:57:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3010 states. [2021-01-06 22:57:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 11010 transitions. [2021-01-06 22:57:25,217 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 11010 transitions. Word has length 26 [2021-01-06 22:57:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:25,217 INFO L481 AbstractCegarLoop]: Abstraction has 3010 states and 11010 transitions. [2021-01-06 22:57:25,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 22:57:25,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 11010 transitions. [2021-01-06 22:57:25,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 22:57:25,224 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:25,224 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:25,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 22:57:25,225 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:25,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:25,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1632342331, now seen corresponding path program 4 times [2021-01-06 22:57:25,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:25,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165053263] [2021-01-06 22:57:25,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:25,388 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,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165053263] [2021-01-06 22:57:25,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:25,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 22:57:25,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764577421] [2021-01-06 22:57:25,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 22:57:25,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:25,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 22:57:25,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:25,393 INFO L87 Difference]: Start difference. First operand 3010 states and 11010 transitions. Second operand 10 states. [2021-01-06 22:57:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:25,665 INFO L93 Difference]: Finished difference Result 3360 states and 12055 transitions. [2021-01-06 22:57:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:25,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2021-01-06 22:57:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:25,678 INFO L225 Difference]: With dead ends: 3360 [2021-01-06 22:57:25,679 INFO L226 Difference]: Without dead ends: 3240 [2021-01-06 22:57:25,679 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:25,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3240 states. [2021-01-06 22:57:25,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 2856. [2021-01-06 22:57:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2021-01-06 22:57:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 10348 transitions. [2021-01-06 22:57:25,774 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 10348 transitions. Word has length 26 [2021-01-06 22:57:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:25,775 INFO L481 AbstractCegarLoop]: Abstraction has 2856 states and 10348 transitions. [2021-01-06 22:57:25,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 22:57:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 10348 transitions. [2021-01-06 22:57:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 22:57:25,782 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:25,782 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:25,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 22:57:25,783 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:25,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:25,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1015231137, now seen corresponding path program 5 times [2021-01-06 22:57:25,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:25,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588452401] [2021-01-06 22:57:25,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:26,112 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,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588452401] [2021-01-06 22:57:26,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:26,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:26,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189787629] [2021-01-06 22:57:26,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:26,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:26,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:26,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:26,115 INFO L87 Difference]: Start difference. First operand 2856 states and 10348 transitions. Second operand 12 states. [2021-01-06 22:57:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:26,616 INFO L93 Difference]: Finished difference Result 3631 states and 13193 transitions. [2021-01-06 22:57:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:26,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2021-01-06 22:57:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:26,630 INFO L225 Difference]: With dead ends: 3631 [2021-01-06 22:57:26,630 INFO L226 Difference]: Without dead ends: 3559 [2021-01-06 22:57:26,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-01-06 22:57:26,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2021-01-06 22:57:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 2905. [2021-01-06 22:57:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2905 states. [2021-01-06 22:57:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 10605 transitions. [2021-01-06 22:57:26,730 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 10605 transitions. Word has length 26 [2021-01-06 22:57:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:26,730 INFO L481 AbstractCegarLoop]: Abstraction has 2905 states and 10605 transitions. [2021-01-06 22:57:26,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 10605 transitions. [2021-01-06 22:57:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 22:57:26,738 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:26,738 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:26,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 22:57:26,738 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:26,739 INFO L82 PathProgramCache]: Analyzing trace with hash -893726613, now seen corresponding path program 3 times [2021-01-06 22:57:26,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:26,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944630625] [2021-01-06 22:57:26,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:27,037 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:27,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944630625] [2021-01-06 22:57:27,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:27,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:27,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557759418] [2021-01-06 22:57:27,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:27,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:27,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:27,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:27,039 INFO L87 Difference]: Start difference. First operand 2905 states and 10605 transitions. Second operand 12 states. [2021-01-06 22:57:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:27,534 INFO L93 Difference]: Finished difference Result 3537 states and 12449 transitions. [2021-01-06 22:57:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:27,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2021-01-06 22:57:27,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:27,548 INFO L225 Difference]: With dead ends: 3537 [2021-01-06 22:57:27,548 INFO L226 Difference]: Without dead ends: 3439 [2021-01-06 22:57:27,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-01-06 22:57:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3439 states. [2021-01-06 22:57:27,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3439 to 2715. [2021-01-06 22:57:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2715 states. [2021-01-06 22:57:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 9581 transitions. [2021-01-06 22:57:27,640 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 9581 transitions. Word has length 26 [2021-01-06 22:57:27,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:27,641 INFO L481 AbstractCegarLoop]: Abstraction has 2715 states and 9581 transitions. [2021-01-06 22:57:27,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 9581 transitions. [2021-01-06 22:57:27,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 22:57:27,646 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:27,647 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:27,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 22:57:27,647 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:27,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:27,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1095200096, now seen corresponding path program 1 times [2021-01-06 22:57:27,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:27,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538968620] [2021-01-06 22:57:27,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:27,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:27,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538968620] [2021-01-06 22:57:27,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:27,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 22:57:27,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385181826] [2021-01-06 22:57:27,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 22:57:27,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:27,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 22:57:27,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:27,822 INFO L87 Difference]: Start difference. First operand 2715 states and 9581 transitions. Second operand 10 states. [2021-01-06 22:57:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:28,308 INFO L93 Difference]: Finished difference Result 3947 states and 13862 transitions. [2021-01-06 22:57:28,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:28,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2021-01-06 22:57:28,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:28,322 INFO L225 Difference]: With dead ends: 3947 [2021-01-06 22:57:28,323 INFO L226 Difference]: Without dead ends: 3849 [2021-01-06 22:57:28,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-01-06 22:57:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2021-01-06 22:57:28,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 2715. [2021-01-06 22:57:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2715 states. [2021-01-06 22:57:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 9581 transitions. [2021-01-06 22:57:28,412 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 9581 transitions. Word has length 26 [2021-01-06 22:57:28,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:28,412 INFO L481 AbstractCegarLoop]: Abstraction has 2715 states and 9581 transitions. [2021-01-06 22:57:28,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 22:57:28,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 9581 transitions. [2021-01-06 22:57:28,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 22:57:28,418 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:28,419 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:28,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 22:57:28,419 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:28,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:28,419 INFO L82 PathProgramCache]: Analyzing trace with hash 43549556, now seen corresponding path program 2 times [2021-01-06 22:57:28,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:28,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307406662] [2021-01-06 22:57:28,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:28,575 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,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307406662] [2021-01-06 22:57:28,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:28,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 22:57:28,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779584817] [2021-01-06 22:57:28,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 22:57:28,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:28,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 22:57:28,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:28,578 INFO L87 Difference]: Start difference. First operand 2715 states and 9581 transitions. Second operand 10 states. [2021-01-06 22:57:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:29,112 INFO L93 Difference]: Finished difference Result 3151 states and 10988 transitions. [2021-01-06 22:57:29,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:29,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2021-01-06 22:57:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:29,123 INFO L225 Difference]: With dead ends: 3151 [2021-01-06 22:57:29,124 INFO L226 Difference]: Without dead ends: 3053 [2021-01-06 22:57:29,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-01-06 22:57:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2021-01-06 22:57:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 2389. [2021-01-06 22:57:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2021-01-06 22:57:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 8340 transitions. [2021-01-06 22:57:29,200 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 8340 transitions. Word has length 26 [2021-01-06 22:57:29,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:29,200 INFO L481 AbstractCegarLoop]: Abstraction has 2389 states and 8340 transitions. [2021-01-06 22:57:29,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 22:57:29,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 8340 transitions. [2021-01-06 22:57:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 22:57:29,206 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:29,207 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] [2021-01-06 22:57:29,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 22:57:29,207 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:29,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:29,207 INFO L82 PathProgramCache]: Analyzing trace with hash 907782437, now seen corresponding path program 1 times [2021-01-06 22:57:29,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:29,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371961688] [2021-01-06 22:57:29,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:29,426 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:29,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371961688] [2021-01-06 22:57:29,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:29,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 22:57:29,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837201771] [2021-01-06 22:57:29,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 22:57:29,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:29,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 22:57:29,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:29,428 INFO L87 Difference]: Start difference. First operand 2389 states and 8340 transitions. Second operand 11 states. [2021-01-06 22:57:29,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:29,926 INFO L93 Difference]: Finished difference Result 3007 states and 10647 transitions. [2021-01-06 22:57:29,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:29,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2021-01-06 22:57:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:29,933 INFO L225 Difference]: With dead ends: 3007 [2021-01-06 22:57:29,933 INFO L226 Difference]: Without dead ends: 2937 [2021-01-06 22:57:29,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-01-06 22:57:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2021-01-06 22:57:29,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 2490. [2021-01-06 22:57:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2490 states. [2021-01-06 22:57:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 8800 transitions. [2021-01-06 22:57:29,986 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 8800 transitions. Word has length 27 [2021-01-06 22:57:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:29,986 INFO L481 AbstractCegarLoop]: Abstraction has 2490 states and 8800 transitions. [2021-01-06 22:57:29,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 22:57:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 8800 transitions. [2021-01-06 22:57:29,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 22:57:29,992 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:29,992 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] [2021-01-06 22:57:29,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 22:57:29,993 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:29,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2120484843, now seen corresponding path program 1 times [2021-01-06 22:57:29,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:29,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187551716] [2021-01-06 22:57:29,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:30,249 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,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187551716] [2021-01-06 22:57:30,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:30,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 22:57:30,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331811712] [2021-01-06 22:57:30,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 22:57:30,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:30,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 22:57:30,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:30,251 INFO L87 Difference]: Start difference. First operand 2490 states and 8800 transitions. Second operand 11 states. [2021-01-06 22:57:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:30,988 INFO L93 Difference]: Finished difference Result 3004 states and 10432 transitions. [2021-01-06 22:57:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:30,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2021-01-06 22:57:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:30,996 INFO L225 Difference]: With dead ends: 3004 [2021-01-06 22:57:30,997 INFO L226 Difference]: Without dead ends: 2889 [2021-01-06 22:57:30,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-01-06 22:57:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2021-01-06 22:57:31,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2349. [2021-01-06 22:57:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2349 states. [2021-01-06 22:57:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 8184 transitions. [2021-01-06 22:57:31,044 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 8184 transitions. Word has length 27 [2021-01-06 22:57:31,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:31,044 INFO L481 AbstractCegarLoop]: Abstraction has 2349 states and 8184 transitions. [2021-01-06 22:57:31,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 22:57:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 8184 transitions. [2021-01-06 22:57:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 22:57:31,048 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:31,048 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] [2021-01-06 22:57:31,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 22:57:31,049 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:31,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:31,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1524893631, now seen corresponding path program 2 times [2021-01-06 22:57:31,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:31,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921227993] [2021-01-06 22:57:31,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:31,342 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:31,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921227993] [2021-01-06 22:57:31,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:31,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 22:57:31,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989045462] [2021-01-06 22:57:31,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 22:57:31,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:31,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 22:57:31,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-01-06 22:57:31,345 INFO L87 Difference]: Start difference. First operand 2349 states and 8184 transitions. Second operand 13 states. [2021-01-06 22:57:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:32,212 INFO L93 Difference]: Finished difference Result 3028 states and 10567 transitions. [2021-01-06 22:57:32,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 22:57:32,213 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2021-01-06 22:57:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:32,221 INFO L225 Difference]: With dead ends: 3028 [2021-01-06 22:57:32,222 INFO L226 Difference]: Without dead ends: 2886 [2021-01-06 22:57:32,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-01-06 22:57:32,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2021-01-06 22:57:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2087. [2021-01-06 22:57:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2021-01-06 22:57:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 7249 transitions. [2021-01-06 22:57:32,267 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 7249 transitions. Word has length 27 [2021-01-06 22:57:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:32,268 INFO L481 AbstractCegarLoop]: Abstraction has 2087 states and 7249 transitions. [2021-01-06 22:57:32,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 22:57:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 7249 transitions. [2021-01-06 22:57:32,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 22:57:32,273 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:32,273 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] [2021-01-06 22:57:32,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 22:57:32,273 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:32,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:32,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1646398155, now seen corresponding path program 2 times [2021-01-06 22:57:32,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:32,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734441095] [2021-01-06 22:57:32,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:32,593 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,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734441095] [2021-01-06 22:57:32,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:32,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 22:57:32,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747200382] [2021-01-06 22:57:32,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 22:57:32,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:32,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 22:57:32,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-01-06 22:57:32,599 INFO L87 Difference]: Start difference. First operand 2087 states and 7249 transitions. Second operand 13 states. [2021-01-06 22:57:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:33,308 INFO L93 Difference]: Finished difference Result 2170 states and 7294 transitions. [2021-01-06 22:57:33,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:33,309 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2021-01-06 22:57:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:33,316 INFO L225 Difference]: With dead ends: 2170 [2021-01-06 22:57:33,316 INFO L226 Difference]: Without dead ends: 1933 [2021-01-06 22:57:33,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-01-06 22:57:33,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2021-01-06 22:57:33,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1392. [2021-01-06 22:57:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2021-01-06 22:57:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 4530 transitions. [2021-01-06 22:57:33,361 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 4530 transitions. Word has length 27 [2021-01-06 22:57:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:33,364 INFO L481 AbstractCegarLoop]: Abstraction has 1392 states and 4530 transitions. [2021-01-06 22:57:33,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 22:57:33,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 4530 transitions. [2021-01-06 22:57:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 22:57:33,369 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:33,369 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] [2021-01-06 22:57:33,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 22:57:33,371 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:33,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:33,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1547272975, now seen corresponding path program 1 times [2021-01-06 22:57:33,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:33,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124273923] [2021-01-06 22:57:33,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:33,414 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,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124273923] [2021-01-06 22:57:33,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:33,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 22:57:33,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960314787] [2021-01-06 22:57:33,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 22:57:33,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:33,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 22:57:33,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 22:57:33,416 INFO L87 Difference]: Start difference. First operand 1392 states and 4530 transitions. Second operand 5 states. [2021-01-06 22:57:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:33,514 INFO L93 Difference]: Finished difference Result 1682 states and 5310 transitions. [2021-01-06 22:57:33,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 22:57:33,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2021-01-06 22:57:33,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:33,519 INFO L225 Difference]: With dead ends: 1682 [2021-01-06 22:57:33,519 INFO L226 Difference]: Without dead ends: 1391 [2021-01-06 22:57:33,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 22:57:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2021-01-06 22:57:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1391. [2021-01-06 22:57:33,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1391 states. [2021-01-06 22:57:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 4528 transitions. [2021-01-06 22:57:33,556 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 4528 transitions. Word has length 28 [2021-01-06 22:57:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:33,556 INFO L481 AbstractCegarLoop]: Abstraction has 1391 states and 4528 transitions. [2021-01-06 22:57:33,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 22:57:33,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 4528 transitions. [2021-01-06 22:57:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 22:57:33,560 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:33,560 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] [2021-01-06 22:57:33,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 22:57:33,561 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:33,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1637295713, now seen corresponding path program 2 times [2021-01-06 22:57:33,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:33,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062843615] [2021-01-06 22:57:33,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:33,613 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,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062843615] [2021-01-06 22:57:33,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:33,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 22:57:33,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109716273] [2021-01-06 22:57:33,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 22:57:33,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:33,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 22:57:33,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 22:57:33,617 INFO L87 Difference]: Start difference. First operand 1391 states and 4528 transitions. Second operand 6 states. [2021-01-06 22:57:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:33,760 INFO L93 Difference]: Finished difference Result 1674 states and 5299 transitions. [2021-01-06 22:57:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:33,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2021-01-06 22:57:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:33,765 INFO L225 Difference]: With dead ends: 1674 [2021-01-06 22:57:33,765 INFO L226 Difference]: Without dead ends: 1384 [2021-01-06 22:57:33,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-01-06 22:57:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2021-01-06 22:57:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2021-01-06 22:57:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2021-01-06 22:57:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 4512 transitions. [2021-01-06 22:57:33,802 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 4512 transitions. Word has length 28 [2021-01-06 22:57:33,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:33,803 INFO L481 AbstractCegarLoop]: Abstraction has 1384 states and 4512 transitions. [2021-01-06 22:57:33,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 22:57:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 4512 transitions. [2021-01-06 22:57:33,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 22:57:33,806 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:33,806 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] [2021-01-06 22:57:33,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 22:57:33,807 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:33,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:33,807 INFO L82 PathProgramCache]: Analyzing trace with hash 459929903, now seen corresponding path program 3 times [2021-01-06 22:57:33,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:33,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015602167] [2021-01-06 22:57:33,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:33,906 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,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015602167] [2021-01-06 22:57:33,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:33,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 22:57:33,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886605015] [2021-01-06 22:57:33,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 22:57:33,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:33,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 22:57:33,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 22:57:33,909 INFO L87 Difference]: Start difference. First operand 1384 states and 4512 transitions. Second operand 8 states. [2021-01-06 22:57:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:34,172 INFO L93 Difference]: Finished difference Result 1663 states and 5277 transitions. [2021-01-06 22:57:34,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:34,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2021-01-06 22:57:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:34,177 INFO L225 Difference]: With dead ends: 1663 [2021-01-06 22:57:34,178 INFO L226 Difference]: Without dead ends: 1380 [2021-01-06 22:57:34,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:34,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2021-01-06 22:57:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1380. [2021-01-06 22:57:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2021-01-06 22:57:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 4503 transitions. [2021-01-06 22:57:34,202 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 4503 transitions. Word has length 28 [2021-01-06 22:57:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:34,203 INFO L481 AbstractCegarLoop]: Abstraction has 1380 states and 4503 transitions. [2021-01-06 22:57:34,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 22:57:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 4503 transitions. [2021-01-06 22:57:34,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 22:57:34,205 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:34,205 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] [2021-01-06 22:57:34,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 22:57:34,205 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:34,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:34,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1629184431, now seen corresponding path program 4 times [2021-01-06 22:57:34,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:34,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038426053] [2021-01-06 22:57:34,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:34,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:34,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038426053] [2021-01-06 22:57:34,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:34,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 22:57:34,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025383636] [2021-01-06 22:57:34,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 22:57:34,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:34,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 22:57:34,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-06 22:57:34,327 INFO L87 Difference]: Start difference. First operand 1380 states and 4503 transitions. Second operand 9 states. [2021-01-06 22:57:34,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:34,645 INFO L93 Difference]: Finished difference Result 1650 states and 5250 transitions. [2021-01-06 22:57:34,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:34,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2021-01-06 22:57:34,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:34,651 INFO L225 Difference]: With dead ends: 1650 [2021-01-06 22:57:34,652 INFO L226 Difference]: Without dead ends: 1371 [2021-01-06 22:57:34,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-01-06 22:57:34,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2021-01-06 22:57:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1371. [2021-01-06 22:57:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2021-01-06 22:57:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 4479 transitions. [2021-01-06 22:57:34,693 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 4479 transitions. Word has length 28 [2021-01-06 22:57:34,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:34,693 INFO L481 AbstractCegarLoop]: Abstraction has 1371 states and 4479 transitions. [2021-01-06 22:57:34,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 22:57:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 4479 transitions. [2021-01-06 22:57:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 22:57:34,697 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:34,697 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] [2021-01-06 22:57:34,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 22:57:34,697 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:34,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:34,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1509106773, now seen corresponding path program 5 times [2021-01-06 22:57:34,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:34,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920934436] [2021-01-06 22:57:34,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:34,868 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,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920934436] [2021-01-06 22:57:34,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:34,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 22:57:34,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454099147] [2021-01-06 22:57:34,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 22:57:34,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:34,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 22:57:34,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-01-06 22:57:34,870 INFO L87 Difference]: Start difference. First operand 1371 states and 4479 transitions. Second operand 10 states. [2021-01-06 22:57:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:35,229 INFO L93 Difference]: Finished difference Result 1627 states and 5185 transitions. [2021-01-06 22:57:35,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:35,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2021-01-06 22:57:35,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:35,236 INFO L225 Difference]: With dead ends: 1627 [2021-01-06 22:57:35,237 INFO L226 Difference]: Without dead ends: 1357 [2021-01-06 22:57:35,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-01-06 22:57:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2021-01-06 22:57:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1357. [2021-01-06 22:57:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2021-01-06 22:57:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 4426 transitions. [2021-01-06 22:57:35,282 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 4426 transitions. Word has length 28 [2021-01-06 22:57:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:35,282 INFO L481 AbstractCegarLoop]: Abstraction has 1357 states and 4426 transitions. [2021-01-06 22:57:35,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 22:57:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 4426 transitions. [2021-01-06 22:57:35,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 22:57:35,287 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:35,287 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] [2021-01-06 22:57:35,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-01-06 22:57:35,288 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:35,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:35,288 INFO L82 PathProgramCache]: Analyzing trace with hash 446339391, now seen corresponding path program 6 times [2021-01-06 22:57:35,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:35,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213983370] [2021-01-06 22:57:35,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:35,469 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,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213983370] [2021-01-06 22:57:35,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:35,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 22:57:35,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419779937] [2021-01-06 22:57:35,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 22:57:35,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:35,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 22:57:35,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:35,474 INFO L87 Difference]: Start difference. First operand 1357 states and 4426 transitions. Second operand 11 states. [2021-01-06 22:57:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:35,928 INFO L93 Difference]: Finished difference Result 1917 states and 6244 transitions. [2021-01-06 22:57:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:35,929 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2021-01-06 22:57:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:35,933 INFO L225 Difference]: With dead ends: 1917 [2021-01-06 22:57:35,934 INFO L226 Difference]: Without dead ends: 1669 [2021-01-06 22:57:35,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-01-06 22:57:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2021-01-06 22:57:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1349. [2021-01-06 22:57:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349 states. [2021-01-06 22:57:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 4390 transitions. [2021-01-06 22:57:35,961 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 4390 transitions. Word has length 28 [2021-01-06 22:57:35,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:35,961 INFO L481 AbstractCegarLoop]: Abstraction has 1349 states and 4390 transitions. [2021-01-06 22:57:35,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 22:57:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 4390 transitions. [2021-01-06 22:57:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 22:57:35,964 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:35,964 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] [2021-01-06 22:57:35,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-01-06 22:57:35,965 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:35,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:35,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2112935205, now seen corresponding path program 7 times [2021-01-06 22:57:35,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:35,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641964353] [2021-01-06 22:57:35,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:36,116 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,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641964353] [2021-01-06 22:57:36,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:36,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 22:57:36,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192386412] [2021-01-06 22:57:36,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 22:57:36,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:36,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 22:57:36,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:36,118 INFO L87 Difference]: Start difference. First operand 1349 states and 4390 transitions. Second operand 11 states. [2021-01-06 22:57:36,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:36,385 INFO L93 Difference]: Finished difference Result 1549 states and 4908 transitions. [2021-01-06 22:57:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 22:57:36,385 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2021-01-06 22:57:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:36,389 INFO L225 Difference]: With dead ends: 1549 [2021-01-06 22:57:36,389 INFO L226 Difference]: Without dead ends: 1317 [2021-01-06 22:57:36,390 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:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2021-01-06 22:57:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2021-01-06 22:57:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2021-01-06 22:57:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 4230 transitions. [2021-01-06 22:57:36,422 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 4230 transitions. Word has length 28 [2021-01-06 22:57:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:36,422 INFO L481 AbstractCegarLoop]: Abstraction has 1317 states and 4230 transitions. [2021-01-06 22:57:36,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 22:57:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 4230 transitions. [2021-01-06 22:57:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 22:57:36,426 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:36,426 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] [2021-01-06 22:57:36,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-01-06 22:57:36,426 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:36,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:36,427 INFO L82 PathProgramCache]: Analyzing trace with hash -94355749, now seen corresponding path program 8 times [2021-01-06 22:57:36,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:36,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033297170] [2021-01-06 22:57:36,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:36,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:36,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033297170] [2021-01-06 22:57:36,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:36,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 22:57:36,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373547785] [2021-01-06 22:57:36,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 22:57:36,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:36,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 22:57:36,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-01-06 22:57:36,745 INFO L87 Difference]: Start difference. First operand 1317 states and 4230 transitions. Second operand 13 states. [2021-01-06 22:57:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:37,433 INFO L93 Difference]: Finished difference Result 1485 states and 4665 transitions. [2021-01-06 22:57:37,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:37,434 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2021-01-06 22:57:37,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:37,437 INFO L225 Difference]: With dead ends: 1485 [2021-01-06 22:57:37,437 INFO L226 Difference]: Without dead ends: 1053 [2021-01-06 22:57:37,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-01-06 22:57:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-01-06 22:57:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 905. [2021-01-06 22:57:37,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2021-01-06 22:57:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 2760 transitions. [2021-01-06 22:57:37,453 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 2760 transitions. Word has length 28 [2021-01-06 22:57:37,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:37,453 INFO L481 AbstractCegarLoop]: Abstraction has 905 states and 2760 transitions. [2021-01-06 22:57:37,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 22:57:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 2760 transitions. [2021-01-06 22:57:37,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 22:57:37,455 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:37,455 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] [2021-01-06 22:57:37,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-01-06 22:57:37,455 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:37,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:37,456 INFO L82 PathProgramCache]: Analyzing trace with hash -67296542, now seen corresponding path program 1 times [2021-01-06 22:57:37,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:37,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484532927] [2021-01-06 22:57:37,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:37,696 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,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484532927] [2021-01-06 22:57:37,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:37,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 22:57:37,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519579593] [2021-01-06 22:57:37,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 22:57:37,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:37,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 22:57:37,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-01-06 22:57:37,698 INFO L87 Difference]: Start difference. First operand 905 states and 2760 transitions. Second operand 13 states. [2021-01-06 22:57:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:38,370 INFO L93 Difference]: Finished difference Result 1701 states and 5319 transitions. [2021-01-06 22:57:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 22:57:38,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2021-01-06 22:57:38,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:38,374 INFO L225 Difference]: With dead ends: 1701 [2021-01-06 22:57:38,374 INFO L226 Difference]: Without dead ends: 1433 [2021-01-06 22:57:38,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-01-06 22:57:38,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2021-01-06 22:57:38,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 949. [2021-01-06 22:57:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2021-01-06 22:57:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2878 transitions. [2021-01-06 22:57:38,393 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2878 transitions. Word has length 30 [2021-01-06 22:57:38,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:38,393 INFO L481 AbstractCegarLoop]: Abstraction has 949 states and 2878 transitions. [2021-01-06 22:57:38,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 22:57:38,394 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2878 transitions. [2021-01-06 22:57:38,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 22:57:38,395 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:38,395 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] [2021-01-06 22:57:38,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-01-06 22:57:38,395 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:38,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:38,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1668396158, now seen corresponding path program 2 times [2021-01-06 22:57:38,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:38,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616495672] [2021-01-06 22:57:38,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:38,641 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:38,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616495672] [2021-01-06 22:57:38,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:38,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 22:57:38,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36443485] [2021-01-06 22:57:38,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 22:57:38,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:38,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 22:57:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-01-06 22:57:38,644 INFO L87 Difference]: Start difference. First operand 949 states and 2878 transitions. Second operand 13 states. [2021-01-06 22:57:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:39,254 INFO L93 Difference]: Finished difference Result 1319 states and 4018 transitions. [2021-01-06 22:57:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 22:57:39,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2021-01-06 22:57:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:39,258 INFO L225 Difference]: With dead ends: 1319 [2021-01-06 22:57:39,258 INFO L226 Difference]: Without dead ends: 1059 [2021-01-06 22:57:39,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-01-06 22:57:39,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2021-01-06 22:57:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 933. [2021-01-06 22:57:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2021-01-06 22:57:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 2834 transitions. [2021-01-06 22:57:39,274 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 2834 transitions. Word has length 30 [2021-01-06 22:57:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:39,274 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 2834 transitions. [2021-01-06 22:57:39,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 22:57:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 2834 transitions. [2021-01-06 22:57:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 22:57:39,275 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:39,276 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] [2021-01-06 22:57:39,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-01-06 22:57:39,276 INFO L429 AbstractCegarLoop]: === Iteration 54 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:39,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:39,276 INFO L82 PathProgramCache]: Analyzing trace with hash -41395204, now seen corresponding path program 3 times [2021-01-06 22:57:39,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:39,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784938788] [2021-01-06 22:57:39,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:39,488 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,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784938788] [2021-01-06 22:57:39,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:39,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:39,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676844733] [2021-01-06 22:57:39,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:39,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:39,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:39,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:39,491 INFO L87 Difference]: Start difference. First operand 933 states and 2834 transitions. Second operand 12 states. [2021-01-06 22:57:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:39,879 INFO L93 Difference]: Finished difference Result 1221 states and 3704 transitions. [2021-01-06 22:57:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 22:57:39,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2021-01-06 22:57:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:39,882 INFO L225 Difference]: With dead ends: 1221 [2021-01-06 22:57:39,883 INFO L226 Difference]: Without dead ends: 1049 [2021-01-06 22:57:39,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-01-06 22:57:39,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2021-01-06 22:57:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 921. [2021-01-06 22:57:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2021-01-06 22:57:39,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 2800 transitions. [2021-01-06 22:57:39,905 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 2800 transitions. Word has length 30 [2021-01-06 22:57:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:39,906 INFO L481 AbstractCegarLoop]: Abstraction has 921 states and 2800 transitions. [2021-01-06 22:57:39,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 2800 transitions. [2021-01-06 22:57:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 22:57:39,908 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:39,908 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] [2021-01-06 22:57:39,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-01-06 22:57:39,908 INFO L429 AbstractCegarLoop]: === Iteration 55 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:39,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:39,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1694297496, now seen corresponding path program 4 times [2021-01-06 22:57:39,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:39,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231777307] [2021-01-06 22:57:39,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:40,122 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,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231777307] [2021-01-06 22:57:40,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:40,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:40,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974370942] [2021-01-06 22:57:40,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:40,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:40,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:40,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:40,124 INFO L87 Difference]: Start difference. First operand 921 states and 2800 transitions. Second operand 12 states. [2021-01-06 22:57:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:40,430 INFO L93 Difference]: Finished difference Result 760 states and 2253 transitions. [2021-01-06 22:57:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 22:57:40,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2021-01-06 22:57:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:40,432 INFO L225 Difference]: With dead ends: 760 [2021-01-06 22:57:40,432 INFO L226 Difference]: Without dead ends: 492 [2021-01-06 22:57:40,432 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-01-06 22:57:40,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-01-06 22:57:40,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 368. [2021-01-06 22:57:40,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2021-01-06 22:57:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 1047 transitions. [2021-01-06 22:57:40,441 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 1047 transitions. Word has length 30 [2021-01-06 22:57:40,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:40,441 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 1047 transitions. [2021-01-06 22:57:40,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 1047 transitions. [2021-01-06 22:57:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 22:57:40,442 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:40,442 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] [2021-01-06 22:57:40,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-01-06 22:57:40,443 INFO L429 AbstractCegarLoop]: === Iteration 56 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:40,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:40,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1256010255, now seen corresponding path program 1 times [2021-01-06 22:57:40,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:40,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149284632] [2021-01-06 22:57:40,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:40,651 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,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149284632] [2021-01-06 22:57:40,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:40,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:40,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631424965] [2021-01-06 22:57:40,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:40,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:40,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:40,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:40,653 INFO L87 Difference]: Start difference. First operand 368 states and 1047 transitions. Second operand 12 states. [2021-01-06 22:57:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:41,154 INFO L93 Difference]: Finished difference Result 478 states and 1317 transitions. [2021-01-06 22:57:41,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 22:57:41,155 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2021-01-06 22:57:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:41,156 INFO L225 Difference]: With dead ends: 478 [2021-01-06 22:57:41,156 INFO L226 Difference]: Without dead ends: 370 [2021-01-06 22:57:41,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-01-06 22:57:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-01-06 22:57:41,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 366. [2021-01-06 22:57:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2021-01-06 22:57:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1041 transitions. [2021-01-06 22:57:41,162 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1041 transitions. Word has length 30 [2021-01-06 22:57:41,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:41,162 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 1041 transitions. [2021-01-06 22:57:41,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1041 transitions. [2021-01-06 22:57:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 22:57:41,162 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:41,163 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] [2021-01-06 22:57:41,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-01-06 22:57:41,163 INFO L429 AbstractCegarLoop]: === Iteration 57 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:41,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash -766721315, now seen corresponding path program 2 times [2021-01-06 22:57:41,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:41,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585937227] [2021-01-06 22:57:41,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:41,451 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,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585937227] [2021-01-06 22:57:41,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:41,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 22:57:41,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556376290] [2021-01-06 22:57:41,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 22:57:41,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:41,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 22:57:41,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-01-06 22:57:41,454 INFO L87 Difference]: Start difference. First operand 366 states and 1041 transitions. Second operand 12 states. [2021-01-06 22:57:42,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:42,112 INFO L93 Difference]: Finished difference Result 455 states and 1267 transitions. [2021-01-06 22:57:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 22:57:42,113 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2021-01-06 22:57:42,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:42,113 INFO L225 Difference]: With dead ends: 455 [2021-01-06 22:57:42,114 INFO L226 Difference]: Without dead ends: 312 [2021-01-06 22:57:42,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2021-01-06 22:57:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-01-06 22:57:42,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2021-01-06 22:57:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2021-01-06 22:57:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 866 transitions. [2021-01-06 22:57:42,120 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 866 transitions. Word has length 30 [2021-01-06 22:57:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:42,121 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 866 transitions. [2021-01-06 22:57:42,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 22:57:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 866 transitions. [2021-01-06 22:57:42,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 22:57:42,122 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 22:57:42,122 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] [2021-01-06 22:57:42,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-01-06 22:57:42,122 INFO L429 AbstractCegarLoop]: === Iteration 58 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-01-06 22:57:42,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 22:57:42,123 INFO L82 PathProgramCache]: Analyzing trace with hash 660110225, now seen corresponding path program 3 times [2021-01-06 22:57:42,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 22:57:42,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830307835] [2021-01-06 22:57:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 22:57:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 22:57:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 22:57:42,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830307835] [2021-01-06 22:57:42,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 22:57:42,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 22:57:42,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007743129] [2021-01-06 22:57:42,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 22:57:42,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 22:57:42,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 22:57:42,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-01-06 22:57:42,298 INFO L87 Difference]: Start difference. First operand 312 states and 866 transitions. Second operand 11 states. [2021-01-06 22:57:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 22:57:42,578 INFO L93 Difference]: Finished difference Result 123 states and 279 transitions. [2021-01-06 22:57:42,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 22:57:42,578 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2021-01-06 22:57:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 22:57:42,578 INFO L225 Difference]: With dead ends: 123 [2021-01-06 22:57:42,578 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 22:57:42,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-01-06 22:57:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 22:57:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 22:57:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 22:57:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 22:57:42,583 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2021-01-06 22:57:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 22:57:42,583 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 22:57:42,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 22:57:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 22:57:42,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 22:57:42,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-01-06 22:57:42,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 10:57:42 BasicIcfg [2021-01-06 22:57:42,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 22:57:42,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 22:57:42,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 22:57:42,591 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 22:57:42,592 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:55" (3/4) ... [2021-01-06 22:57:42,602 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 22:57:42,609 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread0 [2021-01-06 22:57:42,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-01-06 22:57:42,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-01-06 22:57:42,610 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-01-06 22:57:42,617 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-01-06 22:57:42,617 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 22:57:42,617 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 22:57:42,618 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 22:57:42,682 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread/singleton_with-uninit-problems.i-witness.graphml [2021-01-06 22:57:42,683 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 22:57:42,684 INFO L168 Benchmark]: Toolchain (without parser) took 49589.10 ms. Allocated memory was 151.0 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 124.0 MB in the beginning and 611.8 MB in the end (delta: -487.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. [2021-01-06 22:57:42,684 INFO L168 Benchmark]: CDTParser took 0.20 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:42,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1059.01 ms. Allocated memory is still 151.0 MB. Free memory was 123.8 MB in the beginning and 82.2 MB in the end (delta: 41.7 MB). Peak memory consumption was 43.0 MB. Max. memory is 8.0 GB. [2021-01-06 22:57:42,685 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.61 ms. Allocated memory is still 151.0 MB. Free memory was 82.2 MB in the beginning and 80.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 22:57:42,686 INFO L168 Benchmark]: Boogie Preprocessor took 43.37 ms. Allocated memory is still 151.0 MB. Free memory was 80.2 MB in the beginning and 78.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 22:57:42,686 INFO L168 Benchmark]: RCFGBuilder took 804.05 ms. Allocated memory is still 151.0 MB. Free memory was 78.1 MB in the beginning and 49.8 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 8.0 GB. [2021-01-06 22:57:42,687 INFO L168 Benchmark]: TraceAbstraction took 47493.01 ms. Allocated memory was 151.0 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 49.3 MB in the beginning and 614.5 MB in the end (delta: -565.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 8.0 GB. [2021-01-06 22:57:42,687 INFO L168 Benchmark]: Witness Printer took 91.90 ms. Allocated memory is still 2.0 GB. Free memory was 613.9 MB in the beginning and 611.8 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:42,689 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.20 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 1059.01 ms. Allocated memory is still 151.0 MB. Free memory was 123.8 MB in the beginning and 82.2 MB in the end (delta: 41.7 MB). Peak memory consumption was 43.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 82.61 ms. Allocated memory is still 151.0 MB. Free memory was 82.2 MB in the beginning and 80.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.37 ms. Allocated memory is still 151.0 MB. Free memory was 80.2 MB in the beginning and 78.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 804.05 ms. Allocated memory is still 151.0 MB. Free memory was 78.1 MB in the beginning and 49.8 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 47493.01 ms. Allocated memory was 151.0 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 49.3 MB in the beginning and 614.5 MB in the end (delta: -565.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 8.0 GB. * Witness Printer took 91.90 ms. Allocated memory is still 2.0 GB. Free memory was 613.9 MB in the beginning and 611.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 4085 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.5s, 1350 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.4s, 173 PlacesBefore, 95 PlacesAfterwards, 255 TransitionsBefore, 176 TransitionsAfterwards, 4982 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 87 TotalNumberOfCompositions, 55868 MoverChecksTotal - PositiveResult [Line: 1123]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 46.9s, OverallIterations: 58, TraceHistogramMax: 1, AutomataDifference: 23.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 5215 SDtfs, 9488 SDslu, 14563 SDs, 0 SdLazy, 9094 SolverSat, 1447 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 697 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 624 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5288occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.3s AutomataMinimizationTime, 58 MinimizatonAttempts, 37400 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 1385 NumberOfCodeBlocks, 1385 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1327 ConstructedInterpolants, 0 QuantifiedInterpolants, 479069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 58 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 correct! Received shutdown request...