./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/singleton.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54a68f41 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/singleton.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 692248c827814d69f794d70185d48fd053222a0c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-54a68f4 [2020-12-03 16:46:31,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 16:46:31,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 16:46:31,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 16:46:31,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 16:46:31,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 16:46:31,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 16:46:31,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 16:46:31,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 16:46:31,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 16:46:31,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 16:46:31,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 16:46:31,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 16:46:31,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 16:46:31,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 16:46:31,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 16:46:31,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 16:46:31,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 16:46:31,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 16:46:31,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 16:46:31,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 16:46:31,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 16:46:31,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 16:46:31,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 16:46:31,443 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 16:46:31,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 16:46:31,444 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 16:46:31,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 16:46:31,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 16:46:31,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 16:46:31,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 16:46:31,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 16:46:31,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 16:46:31,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 16:46:31,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 16:46:31,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 16:46:31,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 16:46:31,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 16:46:31,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 16:46:31,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 16:46:31,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 16:46:31,464 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-03 16:46:31,523 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 16:46:31,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 16:46:31,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-03 16:46:31,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-03 16:46:31,529 INFO L138 SettingsManager]: * Use SBE=true [2020-12-03 16:46:31,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 16:46:31,529 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 16:46:31,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-03 16:46:31,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 16:46:31,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 16:46:31,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 16:46:31,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 16:46:31,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 16:46:31,532 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 16:46:31,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 16:46:31,533 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 16:46:31,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 16:46:31,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 16:46:31,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-03 16:46:31,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 16:46:31,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 16:46:31,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 16:46:31,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 16:46:31,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 16:46:31,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-03 16:46:31,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-03 16:46:31,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 16:46:31,536 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 16:46:31,537 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 692248c827814d69f794d70185d48fd053222a0c [2020-12-03 16:46:31,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 16:46:31,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 16:46:31,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 16:46:31,981 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 16:46:31,982 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 16:46:31,984 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton.i [2020-12-03 16:46:32,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99a6521cd/0087c5de73ef48d9b71605aad869629d/FLAGbfedd6416 [2020-12-03 16:46:32,904 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 16:46:32,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i [2020-12-03 16:46:32,942 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99a6521cd/0087c5de73ef48d9b71605aad869629d/FLAGbfedd6416 [2020-12-03 16:46:33,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99a6521cd/0087c5de73ef48d9b71605aad869629d [2020-12-03 16:46:33,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 16:46:33,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 16:46:33,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 16:46:33,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 16:46:33,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 16:46:33,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:46:33" (1/1) ... [2020-12-03 16:46:33,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ab4012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:46:33, skipping insertion in model container [2020-12-03 16:46:33,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:46:33" (1/1) ... [2020-12-03 16:46:33,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 16:46:33,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 16:46:33,546 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-03 16:46:33,815 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i[55547,55560] [2020-12-03 16:46:33,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 16:46:33,854 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 16:46:33,873 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-03 16:46:33,897 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i[55547,55560] [2020-12-03 16:46:33,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 16:46:34,129 INFO L208 MainTranslator]: Completed translation [2020-12-03 16:46:34,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:46:34 WrapperNode [2020-12-03 16:46:34,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 16:46:34,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 16:46:34,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 16:46:34,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 16:46:34,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:46:34" (1/1) ... [2020-12-03 16:46:34,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:46:34" (1/1) ... [2020-12-03 16:46:34,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 16:46:34,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 16:46:34,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 16:46:34,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 16:46:34,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:46:34" (1/1) ... [2020-12-03 16:46:34,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:46:34" (1/1) ... [2020-12-03 16:46:34,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:46:34" (1/1) ... [2020-12-03 16:46:34,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:46:34" (1/1) ... [2020-12-03 16:46:34,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:46:34" (1/1) ... [2020-12-03 16:46:34,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:46:34" (1/1) ... [2020-12-03 16:46:34,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:46:34" (1/1) ... [2020-12-03 16:46:34,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 16:46:34,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 16:46:34,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 16:46:34,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 16:46:34,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:46:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 16:46:34,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-03 16:46:34,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 16:46:34,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-03 16:46:34,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-03 16:46:34,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-03 16:46:34,373 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-12-03 16:46:34,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-12-03 16:46:34,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-12-03 16:46:34,377 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-12-03 16:46:34,377 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-12-03 16:46:34,377 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-12-03 16:46:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-12-03 16:46:34,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-12-03 16:46:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-03 16:46:34,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-03 16:46:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-03 16:46:34,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 16:46:34,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 16:46:34,387 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-03 16:46:34,880 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 16:46:34,880 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2020-12-03 16:46:34,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:46:34 BoogieIcfgContainer [2020-12-03 16:46:34,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 16:46:34,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 16:46:34,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 16:46:34,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 16:46:34,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 04:46:33" (1/3) ... [2020-12-03 16:46:34,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2601a6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:46:34, skipping insertion in model container [2020-12-03 16:46:34,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:46:34" (2/3) ... [2020-12-03 16:46:34,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2601a6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:46:34, skipping insertion in model container [2020-12-03 16:46:34,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:46:34" (3/3) ... [2020-12-03 16:46:34,893 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-12-03 16:46:34,911 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-03 16:46:34,912 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 16:46:34,916 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-03 16:46:34,917 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-03 16:46:34,967 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,967 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,968 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,968 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,968 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,968 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,969 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,969 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,969 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,969 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,970 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,970 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,971 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,971 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,971 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,971 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,972 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,972 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,972 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,973 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,973 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,973 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,974 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,974 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,974 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,974 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,975 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,975 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,975 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,976 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,976 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,976 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,977 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,977 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,977 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,978 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,978 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,978 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,978 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,979 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,979 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,980 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,980 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,980 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,981 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,981 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,981 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,982 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,982 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,982 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,982 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,983 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,983 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,983 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,984 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,984 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,984 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,984 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,985 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,985 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,985 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,986 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,986 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,986 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,986 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,987 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,987 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,987 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,987 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,988 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,988 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,988 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,989 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,989 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,989 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,989 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,989 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,990 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,990 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,990 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,991 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,991 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,991 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,991 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,992 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,992 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,992 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,992 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,993 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,993 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,993 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,993 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,994 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,994 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,994 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,994 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,995 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,995 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,995 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,996 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,996 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,996 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,996 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,997 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,997 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,997 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,998 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,998 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,998 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,998 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,999 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,999 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,999 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,999 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:34,999 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,000 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,000 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,000 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,001 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,001 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,001 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,001 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,002 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,002 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,002 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,002 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,003 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,003 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,003 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,003 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,004 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,004 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,005 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,005 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,005 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,005 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,005 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,006 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,006 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,006 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,006 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,007 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,007 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,007 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,008 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,008 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,008 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,008 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,009 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,009 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,009 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,009 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,010 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,010 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,011 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,011 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,011 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,011 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,012 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,012 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,012 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,012 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,013 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,013 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,013 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,014 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,014 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,014 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,014 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,015 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,015 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,015 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,016 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,016 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,016 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,016 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,017 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,017 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,017 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,017 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,018 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,018 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,018 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,018 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,019 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,019 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,019 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,019 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,020 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,020 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,020 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,020 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,021 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,021 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,021 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,021 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,022 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,022 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,022 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,022 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,025 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,026 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,026 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,026 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,031 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,031 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,032 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,032 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,034 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,034 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,035 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,035 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,037 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,037 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,037 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,038 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,038 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,038 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,040 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,041 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,042 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,043 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,044 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,044 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,045 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,046 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,046 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,049 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,049 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,049 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,050 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,051 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,052 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,052 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,052 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,052 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,053 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,055 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,055 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,055 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,056 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,057 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,058 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,058 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,058 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,060 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,060 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,061 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,061 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,063 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,063 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,063 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,064 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 16:46:35,174 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2020-12-03 16:46:35,189 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-12-03 16:46:35,216 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 16:46:35,216 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 16:46:35,216 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 16:46:35,217 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 16:46:35,217 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 16:46:35,217 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 16:46:35,217 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 16:46:35,218 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 16:46:35,238 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-03 16:46:35,241 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-03 16:46:35,245 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-03 16:46:35,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 248 transitions, 876 flow [2020-12-03 16:46:35,369 INFO L129 PetriNetUnfolder]: 61/274 cut-off events. [2020-12-03 16:46:35,369 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-12-03 16:46:35,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 274 events. 61/274 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 804 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 330. Up to 24 conditions per place. [2020-12-03 16:46:35,395 INFO L116 LiptonReduction]: Number of co-enabled transitions 4156 [2020-12-03 16:46:38,115 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-03 16:46:38,323 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-03 16:46:38,429 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-03 16:46:38,797 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-12-03 16:46:39,004 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-12-03 16:46:39,172 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-03 16:46:39,279 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-03 16:46:39,396 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-03 16:46:39,503 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-03 16:46:39,773 INFO L131 LiptonReduction]: Checked pairs total: 49018 [2020-12-03 16:46:39,774 INFO L133 LiptonReduction]: Total number of compositions: 81 [2020-12-03 16:46:39,781 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 173 transitions, 726 flow [2020-12-03 16:46:40,372 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-12-03 16:46:40,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-12-03 16:46:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-03 16:46:40,382 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:40,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:40,384 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:40,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:40,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1391244601, now seen corresponding path program 1 times [2020-12-03 16:46:40,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:40,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942663719] [2020-12-03 16:46:40,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:40,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942663719] [2020-12-03 16:46:40,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:40,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 16:46:40,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152197100] [2020-12-03 16:46:40,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 16:46:40,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:40,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 16:46:40,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-03 16:46:40,874 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-12-03 16:46:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:41,231 INFO L93 Difference]: Finished difference Result 6012 states and 25679 transitions. [2020-12-03 16:46:41,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 16:46:41,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-03 16:46:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:41,317 INFO L225 Difference]: With dead ends: 6012 [2020-12-03 16:46:41,317 INFO L226 Difference]: Without dead ends: 5524 [2020-12-03 16:46:41,319 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-03 16:46:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2020-12-03 16:46:41,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 3018. [2020-12-03 16:46:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-12-03 16:46:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-12-03 16:46:41,689 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-12-03 16:46:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:41,690 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-12-03 16:46:41,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 16:46:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-12-03 16:46:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-03 16:46:41,691 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:41,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:41,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-03 16:46:41,692 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:41,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:41,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1473766845, now seen corresponding path program 2 times [2020-12-03 16:46:41,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:41,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541117315] [2020-12-03 16:46:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:41,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541117315] [2020-12-03 16:46:41,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:41,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 16:46:41,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546735806] [2020-12-03 16:46:41,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 16:46:41,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:41,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 16:46:41,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-03 16:46:41,856 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-12-03 16:46:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:42,115 INFO L93 Difference]: Finished difference Result 4266 states and 18042 transitions. [2020-12-03 16:46:42,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-03 16:46:42,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-03 16:46:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:42,162 INFO L225 Difference]: With dead ends: 4266 [2020-12-03 16:46:42,163 INFO L226 Difference]: Without dead ends: 4266 [2020-12-03 16:46:42,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-03 16:46:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2020-12-03 16:46:42,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 3008. [2020-12-03 16:46:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-12-03 16:46:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-12-03 16:46:42,383 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-12-03 16:46:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:42,383 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-12-03 16:46:42,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 16:46:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-12-03 16:46:42,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-03 16:46:42,386 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:42,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:42,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-03 16:46:42,387 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:42,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:42,398 INFO L82 PathProgramCache]: Analyzing trace with hash -658761216, now seen corresponding path program 1 times [2020-12-03 16:46:42,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:42,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622339722] [2020-12-03 16:46:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:42,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622339722] [2020-12-03 16:46:42,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:42,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-03 16:46:42,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230699345] [2020-12-03 16:46:42,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 16:46:42,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:42,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 16:46:42,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 16:46:42,503 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-12-03 16:46:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:42,593 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-12-03 16:46:42,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 16:46:42,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-03 16:46:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:42,627 INFO L225 Difference]: With dead ends: 4848 [2020-12-03 16:46:42,627 INFO L226 Difference]: Without dead ends: 3558 [2020-12-03 16:46:42,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 16:46:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-12-03 16:46:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-12-03 16:46:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-12-03 16:46:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-12-03 16:46:42,822 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-12-03 16:46:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:42,823 INFO L481 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-12-03 16:46:42,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 16:46:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-12-03 16:46:42,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-03 16:46:42,825 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:42,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:42,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-03 16:46:42,826 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:42,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:42,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1053238145, now seen corresponding path program 1 times [2020-12-03 16:46:42,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:42,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590146136] [2020-12-03 16:46:42,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:42,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590146136] [2020-12-03 16:46:42,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:42,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 16:46:42,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239027314] [2020-12-03 16:46:42,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 16:46:42,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:42,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 16:46:42,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 16:46:42,916 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-12-03 16:46:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:43,243 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-12-03 16:46:43,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 16:46:43,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-03 16:46:43,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:43,278 INFO L225 Difference]: With dead ends: 4417 [2020-12-03 16:46:43,279 INFO L226 Difference]: Without dead ends: 4393 [2020-12-03 16:46:43,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-03 16:46:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-12-03 16:46:43,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-12-03 16:46:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-12-03 16:46:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-12-03 16:46:43,436 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-12-03 16:46:43,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:43,436 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-12-03 16:46:43,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 16:46:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-12-03 16:46:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-03 16:46:43,439 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:43,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:43,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-03 16:46:43,440 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:43,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:43,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1471262403, now seen corresponding path program 2 times [2020-12-03 16:46:43,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:43,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484784374] [2020-12-03 16:46:43,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:43,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484784374] [2020-12-03 16:46:43,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:43,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 16:46:43,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322435711] [2020-12-03 16:46:43,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 16:46:43,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:43,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 16:46:43,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-03 16:46:43,547 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-12-03 16:46:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:43,720 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-12-03 16:46:43,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 16:46:43,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-03 16:46:43,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:43,741 INFO L225 Difference]: With dead ends: 4024 [2020-12-03 16:46:43,741 INFO L226 Difference]: Without dead ends: 4024 [2020-12-03 16:46:43,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-03 16:46:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-12-03 16:46:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-12-03 16:46:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-12-03 16:46:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-12-03 16:46:43,882 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-12-03 16:46:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:43,883 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-12-03 16:46:43,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 16:46:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-12-03 16:46:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 16:46:43,884 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:43,885 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:43,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-03 16:46:43,885 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:43,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:43,886 INFO L82 PathProgramCache]: Analyzing trace with hash -564581282, now seen corresponding path program 1 times [2020-12-03 16:46:43,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:43,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772223781] [2020-12-03 16:46:43,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:43,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772223781] [2020-12-03 16:46:43,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:43,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 16:46:43,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616481328] [2020-12-03 16:46:43,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 16:46:43,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:43,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 16:46:43,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 16:46:43,946 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-12-03 16:46:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:44,198 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-12-03 16:46:44,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 16:46:44,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-03 16:46:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:44,220 INFO L225 Difference]: With dead ends: 4225 [2020-12-03 16:46:44,220 INFO L226 Difference]: Without dead ends: 4129 [2020-12-03 16:46:44,221 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-03 16:46:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-12-03 16:46:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-12-03 16:46:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-12-03 16:46:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-12-03 16:46:44,357 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-12-03 16:46:44,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:44,357 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-12-03 16:46:44,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 16:46:44,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-12-03 16:46:44,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 16:46:44,359 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:44,397 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:44,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-03 16:46:44,397 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:44,398 INFO L82 PathProgramCache]: Analyzing trace with hash -490731172, now seen corresponding path program 2 times [2020-12-03 16:46:44,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:44,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394731471] [2020-12-03 16:46:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:44,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394731471] [2020-12-03 16:46:44,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:44,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 16:46:44,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598145368] [2020-12-03 16:46:44,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 16:46:44,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:44,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 16:46:44,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-03 16:46:44,570 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2020-12-03 16:46:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:45,027 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-12-03 16:46:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 16:46:45,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-03 16:46:45,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:45,053 INFO L225 Difference]: With dead ends: 4979 [2020-12-03 16:46:45,053 INFO L226 Difference]: Without dead ends: 4905 [2020-12-03 16:46:45,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-03 16:46:45,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-12-03 16:46:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-12-03 16:46:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-03 16:46:45,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-12-03 16:46:45,244 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-12-03 16:46:45,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:45,244 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-12-03 16:46:45,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 16:46:45,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-12-03 16:46:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 16:46:45,246 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:45,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:45,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-03 16:46:45,247 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:45,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:45,248 INFO L82 PathProgramCache]: Analyzing trace with hash 991975414, now seen corresponding path program 3 times [2020-12-03 16:46:45,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:45,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320096744] [2020-12-03 16:46:45,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:45,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320096744] [2020-12-03 16:46:45,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:45,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 16:46:45,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780133782] [2020-12-03 16:46:45,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-03 16:46:45,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:45,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-03 16:46:45,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-03 16:46:45,449 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 9 states. [2020-12-03 16:46:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:45,886 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-12-03 16:46:45,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 16:46:45,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-03 16:46:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:45,913 INFO L225 Difference]: With dead ends: 6735 [2020-12-03 16:46:45,914 INFO L226 Difference]: Without dead ends: 6661 [2020-12-03 16:46:45,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-12-03 16:46:45,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-12-03 16:46:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-12-03 16:46:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-12-03 16:46:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-12-03 16:46:46,089 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-12-03 16:46:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:46,089 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-12-03 16:46:46,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-03 16:46:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-12-03 16:46:46,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 16:46:46,092 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:46,092 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:46,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-03 16:46:46,092 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:46,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:46,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1869283970, now seen corresponding path program 4 times [2020-12-03 16:46:46,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:46,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529304297] [2020-12-03 16:46:46,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:46,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:46,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529304297] [2020-12-03 16:46:46,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:46,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 16:46:46,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413101184] [2020-12-03 16:46:46,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-03 16:46:46,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:46,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-03 16:46:46,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-03 16:46:46,214 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 9 states. [2020-12-03 16:46:46,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:46,616 INFO L93 Difference]: Finished difference Result 5385 states and 21914 transitions. [2020-12-03 16:46:46,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 16:46:46,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-03 16:46:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:46,641 INFO L225 Difference]: With dead ends: 5385 [2020-12-03 16:46:46,641 INFO L226 Difference]: Without dead ends: 5311 [2020-12-03 16:46:46,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-12-03 16:46:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2020-12-03 16:46:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4125. [2020-12-03 16:46:46,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2020-12-03 16:46:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 16604 transitions. [2020-12-03 16:46:46,788 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 16604 transitions. Word has length 18 [2020-12-03 16:46:46,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:46,789 INFO L481 AbstractCegarLoop]: Abstraction has 4125 states and 16604 transitions. [2020-12-03 16:46:46,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-03 16:46:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 16604 transitions. [2020-12-03 16:46:46,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 16:46:46,791 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:46,791 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:46,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-03 16:46:46,791 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:46,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:46,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1339896726, now seen corresponding path program 5 times [2020-12-03 16:46:46,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:46,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453502475] [2020-12-03 16:46:46,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:46,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:46,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453502475] [2020-12-03 16:46:46,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:46,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-03 16:46:46,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206265433] [2020-12-03 16:46:46,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 16:46:46,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:46,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 16:46:46,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-03 16:46:46,984 INFO L87 Difference]: Start difference. First operand 4125 states and 16604 transitions. Second operand 11 states. [2020-12-03 16:46:47,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:47,752 INFO L93 Difference]: Finished difference Result 5686 states and 23415 transitions. [2020-12-03 16:46:47,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-03 16:46:47,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-12-03 16:46:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:47,773 INFO L225 Difference]: With dead ends: 5686 [2020-12-03 16:46:47,773 INFO L226 Difference]: Without dead ends: 5630 [2020-12-03 16:46:47,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-03 16:46:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2020-12-03 16:46:47,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4116. [2020-12-03 16:46:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2020-12-03 16:46:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2020-12-03 16:46:47,968 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2020-12-03 16:46:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:47,969 INFO L481 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2020-12-03 16:46:47,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 16:46:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2020-12-03 16:46:47,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-03 16:46:47,971 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:47,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:47,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-03 16:46:47,972 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:47,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:47,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1845549347, now seen corresponding path program 1 times [2020-12-03 16:46:47,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:47,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625135320] [2020-12-03 16:46:47,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:48,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625135320] [2020-12-03 16:46:48,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:48,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 16:46:48,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354454309] [2020-12-03 16:46:48,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 16:46:48,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:48,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 16:46:48,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-03 16:46:48,024 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 6 states. [2020-12-03 16:46:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:48,147 INFO L93 Difference]: Finished difference Result 4687 states and 18325 transitions. [2020-12-03 16:46:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 16:46:48,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-03 16:46:48,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:48,162 INFO L225 Difference]: With dead ends: 4687 [2020-12-03 16:46:48,163 INFO L226 Difference]: Without dead ends: 4687 [2020-12-03 16:46:48,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-03 16:46:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-03 16:46:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4131. [2020-12-03 16:46:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-03 16:46:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16621 transitions. [2020-12-03 16:46:48,293 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16621 transitions. Word has length 19 [2020-12-03 16:46:48,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:48,294 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16621 transitions. [2020-12-03 16:46:48,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 16:46:48,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16621 transitions. [2020-12-03 16:46:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-03 16:46:48,296 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:48,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:48,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-03 16:46:48,297 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:48,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:48,297 INFO L82 PathProgramCache]: Analyzing trace with hash 838752707, now seen corresponding path program 2 times [2020-12-03 16:46:48,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:48,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112988460] [2020-12-03 16:46:48,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:48,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:48,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112988460] [2020-12-03 16:46:48,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:48,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-03 16:46:48,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763419157] [2020-12-03 16:46:48,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 16:46:48,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:48,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 16:46:48,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-03 16:46:48,370 INFO L87 Difference]: Start difference. First operand 4131 states and 16621 transitions. Second operand 7 states. [2020-12-03 16:46:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:48,490 INFO L93 Difference]: Finished difference Result 4619 states and 18100 transitions. [2020-12-03 16:46:48,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 16:46:48,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-12-03 16:46:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:48,501 INFO L225 Difference]: With dead ends: 4619 [2020-12-03 16:46:48,501 INFO L226 Difference]: Without dead ends: 4619 [2020-12-03 16:46:48,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-03 16:46:48,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2020-12-03 16:46:48,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4078. [2020-12-03 16:46:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2020-12-03 16:46:48,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2020-12-03 16:46:48,628 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2020-12-03 16:46:48,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:48,628 INFO L481 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2020-12-03 16:46:48,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 16:46:48,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2020-12-03 16:46:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-03 16:46:48,630 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:48,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:48,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-03 16:46:48,630 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:48,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:48,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1368539430, now seen corresponding path program 1 times [2020-12-03 16:46:48,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:48,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973992502] [2020-12-03 16:46:48,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:48,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973992502] [2020-12-03 16:46:48,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:48,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 16:46:48,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797254184] [2020-12-03 16:46:48,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 16:46:48,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:48,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 16:46:48,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-12-03 16:46:48,882 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 10 states. [2020-12-03 16:46:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:49,501 INFO L93 Difference]: Finished difference Result 5300 states and 21612 transitions. [2020-12-03 16:46:49,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 16:46:49,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-12-03 16:46:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:49,518 INFO L225 Difference]: With dead ends: 5300 [2020-12-03 16:46:49,518 INFO L226 Difference]: Without dead ends: 5226 [2020-12-03 16:46:49,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-12-03 16:46:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2020-12-03 16:46:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 4066. [2020-12-03 16:46:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4066 states. [2020-12-03 16:46:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 16392 transitions. [2020-12-03 16:46:49,682 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 16392 transitions. Word has length 19 [2020-12-03 16:46:49,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:49,682 INFO L481 AbstractCegarLoop]: Abstraction has 4066 states and 16392 transitions. [2020-12-03 16:46:49,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 16:46:49,683 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 16392 transitions. [2020-12-03 16:46:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-03 16:46:49,685 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:49,685 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:49,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-03 16:46:49,686 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:49,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:49,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1392670140, now seen corresponding path program 2 times [2020-12-03 16:46:49,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:49,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376071998] [2020-12-03 16:46:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:49,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376071998] [2020-12-03 16:46:49,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:49,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 16:46:49,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838568613] [2020-12-03 16:46:49,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 16:46:49,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:49,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 16:46:49,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-03 16:46:49,987 INFO L87 Difference]: Start difference. First operand 4066 states and 16392 transitions. Second operand 12 states. [2020-12-03 16:46:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:50,988 INFO L93 Difference]: Finished difference Result 5713 states and 23638 transitions. [2020-12-03 16:46:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 16:46:50,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-12-03 16:46:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:51,010 INFO L225 Difference]: With dead ends: 5713 [2020-12-03 16:46:51,010 INFO L226 Difference]: Without dead ends: 5651 [2020-12-03 16:46:51,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2020-12-03 16:46:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2020-12-03 16:46:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 4021. [2020-12-03 16:46:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2020-12-03 16:46:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 16226 transitions. [2020-12-03 16:46:51,180 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 16226 transitions. Word has length 19 [2020-12-03 16:46:51,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:51,181 INFO L481 AbstractCegarLoop]: Abstraction has 4021 states and 16226 transitions. [2020-12-03 16:46:51,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 16:46:51,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 16226 transitions. [2020-12-03 16:46:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 16:46:51,186 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:51,186 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:51,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-03 16:46:51,187 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:51,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:51,188 INFO L82 PathProgramCache]: Analyzing trace with hash -638770199, now seen corresponding path program 1 times [2020-12-03 16:46:51,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:51,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577709532] [2020-12-03 16:46:51,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:51,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577709532] [2020-12-03 16:46:51,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:51,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 16:46:51,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481336549] [2020-12-03 16:46:51,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 16:46:51,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:51,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 16:46:51,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-03 16:46:51,300 INFO L87 Difference]: Start difference. First operand 4021 states and 16226 transitions. Second operand 8 states. [2020-12-03 16:46:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:51,617 INFO L93 Difference]: Finished difference Result 6240 states and 25278 transitions. [2020-12-03 16:46:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 16:46:51,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-03 16:46:51,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:51,634 INFO L225 Difference]: With dead ends: 6240 [2020-12-03 16:46:51,634 INFO L226 Difference]: Without dead ends: 6194 [2020-12-03 16:46:51,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-12-03 16:46:51,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6194 states. [2020-12-03 16:46:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6194 to 4020. [2020-12-03 16:46:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2020-12-03 16:46:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 16225 transitions. [2020-12-03 16:46:51,787 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 16225 transitions. Word has length 20 [2020-12-03 16:46:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:51,787 INFO L481 AbstractCegarLoop]: Abstraction has 4020 states and 16225 transitions. [2020-12-03 16:46:51,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 16:46:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 16225 transitions. [2020-12-03 16:46:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 16:46:51,791 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:51,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:51,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-03 16:46:51,792 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:51,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:51,792 INFO L82 PathProgramCache]: Analyzing trace with hash -78568143, now seen corresponding path program 2 times [2020-12-03 16:46:51,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:51,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298021930] [2020-12-03 16:46:51,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:51,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298021930] [2020-12-03 16:46:51,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:51,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 16:46:51,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674624357] [2020-12-03 16:46:51,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 16:46:51,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:51,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 16:46:51,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-03 16:46:51,908 INFO L87 Difference]: Start difference. First operand 4020 states and 16225 transitions. Second operand 8 states. [2020-12-03 16:46:52,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:52,147 INFO L93 Difference]: Finished difference Result 5057 states and 20246 transitions. [2020-12-03 16:46:52,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 16:46:52,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-03 16:46:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:52,161 INFO L225 Difference]: With dead ends: 5057 [2020-12-03 16:46:52,161 INFO L226 Difference]: Without dead ends: 5011 [2020-12-03 16:46:52,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-03 16:46:52,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2020-12-03 16:46:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 4017. [2020-12-03 16:46:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4017 states. [2020-12-03 16:46:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 16218 transitions. [2020-12-03 16:46:52,283 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 16218 transitions. Word has length 20 [2020-12-03 16:46:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:52,284 INFO L481 AbstractCegarLoop]: Abstraction has 4017 states and 16218 transitions. [2020-12-03 16:46:52,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 16:46:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 16218 transitions. [2020-12-03 16:46:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 16:46:52,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:52,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] [2020-12-03 16:46:52,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-03 16:46:52,287 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:52,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:52,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1686883325, now seen corresponding path program 3 times [2020-12-03 16:46:52,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:52,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468329609] [2020-12-03 16:46:52,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:52,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468329609] [2020-12-03 16:46:52,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:52,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 16:46:52,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220781278] [2020-12-03 16:46:52,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-03 16:46:52,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:52,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-03 16:46:52,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-03 16:46:52,450 INFO L87 Difference]: Start difference. First operand 4017 states and 16218 transitions. Second operand 9 states. [2020-12-03 16:46:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:52,915 INFO L93 Difference]: Finished difference Result 5047 states and 20222 transitions. [2020-12-03 16:46:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 16:46:52,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-12-03 16:46:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:52,928 INFO L225 Difference]: With dead ends: 5047 [2020-12-03 16:46:52,928 INFO L226 Difference]: Without dead ends: 5001 [2020-12-03 16:46:52,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-12-03 16:46:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2020-12-03 16:46:53,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 4010. [2020-12-03 16:46:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4010 states. [2020-12-03 16:46:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 16199 transitions. [2020-12-03 16:46:53,037 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 16199 transitions. Word has length 20 [2020-12-03 16:46:53,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:53,037 INFO L481 AbstractCegarLoop]: Abstraction has 4010 states and 16199 transitions. [2020-12-03 16:46:53,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-03 16:46:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 16199 transitions. [2020-12-03 16:46:53,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 16:46:53,041 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:53,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:53,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-03 16:46:53,041 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:53,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:53,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1644928641, now seen corresponding path program 4 times [2020-12-03 16:46:53,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:53,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263791285] [2020-12-03 16:46:53,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:53,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:53,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263791285] [2020-12-03 16:46:53,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:53,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-03 16:46:53,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184373748] [2020-12-03 16:46:53,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 16:46:53,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:53,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 16:46:53,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-12-03 16:46:53,264 INFO L87 Difference]: Start difference. First operand 4010 states and 16199 transitions. Second operand 11 states. [2020-12-03 16:46:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:53,976 INFO L93 Difference]: Finished difference Result 5545 states and 22382 transitions. [2020-12-03 16:46:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 16:46:53,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-03 16:46:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:53,989 INFO L225 Difference]: With dead ends: 5545 [2020-12-03 16:46:53,989 INFO L226 Difference]: Without dead ends: 5499 [2020-12-03 16:46:53,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-12-03 16:46:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2020-12-03 16:46:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 4140. [2020-12-03 16:46:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-12-03 16:46:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16867 transitions. [2020-12-03 16:46:54,099 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16867 transitions. Word has length 20 [2020-12-03 16:46:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:54,100 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16867 transitions. [2020-12-03 16:46:54,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 16:46:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16867 transitions. [2020-12-03 16:46:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 16:46:54,103 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:54,103 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:54,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-03 16:46:54,103 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:54,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:54,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1818104208, now seen corresponding path program 1 times [2020-12-03 16:46:54,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:54,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228975210] [2020-12-03 16:46:54,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:54,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228975210] [2020-12-03 16:46:54,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:54,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-03 16:46:54,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367896071] [2020-12-03 16:46:54,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 16:46:54,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:54,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 16:46:54,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-03 16:46:54,284 INFO L87 Difference]: Start difference. First operand 4140 states and 16867 transitions. Second operand 11 states. [2020-12-03 16:46:55,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:55,127 INFO L93 Difference]: Finished difference Result 6397 states and 25724 transitions. [2020-12-03 16:46:55,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-03 16:46:55,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-03 16:46:55,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:55,148 INFO L225 Difference]: With dead ends: 6397 [2020-12-03 16:46:55,149 INFO L226 Difference]: Without dead ends: 6351 [2020-12-03 16:46:55,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-03 16:46:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6351 states. [2020-12-03 16:46:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6351 to 4140. [2020-12-03 16:46:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-12-03 16:46:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16868 transitions. [2020-12-03 16:46:55,277 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16868 transitions. Word has length 20 [2020-12-03 16:46:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:55,277 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16868 transitions. [2020-12-03 16:46:55,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 16:46:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16868 transitions. [2020-12-03 16:46:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 16:46:55,281 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:55,281 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:55,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-03 16:46:55,281 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:55,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:55,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1599554532, now seen corresponding path program 2 times [2020-12-03 16:46:55,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:55,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725988918] [2020-12-03 16:46:55,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:55,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725988918] [2020-12-03 16:46:55,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:55,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-03 16:46:55,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002704296] [2020-12-03 16:46:55,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 16:46:55,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:55,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 16:46:55,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-03 16:46:55,457 INFO L87 Difference]: Start difference. First operand 4140 states and 16868 transitions. Second operand 11 states. [2020-12-03 16:46:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:56,162 INFO L93 Difference]: Finished difference Result 5409 states and 21869 transitions. [2020-12-03 16:46:56,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-03 16:46:56,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-03 16:46:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:56,180 INFO L225 Difference]: With dead ends: 5409 [2020-12-03 16:46:56,180 INFO L226 Difference]: Without dead ends: 5363 [2020-12-03 16:46:56,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-12-03 16:46:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2020-12-03 16:46:56,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 4142. [2020-12-03 16:46:56,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4142 states. [2020-12-03 16:46:56,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 16874 transitions. [2020-12-03 16:46:56,299 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 16874 transitions. Word has length 20 [2020-12-03 16:46:56,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:56,299 INFO L481 AbstractCegarLoop]: Abstraction has 4142 states and 16874 transitions. [2020-12-03 16:46:56,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 16:46:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 16874 transitions. [2020-12-03 16:46:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 16:46:56,303 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:56,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:56,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-03 16:46:56,303 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:56,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:56,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1117675172, now seen corresponding path program 3 times [2020-12-03 16:46:56,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:56,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853814397] [2020-12-03 16:46:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:56,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853814397] [2020-12-03 16:46:56,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:56,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 16:46:56,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907002957] [2020-12-03 16:46:56,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 16:46:56,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:56,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 16:46:56,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-03 16:46:56,439 INFO L87 Difference]: Start difference. First operand 4142 states and 16874 transitions. Second operand 10 states. [2020-12-03 16:46:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:57,005 INFO L93 Difference]: Finished difference Result 6189 states and 24832 transitions. [2020-12-03 16:46:57,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-03 16:46:57,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-03 16:46:57,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:57,025 INFO L225 Difference]: With dead ends: 6189 [2020-12-03 16:46:57,025 INFO L226 Difference]: Without dead ends: 6143 [2020-12-03 16:46:57,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-12-03 16:46:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2020-12-03 16:46:57,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 4141. [2020-12-03 16:46:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4141 states. [2020-12-03 16:46:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 16873 transitions. [2020-12-03 16:46:57,161 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 16873 transitions. Word has length 20 [2020-12-03 16:46:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:57,162 INFO L481 AbstractCegarLoop]: Abstraction has 4141 states and 16873 transitions. [2020-12-03 16:46:57,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 16:46:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 16873 transitions. [2020-12-03 16:46:57,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 16:46:57,166 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:57,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:57,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-03 16:46:57,166 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:57,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:57,167 INFO L82 PathProgramCache]: Analyzing trace with hash -240366616, now seen corresponding path program 4 times [2020-12-03 16:46:57,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:57,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376789423] [2020-12-03 16:46:57,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:57,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376789423] [2020-12-03 16:46:57,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:57,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 16:46:57,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577743823] [2020-12-03 16:46:57,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 16:46:57,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:57,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 16:46:57,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-03 16:46:57,301 INFO L87 Difference]: Start difference. First operand 4141 states and 16873 transitions. Second operand 10 states. [2020-12-03 16:46:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:57,727 INFO L93 Difference]: Finished difference Result 5246 states and 21125 transitions. [2020-12-03 16:46:57,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 16:46:57,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-03 16:46:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:57,744 INFO L225 Difference]: With dead ends: 5246 [2020-12-03 16:46:57,745 INFO L226 Difference]: Without dead ends: 5200 [2020-12-03 16:46:57,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-12-03 16:46:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2020-12-03 16:46:57,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 3983. [2020-12-03 16:46:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2020-12-03 16:46:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 16133 transitions. [2020-12-03 16:46:57,889 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 16133 transitions. Word has length 20 [2020-12-03 16:46:57,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:57,890 INFO L481 AbstractCegarLoop]: Abstraction has 3983 states and 16133 transitions. [2020-12-03 16:46:57,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 16:46:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 16133 transitions. [2020-12-03 16:46:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 16:46:57,893 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:57,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:57,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-03 16:46:57,894 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:57,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:57,895 INFO L82 PathProgramCache]: Analyzing trace with hash -565771751, now seen corresponding path program 1 times [2020-12-03 16:46:57,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:57,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446274177] [2020-12-03 16:46:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:57,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446274177] [2020-12-03 16:46:57,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:57,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 16:46:57,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678811462] [2020-12-03 16:46:57,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 16:46:57,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:57,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 16:46:57,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 16:46:57,941 INFO L87 Difference]: Start difference. First operand 3983 states and 16133 transitions. Second operand 6 states. [2020-12-03 16:46:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:58,133 INFO L93 Difference]: Finished difference Result 4762 states and 18800 transitions. [2020-12-03 16:46:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 16:46:58,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-03 16:46:58,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:58,144 INFO L225 Difference]: With dead ends: 4762 [2020-12-03 16:46:58,144 INFO L226 Difference]: Without dead ends: 4687 [2020-12-03 16:46:58,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-03 16:46:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-03 16:46:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4305. [2020-12-03 16:46:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2020-12-03 16:46:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 17320 transitions. [2020-12-03 16:46:58,233 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 17320 transitions. Word has length 21 [2020-12-03 16:46:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:58,233 INFO L481 AbstractCegarLoop]: Abstraction has 4305 states and 17320 transitions. [2020-12-03 16:46:58,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 16:46:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 17320 transitions. [2020-12-03 16:46:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 16:46:58,237 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:58,237 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:58,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-03 16:46:58,238 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:58,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:58,238 INFO L82 PathProgramCache]: Analyzing trace with hash 479599707, now seen corresponding path program 2 times [2020-12-03 16:46:58,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:58,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097190444] [2020-12-03 16:46:58,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:58,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097190444] [2020-12-03 16:46:58,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:58,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 16:46:58,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283962319] [2020-12-03 16:46:58,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 16:46:58,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:58,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 16:46:58,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-03 16:46:58,285 INFO L87 Difference]: Start difference. First operand 4305 states and 17320 transitions. Second operand 6 states. [2020-12-03 16:46:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:58,380 INFO L93 Difference]: Finished difference Result 5233 states and 20429 transitions. [2020-12-03 16:46:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 16:46:58,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-03 16:46:58,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:58,391 INFO L225 Difference]: With dead ends: 5233 [2020-12-03 16:46:58,392 INFO L226 Difference]: Without dead ends: 4707 [2020-12-03 16:46:58,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-03 16:46:58,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4707 states. [2020-12-03 16:46:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4707 to 3933. [2020-12-03 16:46:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3933 states. [2020-12-03 16:46:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 15536 transitions. [2020-12-03 16:46:58,466 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 15536 transitions. Word has length 21 [2020-12-03 16:46:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:58,466 INFO L481 AbstractCegarLoop]: Abstraction has 3933 states and 15536 transitions. [2020-12-03 16:46:58,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 16:46:58,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 15536 transitions. [2020-12-03 16:46:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 16:46:58,470 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:58,470 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:58,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-03 16:46:58,470 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:58,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:58,471 INFO L82 PathProgramCache]: Analyzing trace with hash -586116813, now seen corresponding path program 1 times [2020-12-03 16:46:58,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:58,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368141468] [2020-12-03 16:46:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:58,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368141468] [2020-12-03 16:46:58,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:58,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 16:46:58,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890508100] [2020-12-03 16:46:58,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 16:46:58,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:58,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 16:46:58,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-03 16:46:58,650 INFO L87 Difference]: Start difference. First operand 3933 states and 15536 transitions. Second operand 10 states. [2020-12-03 16:46:59,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:46:59,297 INFO L93 Difference]: Finished difference Result 4734 states and 18567 transitions. [2020-12-03 16:46:59,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 16:46:59,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-12-03 16:46:59,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:46:59,311 INFO L225 Difference]: With dead ends: 4734 [2020-12-03 16:46:59,312 INFO L226 Difference]: Without dead ends: 4685 [2020-12-03 16:46:59,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-03 16:46:59,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4685 states. [2020-12-03 16:46:59,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 3841. [2020-12-03 16:46:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2020-12-03 16:46:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 15162 transitions. [2020-12-03 16:46:59,399 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 15162 transitions. Word has length 21 [2020-12-03 16:46:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:46:59,399 INFO L481 AbstractCegarLoop]: Abstraction has 3841 states and 15162 transitions. [2020-12-03 16:46:59,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 16:46:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 15162 transitions. [2020-12-03 16:46:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 16:46:59,401 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:46:59,402 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:46:59,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-03 16:46:59,402 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:46:59,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:46:59,402 INFO L82 PathProgramCache]: Analyzing trace with hash -757352757, now seen corresponding path program 1 times [2020-12-03 16:46:59,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:46:59,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584070476] [2020-12-03 16:46:59,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:46:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:46:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:46:59,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584070476] [2020-12-03 16:46:59,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:46:59,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 16:46:59,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562473991] [2020-12-03 16:46:59,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 16:46:59,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:46:59,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 16:46:59,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-03 16:46:59,690 INFO L87 Difference]: Start difference. First operand 3841 states and 15162 transitions. Second operand 12 states. [2020-12-03 16:47:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:00,896 INFO L93 Difference]: Finished difference Result 5118 states and 20406 transitions. [2020-12-03 16:47:00,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-03 16:47:00,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-03 16:47:00,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:00,911 INFO L225 Difference]: With dead ends: 5118 [2020-12-03 16:47:00,911 INFO L226 Difference]: Without dead ends: 4964 [2020-12-03 16:47:00,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2020-12-03 16:47:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4964 states. [2020-12-03 16:47:00,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4964 to 3443. [2020-12-03 16:47:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2020-12-03 16:47:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 13378 transitions. [2020-12-03 16:47:01,008 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 13378 transitions. Word has length 21 [2020-12-03 16:47:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:01,008 INFO L481 AbstractCegarLoop]: Abstraction has 3443 states and 13378 transitions. [2020-12-03 16:47:01,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 16:47:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 13378 transitions. [2020-12-03 16:47:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 16:47:01,012 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:01,012 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:01,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-03 16:47:01,012 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:01,013 INFO L82 PathProgramCache]: Analyzing trace with hash 820571943, now seen corresponding path program 2 times [2020-12-03 16:47:01,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:01,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877706388] [2020-12-03 16:47:01,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:01,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877706388] [2020-12-03 16:47:01,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:01,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 16:47:01,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114199828] [2020-12-03 16:47:01,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 16:47:01,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:01,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 16:47:01,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-03 16:47:01,286 INFO L87 Difference]: Start difference. First operand 3443 states and 13378 transitions. Second operand 12 states. [2020-12-03 16:47:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:01,915 INFO L93 Difference]: Finished difference Result 4562 states and 17491 transitions. [2020-12-03 16:47:01,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 16:47:01,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-03 16:47:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:01,927 INFO L225 Difference]: With dead ends: 4562 [2020-12-03 16:47:01,928 INFO L226 Difference]: Without dead ends: 4510 [2020-12-03 16:47:01,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-03 16:47:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2020-12-03 16:47:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 3368. [2020-12-03 16:47:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3368 states. [2020-12-03 16:47:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 12841 transitions. [2020-12-03 16:47:02,022 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 12841 transitions. Word has length 21 [2020-12-03 16:47:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:02,022 INFO L481 AbstractCegarLoop]: Abstraction has 3368 states and 12841 transitions. [2020-12-03 16:47:02,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 16:47:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 12841 transitions. [2020-12-03 16:47:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 16:47:02,025 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:02,025 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:02,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-03 16:47:02,026 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:02,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1673753334, now seen corresponding path program 1 times [2020-12-03 16:47:02,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:02,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224456168] [2020-12-03 16:47:02,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:02,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224456168] [2020-12-03 16:47:02,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:02,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-03 16:47:02,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462087895] [2020-12-03 16:47:02,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 16:47:02,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:02,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 16:47:02,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-03 16:47:02,099 INFO L87 Difference]: Start difference. First operand 3368 states and 12841 transitions. Second operand 7 states. [2020-12-03 16:47:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:02,218 INFO L93 Difference]: Finished difference Result 3879 states and 14497 transitions. [2020-12-03 16:47:02,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 16:47:02,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-03 16:47:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:02,231 INFO L225 Difference]: With dead ends: 3879 [2020-12-03 16:47:02,231 INFO L226 Difference]: Without dead ends: 3785 [2020-12-03 16:47:02,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-03 16:47:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2020-12-03 16:47:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3369. [2020-12-03 16:47:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3369 states. [2020-12-03 16:47:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 12845 transitions. [2020-12-03 16:47:02,325 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 12845 transitions. Word has length 21 [2020-12-03 16:47:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:02,325 INFO L481 AbstractCegarLoop]: Abstraction has 3369 states and 12845 transitions. [2020-12-03 16:47:02,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 16:47:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 12845 transitions. [2020-12-03 16:47:02,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 16:47:02,328 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:02,329 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:02,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-03 16:47:02,329 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:02,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:02,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1208728268, now seen corresponding path program 1 times [2020-12-03 16:47:02,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:02,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766016233] [2020-12-03 16:47:02,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:02,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766016233] [2020-12-03 16:47:02,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:02,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-03 16:47:02,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006679855] [2020-12-03 16:47:02,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 16:47:02,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:02,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 16:47:02,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-03 16:47:02,581 INFO L87 Difference]: Start difference. First operand 3369 states and 12845 transitions. Second operand 11 states. [2020-12-03 16:47:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:03,440 INFO L93 Difference]: Finished difference Result 4138 states and 15694 transitions. [2020-12-03 16:47:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 16:47:03,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-12-03 16:47:03,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:03,451 INFO L225 Difference]: With dead ends: 4138 [2020-12-03 16:47:03,451 INFO L226 Difference]: Without dead ends: 4089 [2020-12-03 16:47:03,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-12-03 16:47:03,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2020-12-03 16:47:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 3004. [2020-12-03 16:47:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2020-12-03 16:47:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 11303 transitions. [2020-12-03 16:47:03,521 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 11303 transitions. Word has length 21 [2020-12-03 16:47:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:03,521 INFO L481 AbstractCegarLoop]: Abstraction has 3004 states and 11303 transitions. [2020-12-03 16:47:03,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 16:47:03,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 11303 transitions. [2020-12-03 16:47:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 16:47:03,524 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:03,524 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:03,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-03 16:47:03,525 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:03,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:03,525 INFO L82 PathProgramCache]: Analyzing trace with hash 172061386, now seen corresponding path program 2 times [2020-12-03 16:47:03,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:03,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723582988] [2020-12-03 16:47:03,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:03,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723582988] [2020-12-03 16:47:03,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:03,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 16:47:03,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268863538] [2020-12-03 16:47:03,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 16:47:03,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:03,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 16:47:03,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-03 16:47:03,612 INFO L87 Difference]: Start difference. First operand 3004 states and 11303 transitions. Second operand 8 states. [2020-12-03 16:47:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:03,774 INFO L93 Difference]: Finished difference Result 3058 states and 11357 transitions. [2020-12-03 16:47:03,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 16:47:03,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-12-03 16:47:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:03,782 INFO L225 Difference]: With dead ends: 3058 [2020-12-03 16:47:03,782 INFO L226 Difference]: Without dead ends: 3058 [2020-12-03 16:47:03,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-03 16:47:03,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-12-03 16:47:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2831. [2020-12-03 16:47:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-12-03 16:47:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-12-03 16:47:03,831 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-12-03 16:47:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:03,831 INFO L481 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-12-03 16:47:03,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 16:47:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-12-03 16:47:03,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 16:47:03,833 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:03,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:03,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-03 16:47:03,834 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:03,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:03,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1320448504, now seen corresponding path program 1 times [2020-12-03 16:47:03,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:03,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892351985] [2020-12-03 16:47:03,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:03,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892351985] [2020-12-03 16:47:03,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:03,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 16:47:03,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905140592] [2020-12-03 16:47:03,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 16:47:03,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:03,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 16:47:03,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-03 16:47:03,953 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2020-12-03 16:47:04,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:04,278 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2020-12-03 16:47:04,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 16:47:04,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-12-03 16:47:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:04,288 INFO L225 Difference]: With dead ends: 3550 [2020-12-03 16:47:04,288 INFO L226 Difference]: Without dead ends: 3490 [2020-12-03 16:47:04,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-03 16:47:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2020-12-03 16:47:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2020-12-03 16:47:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2020-12-03 16:47:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2020-12-03 16:47:04,345 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2020-12-03 16:47:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:04,346 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2020-12-03 16:47:04,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 16:47:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2020-12-03 16:47:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 16:47:04,348 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:04,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:04,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-03 16:47:04,349 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:04,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:04,350 INFO L82 PathProgramCache]: Analyzing trace with hash -893918318, now seen corresponding path program 2 times [2020-12-03 16:47:04,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:04,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686599078] [2020-12-03 16:47:04,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:04,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686599078] [2020-12-03 16:47:04,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:04,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 16:47:04,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202186002] [2020-12-03 16:47:04,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-03 16:47:04,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:04,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-03 16:47:04,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-03 16:47:04,469 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2020-12-03 16:47:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:04,883 INFO L93 Difference]: Finished difference Result 3862 states and 14252 transitions. [2020-12-03 16:47:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 16:47:04,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-12-03 16:47:04,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:04,897 INFO L225 Difference]: With dead ends: 3862 [2020-12-03 16:47:04,897 INFO L226 Difference]: Without dead ends: 3802 [2020-12-03 16:47:04,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-03 16:47:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2020-12-03 16:47:05,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2822. [2020-12-03 16:47:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-12-03 16:47:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-12-03 16:47:05,054 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-12-03 16:47:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:05,055 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-12-03 16:47:05,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-03 16:47:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-12-03 16:47:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 16:47:05,058 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:05,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:05,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-03 16:47:05,058 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:05,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash 131153448, now seen corresponding path program 3 times [2020-12-03 16:47:05,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:05,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289038099] [2020-12-03 16:47:05,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:05,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289038099] [2020-12-03 16:47:05,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:05,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 16:47:05,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303977937] [2020-12-03 16:47:05,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 16:47:05,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:05,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 16:47:05,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-03 16:47:05,212 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 10 states. [2020-12-03 16:47:05,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:05,617 INFO L93 Difference]: Finished difference Result 4277 states and 15941 transitions. [2020-12-03 16:47:05,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 16:47:05,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-03 16:47:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:05,629 INFO L225 Difference]: With dead ends: 4277 [2020-12-03 16:47:05,630 INFO L226 Difference]: Without dead ends: 4217 [2020-12-03 16:47:05,630 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 [2020-12-03 16:47:05,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2020-12-03 16:47:05,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 2818. [2020-12-03 16:47:05,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2020-12-03 16:47:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 10596 transitions. [2020-12-03 16:47:05,692 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 10596 transitions. Word has length 22 [2020-12-03 16:47:05,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:05,693 INFO L481 AbstractCegarLoop]: Abstraction has 2818 states and 10596 transitions. [2020-12-03 16:47:05,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 16:47:05,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 10596 transitions. [2020-12-03 16:47:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 16:47:05,695 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:05,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:05,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-03 16:47:05,695 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:05,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:05,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1026439080, now seen corresponding path program 4 times [2020-12-03 16:47:05,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:05,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367142411] [2020-12-03 16:47:05,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:05,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367142411] [2020-12-03 16:47:05,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:05,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 16:47:05,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930943121] [2020-12-03 16:47:05,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 16:47:05,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:05,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 16:47:05,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-03 16:47:05,804 INFO L87 Difference]: Start difference. First operand 2818 states and 10596 transitions. Second operand 10 states. [2020-12-03 16:47:06,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:06,059 INFO L93 Difference]: Finished difference Result 3433 states and 12660 transitions. [2020-12-03 16:47:06,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 16:47:06,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-03 16:47:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:06,067 INFO L225 Difference]: With dead ends: 3433 [2020-12-03 16:47:06,067 INFO L226 Difference]: Without dead ends: 3373 [2020-12-03 16:47:06,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-12-03 16:47:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2020-12-03 16:47:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 2730. [2020-12-03 16:47:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2020-12-03 16:47:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 10232 transitions. [2020-12-03 16:47:06,116 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 10232 transitions. Word has length 22 [2020-12-03 16:47:06,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:06,117 INFO L481 AbstractCegarLoop]: Abstraction has 2730 states and 10232 transitions. [2020-12-03 16:47:06,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 16:47:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 10232 transitions. [2020-12-03 16:47:06,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 16:47:06,118 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:06,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:06,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-03 16:47:06,119 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:06,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:06,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1544480782, now seen corresponding path program 5 times [2020-12-03 16:47:06,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:06,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933582608] [2020-12-03 16:47:06,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:06,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933582608] [2020-12-03 16:47:06,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:06,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 16:47:06,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196487420] [2020-12-03 16:47:06,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 16:47:06,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:06,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 16:47:06,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-03 16:47:06,351 INFO L87 Difference]: Start difference. First operand 2730 states and 10232 transitions. Second operand 12 states. [2020-12-03 16:47:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:06,802 INFO L93 Difference]: Finished difference Result 3588 states and 13121 transitions. [2020-12-03 16:47:06,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 16:47:06,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-12-03 16:47:06,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:06,811 INFO L225 Difference]: With dead ends: 3588 [2020-12-03 16:47:06,811 INFO L226 Difference]: Without dead ends: 3528 [2020-12-03 16:47:06,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2020-12-03 16:47:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2020-12-03 16:47:06,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 2670. [2020-12-03 16:47:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-12-03 16:47:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2020-12-03 16:47:06,860 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2020-12-03 16:47:06,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:06,860 INFO L481 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2020-12-03 16:47:06,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 16:47:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2020-12-03 16:47:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-03 16:47:06,862 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:06,863 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:06,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-03 16:47:06,863 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:06,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:06,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1499150017, now seen corresponding path program 1 times [2020-12-03 16:47:06,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:06,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385039035] [2020-12-03 16:47:06,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:07,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385039035] [2020-12-03 16:47:07,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:07,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 16:47:07,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519501688] [2020-12-03 16:47:07,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 16:47:07,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:07,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 16:47:07,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-03 16:47:07,194 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2020-12-03 16:47:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:08,030 INFO L93 Difference]: Finished difference Result 2896 states and 10368 transitions. [2020-12-03 16:47:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-03 16:47:08,030 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-03 16:47:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:08,038 INFO L225 Difference]: With dead ends: 2896 [2020-12-03 16:47:08,038 INFO L226 Difference]: Without dead ends: 2802 [2020-12-03 16:47:08,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2020-12-03 16:47:08,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2020-12-03 16:47:08,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2426. [2020-12-03 16:47:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2020-12-03 16:47:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 8840 transitions. [2020-12-03 16:47:08,085 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 8840 transitions. Word has length 23 [2020-12-03 16:47:08,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:08,085 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 8840 transitions. [2020-12-03 16:47:08,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 16:47:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 8840 transitions. [2020-12-03 16:47:08,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-03 16:47:08,087 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:08,087 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:08,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-03 16:47:08,088 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:08,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:08,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1292151056, now seen corresponding path program 1 times [2020-12-03 16:47:08,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:08,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734381544] [2020-12-03 16:47:08,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:08,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734381544] [2020-12-03 16:47:08,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:08,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 16:47:08,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165682681] [2020-12-03 16:47:08,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 16:47:08,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:08,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 16:47:08,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-03 16:47:08,392 INFO L87 Difference]: Start difference. First operand 2426 states and 8840 transitions. Second operand 12 states. [2020-12-03 16:47:08,804 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-12-03 16:47:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:09,252 INFO L93 Difference]: Finished difference Result 2538 states and 8863 transitions. [2020-12-03 16:47:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-03 16:47:09,253 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-03 16:47:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:09,260 INFO L225 Difference]: With dead ends: 2538 [2020-12-03 16:47:09,260 INFO L226 Difference]: Without dead ends: 2419 [2020-12-03 16:47:09,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-12-03 16:47:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2020-12-03 16:47:09,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1794. [2020-12-03 16:47:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-12-03 16:47:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2020-12-03 16:47:09,291 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2020-12-03 16:47:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:09,291 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2020-12-03 16:47:09,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 16:47:09,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2020-12-03 16:47:09,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 16:47:09,293 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:09,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:09,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-03 16:47:09,294 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:09,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:09,294 INFO L82 PathProgramCache]: Analyzing trace with hash -974214744, now seen corresponding path program 1 times [2020-12-03 16:47:09,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:09,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500867853] [2020-12-03 16:47:09,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:09,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500867853] [2020-12-03 16:47:09,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:09,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 16:47:09,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256180167] [2020-12-03 16:47:09,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 16:47:09,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:09,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 16:47:09,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 16:47:09,361 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 6 states. [2020-12-03 16:47:09,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:09,541 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2020-12-03 16:47:09,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 16:47:09,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-12-03 16:47:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:09,548 INFO L225 Difference]: With dead ends: 2291 [2020-12-03 16:47:09,548 INFO L226 Difference]: Without dead ends: 2227 [2020-12-03 16:47:09,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-03 16:47:09,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2020-12-03 16:47:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2020-12-03 16:47:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-12-03 16:47:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2020-12-03 16:47:09,623 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2020-12-03 16:47:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:09,623 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2020-12-03 16:47:09,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 16:47:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2020-12-03 16:47:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 16:47:09,627 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:09,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:09,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-03 16:47:09,627 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:09,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1120972762, now seen corresponding path program 2 times [2020-12-03 16:47:09,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:09,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944574052] [2020-12-03 16:47:09,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:09,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944574052] [2020-12-03 16:47:09,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:09,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 16:47:09,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830249330] [2020-12-03 16:47:09,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 16:47:09,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:09,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 16:47:09,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-03 16:47:09,722 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 8 states. [2020-12-03 16:47:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:10,112 INFO L93 Difference]: Finished difference Result 2599 states and 8709 transitions. [2020-12-03 16:47:10,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 16:47:10,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-03 16:47:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:10,118 INFO L225 Difference]: With dead ends: 2599 [2020-12-03 16:47:10,119 INFO L226 Difference]: Without dead ends: 2535 [2020-12-03 16:47:10,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-03 16:47:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2020-12-03 16:47:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2102. [2020-12-03 16:47:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-12-03 16:47:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7273 transitions. [2020-12-03 16:47:10,168 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7273 transitions. Word has length 24 [2020-12-03 16:47:10,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:10,168 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7273 transitions. [2020-12-03 16:47:10,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 16:47:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7273 transitions. [2020-12-03 16:47:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 16:47:10,171 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:10,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:10,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-03 16:47:10,172 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:10,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:10,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1176290112, now seen corresponding path program 3 times [2020-12-03 16:47:10,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:10,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204208708] [2020-12-03 16:47:10,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:10,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204208708] [2020-12-03 16:47:10,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:10,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 16:47:10,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28826454] [2020-12-03 16:47:10,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-03 16:47:10,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:10,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-03 16:47:10,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-03 16:47:10,293 INFO L87 Difference]: Start difference. First operand 2102 states and 7273 transitions. Second operand 9 states. [2020-12-03 16:47:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:10,717 INFO L93 Difference]: Finished difference Result 2898 states and 9677 transitions. [2020-12-03 16:47:10,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 16:47:10,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-12-03 16:47:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:10,724 INFO L225 Difference]: With dead ends: 2898 [2020-12-03 16:47:10,724 INFO L226 Difference]: Without dead ends: 2834 [2020-12-03 16:47:10,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-03 16:47:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2020-12-03 16:47:10,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2093. [2020-12-03 16:47:10,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2020-12-03 16:47:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 7255 transitions. [2020-12-03 16:47:10,759 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 7255 transitions. Word has length 24 [2020-12-03 16:47:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:10,760 INFO L481 AbstractCegarLoop]: Abstraction has 2093 states and 7255 transitions. [2020-12-03 16:47:10,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-03 16:47:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 7255 transitions. [2020-12-03 16:47:10,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 16:47:10,762 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:10,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:10,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-03 16:47:10,762 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:10,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1572220842, now seen corresponding path program 4 times [2020-12-03 16:47:10,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:10,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045889321] [2020-12-03 16:47:10,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:10,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045889321] [2020-12-03 16:47:10,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:10,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 16:47:10,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720732448] [2020-12-03 16:47:10,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 16:47:10,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:10,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 16:47:10,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-03 16:47:10,923 INFO L87 Difference]: Start difference. First operand 2093 states and 7255 transitions. Second operand 10 states. [2020-12-03 16:47:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:11,354 INFO L93 Difference]: Finished difference Result 2875 states and 9618 transitions. [2020-12-03 16:47:11,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 16:47:11,355 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-12-03 16:47:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:11,360 INFO L225 Difference]: With dead ends: 2875 [2020-12-03 16:47:11,361 INFO L226 Difference]: Without dead ends: 2811 [2020-12-03 16:47:11,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-12-03 16:47:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2020-12-03 16:47:11,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2079. [2020-12-03 16:47:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2020-12-03 16:47:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 7214 transitions. [2020-12-03 16:47:11,412 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 7214 transitions. Word has length 24 [2020-12-03 16:47:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:11,412 INFO L481 AbstractCegarLoop]: Abstraction has 2079 states and 7214 transitions. [2020-12-03 16:47:11,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 16:47:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 7214 transitions. [2020-12-03 16:47:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 16:47:11,415 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:11,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:11,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-03 16:47:11,416 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:11,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:11,418 INFO L82 PathProgramCache]: Analyzing trace with hash 438749216, now seen corresponding path program 5 times [2020-12-03 16:47:11,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:11,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69749285] [2020-12-03 16:47:11,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:11,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69749285] [2020-12-03 16:47:11,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:11,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-03 16:47:11,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034831228] [2020-12-03 16:47:11,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 16:47:11,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:11,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 16:47:11,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-03 16:47:11,582 INFO L87 Difference]: Start difference. First operand 2079 states and 7214 transitions. Second operand 11 states. [2020-12-03 16:47:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:11,933 INFO L93 Difference]: Finished difference Result 3106 states and 10587 transitions. [2020-12-03 16:47:11,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 16:47:11,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-03 16:47:11,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:11,942 INFO L225 Difference]: With dead ends: 3106 [2020-12-03 16:47:11,942 INFO L226 Difference]: Without dead ends: 3042 [2020-12-03 16:47:11,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-12-03 16:47:11,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2020-12-03 16:47:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2071. [2020-12-03 16:47:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2020-12-03 16:47:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7186 transitions. [2020-12-03 16:47:11,983 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7186 transitions. Word has length 24 [2020-12-03 16:47:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:11,983 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 7186 transitions. [2020-12-03 16:47:11,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 16:47:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7186 transitions. [2020-12-03 16:47:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 16:47:11,986 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:11,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:11,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-03 16:47:11,986 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:11,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:11,987 INFO L82 PathProgramCache]: Analyzing trace with hash 991769996, now seen corresponding path program 6 times [2020-12-03 16:47:11,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:11,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528689999] [2020-12-03 16:47:11,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:12,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528689999] [2020-12-03 16:47:12,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:12,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-03 16:47:12,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864501775] [2020-12-03 16:47:12,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 16:47:12,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:12,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 16:47:12,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-03 16:47:12,117 INFO L87 Difference]: Start difference. First operand 2071 states and 7186 transitions. Second operand 11 states. [2020-12-03 16:47:12,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:12,400 INFO L93 Difference]: Finished difference Result 2481 states and 8355 transitions. [2020-12-03 16:47:12,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 16:47:12,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-03 16:47:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:12,406 INFO L225 Difference]: With dead ends: 2481 [2020-12-03 16:47:12,406 INFO L226 Difference]: Without dead ends: 2417 [2020-12-03 16:47:12,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2020-12-03 16:47:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2020-12-03 16:47:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2039. [2020-12-03 16:47:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2020-12-03 16:47:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 7058 transitions. [2020-12-03 16:47:12,441 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 7058 transitions. Word has length 24 [2020-12-03 16:47:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:12,441 INFO L481 AbstractCegarLoop]: Abstraction has 2039 states and 7058 transitions. [2020-12-03 16:47:12,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 16:47:12,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 7058 transitions. [2020-12-03 16:47:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 16:47:12,444 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:12,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:12,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-03 16:47:12,445 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:12,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:12,445 INFO L82 PathProgramCache]: Analyzing trace with hash 71780478, now seen corresponding path program 7 times [2020-12-03 16:47:12,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:12,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799639134] [2020-12-03 16:47:12,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:12,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799639134] [2020-12-03 16:47:12,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:12,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-03 16:47:12,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599536663] [2020-12-03 16:47:12,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-03 16:47:12,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:12,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-03 16:47:12,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-12-03 16:47:12,711 INFO L87 Difference]: Start difference. First operand 2039 states and 7058 transitions. Second operand 13 states. [2020-12-03 16:47:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:13,680 INFO L93 Difference]: Finished difference Result 3018 states and 10169 transitions. [2020-12-03 16:47:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 16:47:13,681 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2020-12-03 16:47:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:13,687 INFO L225 Difference]: With dead ends: 3018 [2020-12-03 16:47:13,687 INFO L226 Difference]: Without dead ends: 2890 [2020-12-03 16:47:13,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-03 16:47:13,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-12-03 16:47:13,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1971. [2020-12-03 16:47:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2020-12-03 16:47:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 6882 transitions. [2020-12-03 16:47:13,722 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 6882 transitions. Word has length 24 [2020-12-03 16:47:13,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:13,722 INFO L481 AbstractCegarLoop]: Abstraction has 1971 states and 6882 transitions. [2020-12-03 16:47:13,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-03 16:47:13,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 6882 transitions. [2020-12-03 16:47:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 16:47:13,724 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:13,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:13,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-03 16:47:13,725 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:13,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:13,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1318319474, now seen corresponding path program 1 times [2020-12-03 16:47:13,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:13,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762422698] [2020-12-03 16:47:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:13,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762422698] [2020-12-03 16:47:13,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:13,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 16:47:13,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788856529] [2020-12-03 16:47:13,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 16:47:13,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:13,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 16:47:13,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-03 16:47:13,952 INFO L87 Difference]: Start difference. First operand 1971 states and 6882 transitions. Second operand 12 states. [2020-12-03 16:47:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:14,363 INFO L93 Difference]: Finished difference Result 3157 states and 10632 transitions. [2020-12-03 16:47:14,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 16:47:14,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-12-03 16:47:14,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:14,373 INFO L225 Difference]: With dead ends: 3157 [2020-12-03 16:47:14,373 INFO L226 Difference]: Without dead ends: 3133 [2020-12-03 16:47:14,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-03 16:47:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2020-12-03 16:47:14,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 1613. [2020-12-03 16:47:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2020-12-03 16:47:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5563 transitions. [2020-12-03 16:47:14,427 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 5563 transitions. Word has length 24 [2020-12-03 16:47:14,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:14,427 INFO L481 AbstractCegarLoop]: Abstraction has 1613 states and 5563 transitions. [2020-12-03 16:47:14,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 16:47:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 5563 transitions. [2020-12-03 16:47:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-03 16:47:14,431 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:14,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:14,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-03 16:47:14,431 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:14,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1290250801, now seen corresponding path program 1 times [2020-12-03 16:47:14,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:14,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74863900] [2020-12-03 16:47:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:14,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74863900] [2020-12-03 16:47:14,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:14,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 16:47:14,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8635318] [2020-12-03 16:47:14,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 16:47:14,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:14,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 16:47:14,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-03 16:47:14,646 INFO L87 Difference]: Start difference. First operand 1613 states and 5563 transitions. Second operand 12 states. [2020-12-03 16:47:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:15,327 INFO L93 Difference]: Finished difference Result 2298 states and 7608 transitions. [2020-12-03 16:47:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 16:47:15,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-03 16:47:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:15,332 INFO L225 Difference]: With dead ends: 2298 [2020-12-03 16:47:15,332 INFO L226 Difference]: Without dead ends: 2254 [2020-12-03 16:47:15,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2020-12-03 16:47:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2020-12-03 16:47:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1611. [2020-12-03 16:47:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2020-12-03 16:47:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 5567 transitions. [2020-12-03 16:47:15,372 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 5567 transitions. Word has length 26 [2020-12-03 16:47:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:15,372 INFO L481 AbstractCegarLoop]: Abstraction has 1611 states and 5567 transitions. [2020-12-03 16:47:15,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 16:47:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 5567 transitions. [2020-12-03 16:47:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-03 16:47:15,376 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:15,376 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:15,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-03 16:47:15,377 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:15,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:15,377 INFO L82 PathProgramCache]: Analyzing trace with hash -943856693, now seen corresponding path program 2 times [2020-12-03 16:47:15,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:15,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717993143] [2020-12-03 16:47:15,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:15,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717993143] [2020-12-03 16:47:15,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:15,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 16:47:15,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793829039] [2020-12-03 16:47:15,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 16:47:15,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:15,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 16:47:15,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-03 16:47:15,588 INFO L87 Difference]: Start difference. First operand 1611 states and 5567 transitions. Second operand 12 states. [2020-12-03 16:47:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:16,068 INFO L93 Difference]: Finished difference Result 2242 states and 7477 transitions. [2020-12-03 16:47:16,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 16:47:16,068 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-03 16:47:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:16,074 INFO L225 Difference]: With dead ends: 2242 [2020-12-03 16:47:16,074 INFO L226 Difference]: Without dead ends: 2198 [2020-12-03 16:47:16,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-03 16:47:16,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2020-12-03 16:47:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1587. [2020-12-03 16:47:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-12-03 16:47:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 5509 transitions. [2020-12-03 16:47:16,105 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 5509 transitions. Word has length 26 [2020-12-03 16:47:16,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:16,105 INFO L481 AbstractCegarLoop]: Abstraction has 1587 states and 5509 transitions. [2020-12-03 16:47:16,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 16:47:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 5509 transitions. [2020-12-03 16:47:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-03 16:47:16,107 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:16,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:16,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-03 16:47:16,108 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:16,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:16,108 INFO L82 PathProgramCache]: Analyzing trace with hash -390835913, now seen corresponding path program 3 times [2020-12-03 16:47:16,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:16,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662963883] [2020-12-03 16:47:16,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:16,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662963883] [2020-12-03 16:47:16,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:16,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 16:47:16,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092483126] [2020-12-03 16:47:16,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 16:47:16,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:16,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 16:47:16,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-03 16:47:16,303 INFO L87 Difference]: Start difference. First operand 1587 states and 5509 transitions. Second operand 12 states. [2020-12-03 16:47:16,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:16,738 INFO L93 Difference]: Finished difference Result 1640 states and 5473 transitions. [2020-12-03 16:47:16,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 16:47:16,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-03 16:47:16,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:16,743 INFO L225 Difference]: With dead ends: 1640 [2020-12-03 16:47:16,743 INFO L226 Difference]: Without dead ends: 1596 [2020-12-03 16:47:16,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-03 16:47:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2020-12-03 16:47:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 885. [2020-12-03 16:47:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-03 16:47:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-12-03 16:47:16,765 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-12-03 16:47:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:16,765 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-12-03 16:47:16,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 16:47:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-12-03 16:47:16,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-03 16:47:16,767 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:16,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:16,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-03 16:47:16,767 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:16,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:16,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1977826857, now seen corresponding path program 1 times [2020-12-03 16:47:16,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:16,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795144875] [2020-12-03 16:47:16,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:16,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795144875] [2020-12-03 16:47:16,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:16,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 16:47:16,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117627479] [2020-12-03 16:47:16,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 16:47:16,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:16,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 16:47:16,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-03 16:47:16,914 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-12-03 16:47:17,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:17,137 INFO L93 Difference]: Finished difference Result 885 states and 3021 transitions. [2020-12-03 16:47:17,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 16:47:17,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-03 16:47:17,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:17,141 INFO L225 Difference]: With dead ends: 885 [2020-12-03 16:47:17,141 INFO L226 Difference]: Without dead ends: 885 [2020-12-03 16:47:17,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-03 16:47:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2020-12-03 16:47:17,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2020-12-03 16:47:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-03 16:47:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3021 transitions. [2020-12-03 16:47:17,155 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3021 transitions. Word has length 41 [2020-12-03 16:47:17,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:17,155 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3021 transitions. [2020-12-03 16:47:17,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 16:47:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3021 transitions. [2020-12-03 16:47:17,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-03 16:47:17,157 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:17,158 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:17,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-03 16:47:17,158 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:17,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:17,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1154622732, now seen corresponding path program 1 times [2020-12-03 16:47:17,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:17,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972997130] [2020-12-03 16:47:17,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:17,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972997130] [2020-12-03 16:47:17,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:17,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 16:47:17,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784302574] [2020-12-03 16:47:17,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 16:47:17,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:17,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 16:47:17,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-03 16:47:17,236 INFO L87 Difference]: Start difference. First operand 885 states and 3021 transitions. Second operand 7 states. [2020-12-03 16:47:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:17,374 INFO L93 Difference]: Finished difference Result 885 states and 3017 transitions. [2020-12-03 16:47:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 16:47:17,375 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-03 16:47:17,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:17,377 INFO L225 Difference]: With dead ends: 885 [2020-12-03 16:47:17,377 INFO L226 Difference]: Without dead ends: 741 [2020-12-03 16:47:17,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-03 16:47:17,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-03 16:47:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-03 16:47:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-03 16:47:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2489 transitions. [2020-12-03 16:47:17,394 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2489 transitions. Word has length 41 [2020-12-03 16:47:17,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:17,395 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2489 transitions. [2020-12-03 16:47:17,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 16:47:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2489 transitions. [2020-12-03 16:47:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-03 16:47:17,397 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:17,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:17,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-03 16:47:17,398 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:17,398 INFO L82 PathProgramCache]: Analyzing trace with hash -267308717, now seen corresponding path program 1 times [2020-12-03 16:47:17,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:17,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950313421] [2020-12-03 16:47:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:17,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950313421] [2020-12-03 16:47:17,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:17,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 16:47:17,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947038446] [2020-12-03 16:47:17,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 16:47:17,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:17,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 16:47:17,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-03 16:47:17,536 INFO L87 Difference]: Start difference. First operand 741 states and 2489 transitions. Second operand 8 states. [2020-12-03 16:47:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:17,719 INFO L93 Difference]: Finished difference Result 741 states and 2481 transitions. [2020-12-03 16:47:17,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 16:47:17,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-03 16:47:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:17,722 INFO L225 Difference]: With dead ends: 741 [2020-12-03 16:47:17,723 INFO L226 Difference]: Without dead ends: 741 [2020-12-03 16:47:17,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-03 16:47:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-03 16:47:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-03 16:47:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-03 16:47:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2481 transitions. [2020-12-03 16:47:17,741 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2481 transitions. Word has length 41 [2020-12-03 16:47:17,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:17,741 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2481 transitions. [2020-12-03 16:47:17,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 16:47:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2481 transitions. [2020-12-03 16:47:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-03 16:47:17,745 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:17,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:17,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-03 16:47:17,745 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:17,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1194300753, now seen corresponding path program 1 times [2020-12-03 16:47:17,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:17,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784527821] [2020-12-03 16:47:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 16:47:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 16:47:17,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784527821] [2020-12-03 16:47:17,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 16:47:17,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 16:47:17,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615930422] [2020-12-03 16:47:17,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 16:47:17,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 16:47:17,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 16:47:17,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-03 16:47:17,843 INFO L87 Difference]: Start difference. First operand 741 states and 2481 transitions. Second operand 7 states. [2020-12-03 16:47:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 16:47:17,962 INFO L93 Difference]: Finished difference Result 741 states and 2477 transitions. [2020-12-03 16:47:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 16:47:17,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-03 16:47:17,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 16:47:17,964 INFO L225 Difference]: With dead ends: 741 [2020-12-03 16:47:17,965 INFO L226 Difference]: Without dead ends: 495 [2020-12-03 16:47:17,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-03 16:47:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-12-03 16:47:17,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2020-12-03 16:47:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2020-12-03 16:47:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1606 transitions. [2020-12-03 16:47:17,977 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1606 transitions. Word has length 41 [2020-12-03 16:47:17,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 16:47:17,978 INFO L481 AbstractCegarLoop]: Abstraction has 495 states and 1606 transitions. [2020-12-03 16:47:17,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 16:47:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1606 transitions. [2020-12-03 16:47:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-03 16:47:17,980 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 16:47:17,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 16:47:17,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-03 16:47:17,981 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-03 16:47:17,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 16:47:17,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1766059350, now seen corresponding path program 1 times [2020-12-03 16:47:17,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 16:47:17,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853366740] [2020-12-03 16:47:17,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 16:47:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 16:47:18,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 16:47:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 16:47:18,025 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 16:47:18,067 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-03 16:47:18,068 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-03 16:47:18,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-03 16:47:18,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:47:18 BasicIcfg [2020-12-03 16:47:18,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 16:47:18,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 16:47:18,186 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 16:47:18,186 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 16:47:18,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:46:34" (3/4) ... [2020-12-03 16:47:18,189 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-03 16:47:18,300 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-03 16:47:18,301 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 16:47:18,302 INFO L168 Benchmark]: Toolchain (without parser) took 45133.40 ms. Allocated memory was 46.1 MB in the beginning and 1.5 GB in the end (delta: 1.5 GB). Free memory was 21.9 MB in the beginning and 612.2 MB in the end (delta: -590.4 MB). Peak memory consumption was 899.0 MB. Max. memory is 16.1 GB. [2020-12-03 16:47:18,302 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 46.1 MB. Free memory is still 31.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 16:47:18,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 958.20 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 21.6 MB in the beginning and 35.0 MB in the end (delta: -13.4 MB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. [2020-12-03 16:47:18,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.30 ms. Allocated memory is still 56.6 MB. Free memory was 35.0 MB in the beginning and 32.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 16:47:18,303 INFO L168 Benchmark]: Boogie Preprocessor took 31.53 ms. Allocated memory is still 56.6 MB. Free memory was 32.7 MB in the beginning and 31.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 16:47:18,304 INFO L168 Benchmark]: RCFGBuilder took 626.37 ms. Allocated memory is still 56.6 MB. Free memory was 31.3 MB in the beginning and 19.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 12.0 MB. Max. memory is 16.1 GB. [2020-12-03 16:47:18,304 INFO L168 Benchmark]: TraceAbstraction took 43300.16 ms. Allocated memory was 56.6 MB in the beginning and 1.5 GB in the end (delta: 1.5 GB). Free memory was 19.0 MB in the beginning and 633.2 MB in the end (delta: -614.2 MB). Peak memory consumption was 862.4 MB. Max. memory is 16.1 GB. [2020-12-03 16:47:18,305 INFO L168 Benchmark]: Witness Printer took 115.16 ms. Allocated memory is still 1.5 GB. Free memory was 632.1 MB in the beginning and 612.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-03 16:47:18,307 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.74 ms. Allocated memory is still 46.1 MB. Free memory is still 31.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 958.20 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 21.6 MB in the beginning and 35.0 MB in the end (delta: -13.4 MB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 91.30 ms. Allocated memory is still 56.6 MB. Free memory was 35.0 MB in the beginning and 32.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.53 ms. Allocated memory is still 56.6 MB. Free memory was 32.7 MB in the beginning and 31.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 626.37 ms. Allocated memory is still 56.6 MB. Free memory was 31.3 MB in the beginning and 19.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 12.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 43300.16 ms. Allocated memory was 56.6 MB in the beginning and 1.5 GB in the end (delta: 1.5 GB). Free memory was 19.0 MB in the beginning and 633.2 MB in the end (delta: -614.2 MB). Peak memory consumption was 862.4 MB. Max. memory is 16.1 GB. * Witness Printer took 115.16 ms. Allocated memory is still 1.5 GB. Free memory was 632.1 MB in the beginning and 612.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 3374 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 1145 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.5s, 167 PlacesBefore, 93 PlacesAfterwards, 248 TransitionsBefore, 173 TransitionsAfterwards, 4156 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 49018 MoverChecksTotal - CounterExampleResult [Line: 1123]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1124] 0 char *v; [L1161] 0 pthread_t t; [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; [L1163] 0 \read(t) VAL [arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) [L1128] 2 return 0; [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1133] 5 v[0] = 'X' [L1135] 5 return 0; [L1133] 3 v[0] = 'X' [L1135] 3 return 0; [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1153] 1 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1154] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1133] 6 v[0] = 'X' [L1135] 6 return 0; [L1140] 4 v[0] = 'Y' [L1142] 4 return 0; [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1155] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1156] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] [L1164] 0 v[0] [L1123] COND TRUE 0 !expression [L1123] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 42.8s, OverallIterations: 53, TraceHistogramMax: 1, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 5380 SDtfs, 11076 SDslu, 16167 SDs, 0 SdLazy, 10055 SolverSat, 1668 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 60 SyntacticMatches, 18 SemanticMatches, 625 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4305occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 52 MinimizatonAttempts, 47589 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1193 NumberOfCodeBlocks, 1193 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1100 ConstructedInterpolants, 0 QuantifiedInterpolants, 426321 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 52 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...