./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/singleton.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5758efa3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-64bit-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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f3491af59218a0433b9de95fff59451438a5c03e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.1.24-5758efa [2019-11-26 20:30:06,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 20:30:06,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 20:30:07,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 20:30:07,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 20:30:07,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 20:30:07,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 20:30:07,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 20:30:07,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 20:30:07,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 20:30:07,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 20:30:07,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 20:30:07,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 20:30:07,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 20:30:07,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 20:30:07,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 20:30:07,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 20:30:07,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 20:30:07,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 20:30:07,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 20:30:07,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 20:30:07,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 20:30:07,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 20:30:07,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 20:30:07,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 20:30:07,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 20:30:07,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 20:30:07,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 20:30:07,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 20:30:07,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 20:30:07,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 20:30:07,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 20:30:07,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 20:30:07,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 20:30:07,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 20:30:07,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 20:30:07,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 20:30:07,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 20:30:07,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 20:30:07,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 20:30:07,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 20:30:07,087 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-26 20:30:07,107 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 20:30:07,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 20:30:07,109 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 20:30:07,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 20:30:07,111 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 20:30:07,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 20:30:07,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 20:30:07,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 20:30:07,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 20:30:07,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 20:30:07,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 20:30:07,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 20:30:07,115 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 20:30:07,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 20:30:07,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 20:30:07,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 20:30:07,116 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 20:30:07,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 20:30:07,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 20:30:07,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 20:30:07,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 20:30:07,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 20:30:07,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-26 20:30:07,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 20:30:07,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 20:30:07,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 20:30:07,119 INFO L138 SettingsManager]: * To the following directory=dump/ 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(__VERIFIER_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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3491af59218a0433b9de95fff59451438a5c03e [2019-11-26 20:30:07,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 20:30:07,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 20:30:07,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 20:30:07,472 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 20:30:07,472 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 20:30:07,473 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton.i [2019-11-26 20:30:07,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1004d9789/193dafacc61b4b5eb7f0e07715c48d58/FLAG8dcb8b8ba [2019-11-26 20:30:08,114 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 20:30:08,115 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i [2019-11-26 20:30:08,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1004d9789/193dafacc61b4b5eb7f0e07715c48d58/FLAG8dcb8b8ba [2019-11-26 20:30:08,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1004d9789/193dafacc61b4b5eb7f0e07715c48d58 [2019-11-26 20:30:08,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 20:30:08,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 20:30:08,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 20:30:08,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 20:30:08,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 20:30:08,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:30:08" (1/1) ... [2019-11-26 20:30:08,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cce8044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:30:08, skipping insertion in model container [2019-11-26 20:30:08,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:30:08" (1/1) ... [2019-11-26 20:30:08,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 20:30:08,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 20:30:08,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:30:09,001 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 20:30:09,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:30:09,236 INFO L208 MainTranslator]: Completed translation [2019-11-26 20:30:09,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:30:09 WrapperNode [2019-11-26 20:30:09,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 20:30:09,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 20:30:09,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 20:30:09,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 20:30:09,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:30:09" (1/1) ... [2019-11-26 20:30:09,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:30:09" (1/1) ... [2019-11-26 20:30:09,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 20:30:09,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 20:30:09,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 20:30:09,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 20:30:09,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:30:09" (1/1) ... [2019-11-26 20:30:09,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:30:09" (1/1) ... [2019-11-26 20:30:09,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:30:09" (1/1) ... [2019-11-26 20:30:09,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:30:09" (1/1) ... [2019-11-26 20:30:09,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:30:09" (1/1) ... [2019-11-26 20:30:09,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:30:09" (1/1) ... [2019-11-26 20:30:09,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:30:09" (1/1) ... [2019-11-26 20:30:09,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 20:30:09,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 20:30:09,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 20:30:09,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 20:30:09,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:30:09" (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 [2019-11-26 20:30:09,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 20:30:09,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 20:30:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 20:30:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2019-11-26 20:30:09,417 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2019-11-26 20:30:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2019-11-26 20:30:09,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2019-11-26 20:30:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2019-11-26 20:30:09,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2019-11-26 20:30:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2019-11-26 20:30:09,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2019-11-26 20:30:09,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 20:30:09,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 20:30:09,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 20:30:09,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 20:30:09,422 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-26 20:30:09,903 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 20:30:09,903 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-26 20:30:09,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:30:09 BoogieIcfgContainer [2019-11-26 20:30:09,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 20:30:09,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 20:30:09,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 20:30:09,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 20:30:09,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 08:30:08" (1/3) ... [2019-11-26 20:30:09,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a741635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 08:30:09, skipping insertion in model container [2019-11-26 20:30:09,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:30:09" (2/3) ... [2019-11-26 20:30:09,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a741635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 08:30:09, skipping insertion in model container [2019-11-26 20:30:09,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:30:09" (3/3) ... [2019-11-26 20:30:09,919 INFO L109 eAbstractionObserver]: Analyzing ICFG singleton.i [2019-11-26 20:30:09,930 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-26 20:30:09,931 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 20:30:09,943 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 20:30:09,944 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-26 20:30:09,985 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,986 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,986 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,986 WARN L315 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,987 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,987 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,988 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,988 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,989 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,989 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,990 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,990 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,990 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,991 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,991 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,991 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,992 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,992 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,992 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,993 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,994 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,994 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,994 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,995 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,995 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,995 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,996 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,996 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,996 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,997 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,997 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,997 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,998 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,998 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,998 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,999 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,999 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:09,999 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,000 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,000 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,000 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,001 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,001 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,001 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,002 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,002 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,002 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,002 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,003 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,003 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,003 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,004 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,004 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,004 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,005 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,005 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,005 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,006 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,006 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,006 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,007 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,007 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,007 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,008 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,008 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,008 WARN L315 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,009 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,009 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,009 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,009 WARN L315 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,010 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,010 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,010 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,011 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,011 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,011 WARN L315 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,012 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,012 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,012 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,013 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,013 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,013 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,014 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,014 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,014 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,015 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,015 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,015 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,016 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,016 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,016 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,017 WARN L315 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,017 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,017 WARN L315 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,018 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,018 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,018 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,019 WARN L315 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,019 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,019 WARN L315 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-26 20:30:10,280 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-11-26 20:30:10,297 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 20:30:10,297 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 20:30:10,297 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 20:30:10,297 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 20:30:10,298 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 20:30:10,298 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 20:30:10,298 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 20:30:10,298 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 20:30:10,317 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 172 places, 243 transitions [2019-11-26 20:30:15,502 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47313 states. [2019-11-26 20:30:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 47313 states. [2019-11-26 20:30:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 20:30:15,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:15,517 INFO L410 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] [2019-11-26 20:30:15,517 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:15,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:15,522 INFO L82 PathProgramCache]: Analyzing trace with hash -386252412, now seen corresponding path program 1 times [2019-11-26 20:30:15,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:15,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890198556] [2019-11-26 20:30:15,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:15,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890198556] [2019-11-26 20:30:15,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:15,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 20:30:15,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497099937] [2019-11-26 20:30:15,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 20:30:15,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:15,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 20:30:15,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:30:15,938 INFO L87 Difference]: Start difference. First operand 47313 states. Second operand 5 states. [2019-11-26 20:30:17,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:17,052 INFO L93 Difference]: Finished difference Result 53971 states and 232572 transitions. [2019-11-26 20:30:17,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 20:30:17,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-26 20:30:17,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:17,865 INFO L225 Difference]: With dead ends: 53971 [2019-11-26 20:30:17,865 INFO L226 Difference]: Without dead ends: 38046 [2019-11-26 20:30:17,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:30:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38046 states. [2019-11-26 20:30:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38046 to 31407. [2019-11-26 20:30:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31407 states. [2019-11-26 20:30:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31407 states to 31407 states and 135821 transitions. [2019-11-26 20:30:19,599 INFO L78 Accepts]: Start accepts. Automaton has 31407 states and 135821 transitions. Word has length 32 [2019-11-26 20:30:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:19,600 INFO L462 AbstractCegarLoop]: Abstraction has 31407 states and 135821 transitions. [2019-11-26 20:30:19,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 20:30:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 31407 states and 135821 transitions. [2019-11-26 20:30:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 20:30:19,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:19,608 INFO L410 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] [2019-11-26 20:30:19,609 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:19,610 INFO L82 PathProgramCache]: Analyzing trace with hash -759214558, now seen corresponding path program 2 times [2019-11-26 20:30:19,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:19,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867518944] [2019-11-26 20:30:19,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:19,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867518944] [2019-11-26 20:30:19,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:19,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 20:30:19,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199992017] [2019-11-26 20:30:19,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 20:30:19,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:19,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 20:30:19,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:30:19,840 INFO L87 Difference]: Start difference. First operand 31407 states and 135821 transitions. Second operand 8 states. [2019-11-26 20:30:21,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:21,364 INFO L93 Difference]: Finished difference Result 38064 states and 167102 transitions. [2019-11-26 20:30:21,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:30:21,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-11-26 20:30:21,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:21,572 INFO L225 Difference]: With dead ends: 38064 [2019-11-26 20:30:21,572 INFO L226 Difference]: Without dead ends: 38064 [2019-11-26 20:30:21,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:30:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38064 states. [2019-11-26 20:30:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38064 to 31407. [2019-11-26 20:30:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31407 states. [2019-11-26 20:30:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31407 states to 31407 states and 135821 transitions. [2019-11-26 20:30:22,789 INFO L78 Accepts]: Start accepts. Automaton has 31407 states and 135821 transitions. Word has length 32 [2019-11-26 20:30:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:22,790 INFO L462 AbstractCegarLoop]: Abstraction has 31407 states and 135821 transitions. [2019-11-26 20:30:22,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 20:30:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 31407 states and 135821 transitions. [2019-11-26 20:30:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 20:30:22,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:22,792 INFO L410 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] [2019-11-26 20:30:22,793 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:22,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:22,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1996224320, now seen corresponding path program 3 times [2019-11-26 20:30:22,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:22,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897726783] [2019-11-26 20:30:22,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:22,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897726783] [2019-11-26 20:30:22,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:22,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 20:30:22,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131072788] [2019-11-26 20:30:22,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 20:30:22,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:22,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 20:30:22,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:30:22,903 INFO L87 Difference]: Start difference. First operand 31407 states and 135821 transitions. Second operand 8 states. [2019-11-26 20:30:24,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:24,178 INFO L93 Difference]: Finished difference Result 44677 states and 198309 transitions. [2019-11-26 20:30:24,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 20:30:24,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-11-26 20:30:24,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:24,402 INFO L225 Difference]: With dead ends: 44677 [2019-11-26 20:30:24,402 INFO L226 Difference]: Without dead ends: 44677 [2019-11-26 20:30:24,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-26 20:30:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44677 states. [2019-11-26 20:30:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44677 to 31364. [2019-11-26 20:30:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31364 states. [2019-11-26 20:30:25,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31364 states to 31364 states and 135748 transitions. [2019-11-26 20:30:25,566 INFO L78 Accepts]: Start accepts. Automaton has 31364 states and 135748 transitions. Word has length 32 [2019-11-26 20:30:25,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:25,566 INFO L462 AbstractCegarLoop]: Abstraction has 31364 states and 135748 transitions. [2019-11-26 20:30:25,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 20:30:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand 31364 states and 135748 transitions. [2019-11-26 20:30:25,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-26 20:30:25,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:25,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:25,573 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:25,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:25,573 INFO L82 PathProgramCache]: Analyzing trace with hash -573780194, now seen corresponding path program 1 times [2019-11-26 20:30:25,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:25,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548331252] [2019-11-26 20:30:25,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:25,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548331252] [2019-11-26 20:30:25,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:25,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 20:30:25,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722685024] [2019-11-26 20:30:25,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 20:30:25,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:25,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 20:30:25,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:30:25,656 INFO L87 Difference]: Start difference. First operand 31364 states and 135748 transitions. Second operand 5 states. [2019-11-26 20:30:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:25,993 INFO L93 Difference]: Finished difference Result 37554 states and 163555 transitions. [2019-11-26 20:30:25,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 20:30:25,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-26 20:30:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:26,254 INFO L225 Difference]: With dead ends: 37554 [2019-11-26 20:30:26,255 INFO L226 Difference]: Without dead ends: 37554 [2019-11-26 20:30:26,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:30:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37554 states. [2019-11-26 20:30:27,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37554 to 35091. [2019-11-26 20:30:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35091 states. [2019-11-26 20:30:27,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35091 states to 35091 states and 153592 transitions. [2019-11-26 20:30:27,708 INFO L78 Accepts]: Start accepts. Automaton has 35091 states and 153592 transitions. Word has length 42 [2019-11-26 20:30:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:27,708 INFO L462 AbstractCegarLoop]: Abstraction has 35091 states and 153592 transitions. [2019-11-26 20:30:27,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 20:30:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 35091 states and 153592 transitions. [2019-11-26 20:30:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-26 20:30:27,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:27,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:27,715 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:27,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:27,716 INFO L82 PathProgramCache]: Analyzing trace with hash 40373214, now seen corresponding path program 2 times [2019-11-26 20:30:27,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:27,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993146938] [2019-11-26 20:30:27,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:27,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993146938] [2019-11-26 20:30:27,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:27,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 20:30:27,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951321654] [2019-11-26 20:30:27,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:30:27,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:27,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:30:27,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:30:27,789 INFO L87 Difference]: Start difference. First operand 35091 states and 153592 transitions. Second operand 6 states. [2019-11-26 20:30:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:28,497 INFO L93 Difference]: Finished difference Result 74226 states and 316463 transitions. [2019-11-26 20:30:28,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:30:28,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-26 20:30:28,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:28,655 INFO L225 Difference]: With dead ends: 74226 [2019-11-26 20:30:28,655 INFO L226 Difference]: Without dead ends: 46039 [2019-11-26 20:30:28,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:30:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46039 states. [2019-11-26 20:30:29,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46039 to 35488. [2019-11-26 20:30:29,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35488 states. [2019-11-26 20:30:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35488 states to 35488 states and 149278 transitions. [2019-11-26 20:30:30,380 INFO L78 Accepts]: Start accepts. Automaton has 35488 states and 149278 transitions. Word has length 42 [2019-11-26 20:30:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:30,381 INFO L462 AbstractCegarLoop]: Abstraction has 35488 states and 149278 transitions. [2019-11-26 20:30:30,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:30:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 35488 states and 149278 transitions. [2019-11-26 20:30:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-26 20:30:30,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:30,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:30,397 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:30,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:30,398 INFO L82 PathProgramCache]: Analyzing trace with hash 210281631, now seen corresponding path program 1 times [2019-11-26 20:30:30,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:30,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232253682] [2019-11-26 20:30:30,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:30,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:30,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232253682] [2019-11-26 20:30:30,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:30,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 20:30:30,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910248116] [2019-11-26 20:30:30,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 20:30:30,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:30,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 20:30:30,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:30:30,511 INFO L87 Difference]: Start difference. First operand 35488 states and 149278 transitions. Second operand 8 states. [2019-11-26 20:30:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:31,006 INFO L93 Difference]: Finished difference Result 42306 states and 178056 transitions. [2019-11-26 20:30:31,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:30:31,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-11-26 20:30:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:31,123 INFO L225 Difference]: With dead ends: 42306 [2019-11-26 20:30:31,123 INFO L226 Difference]: Without dead ends: 42234 [2019-11-26 20:30:31,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:30:31,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42234 states. [2019-11-26 20:30:31,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42234 to 35467. [2019-11-26 20:30:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35467 states. [2019-11-26 20:30:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35467 states to 35467 states and 149246 transitions. [2019-11-26 20:30:31,874 INFO L78 Accepts]: Start accepts. Automaton has 35467 states and 149246 transitions. Word has length 44 [2019-11-26 20:30:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:31,874 INFO L462 AbstractCegarLoop]: Abstraction has 35467 states and 149246 transitions. [2019-11-26 20:30:31,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 20:30:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 35467 states and 149246 transitions. [2019-11-26 20:30:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-26 20:30:31,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:31,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:31,886 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:31,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:31,887 INFO L82 PathProgramCache]: Analyzing trace with hash 819066901, now seen corresponding path program 2 times [2019-11-26 20:30:31,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:31,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50170904] [2019-11-26 20:30:31,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:32,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50170904] [2019-11-26 20:30:32,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:32,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 20:30:32,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166875879] [2019-11-26 20:30:32,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 20:30:32,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:32,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 20:30:32,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:30:32,022 INFO L87 Difference]: Start difference. First operand 35467 states and 149246 transitions. Second operand 10 states. [2019-11-26 20:30:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:32,706 INFO L93 Difference]: Finished difference Result 49949 states and 204488 transitions. [2019-11-26 20:30:32,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 20:30:32,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-11-26 20:30:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:32,819 INFO L225 Difference]: With dead ends: 49949 [2019-11-26 20:30:32,819 INFO L226 Difference]: Without dead ends: 45133 [2019-11-26 20:30:32,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-11-26 20:30:33,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45133 states. [2019-11-26 20:30:33,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45133 to 35382. [2019-11-26 20:30:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35382 states. [2019-11-26 20:30:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35382 states to 35382 states and 148988 transitions. [2019-11-26 20:30:34,249 INFO L78 Accepts]: Start accepts. Automaton has 35382 states and 148988 transitions. Word has length 44 [2019-11-26 20:30:34,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:34,249 INFO L462 AbstractCegarLoop]: Abstraction has 35382 states and 148988 transitions. [2019-11-26 20:30:34,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 20:30:34,250 INFO L276 IsEmpty]: Start isEmpty. Operand 35382 states and 148988 transitions. [2019-11-26 20:30:34,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 20:30:34,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:34,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:34,261 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:34,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:34,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1040550282, now seen corresponding path program 1 times [2019-11-26 20:30:34,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:34,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008554187] [2019-11-26 20:30:34,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:34,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008554187] [2019-11-26 20:30:34,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:34,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 20:30:34,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915584766] [2019-11-26 20:30:34,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 20:30:34,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:34,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 20:30:34,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:30:34,325 INFO L87 Difference]: Start difference. First operand 35382 states and 148988 transitions. Second operand 5 states. [2019-11-26 20:30:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:34,719 INFO L93 Difference]: Finished difference Result 41393 states and 173198 transitions. [2019-11-26 20:30:34,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 20:30:34,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-26 20:30:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:34,843 INFO L225 Difference]: With dead ends: 41393 [2019-11-26 20:30:34,843 INFO L226 Difference]: Without dead ends: 40913 [2019-11-26 20:30:34,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:30:35,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40913 states. [2019-11-26 20:30:35,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40913 to 38965. [2019-11-26 20:30:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38965 states. [2019-11-26 20:30:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38965 states to 38965 states and 164378 transitions. [2019-11-26 20:30:35,614 INFO L78 Accepts]: Start accepts. Automaton has 38965 states and 164378 transitions. Word has length 45 [2019-11-26 20:30:35,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:35,615 INFO L462 AbstractCegarLoop]: Abstraction has 38965 states and 164378 transitions. [2019-11-26 20:30:35,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 20:30:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 38965 states and 164378 transitions. [2019-11-26 20:30:35,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 20:30:35,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:35,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:35,628 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:35,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:35,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1357053514, now seen corresponding path program 2 times [2019-11-26 20:30:35,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:35,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474269160] [2019-11-26 20:30:35,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:35,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474269160] [2019-11-26 20:30:35,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:35,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 20:30:35,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757019428] [2019-11-26 20:30:35,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 20:30:35,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:35,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 20:30:35,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:30:35,773 INFO L87 Difference]: Start difference. First operand 38965 states and 164378 transitions. Second operand 8 states. [2019-11-26 20:30:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:36,291 INFO L93 Difference]: Finished difference Result 41852 states and 174248 transitions. [2019-11-26 20:30:36,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:30:36,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-26 20:30:36,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:36,392 INFO L225 Difference]: With dead ends: 41852 [2019-11-26 20:30:36,392 INFO L226 Difference]: Without dead ends: 41372 [2019-11-26 20:30:36,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:30:36,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41372 states. [2019-11-26 20:30:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41372 to 36093. [2019-11-26 20:30:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36093 states. [2019-11-26 20:30:37,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36093 states to 36093 states and 150964 transitions. [2019-11-26 20:30:37,805 INFO L78 Accepts]: Start accepts. Automaton has 36093 states and 150964 transitions. Word has length 45 [2019-11-26 20:30:37,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:37,805 INFO L462 AbstractCegarLoop]: Abstraction has 36093 states and 150964 transitions. [2019-11-26 20:30:37,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 20:30:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand 36093 states and 150964 transitions. [2019-11-26 20:30:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 20:30:37,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:37,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:37,817 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:37,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:37,818 INFO L82 PathProgramCache]: Analyzing trace with hash 335420672, now seen corresponding path program 3 times [2019-11-26 20:30:37,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:37,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607351303] [2019-11-26 20:30:37,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:38,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607351303] [2019-11-26 20:30:38,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:38,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 20:30:38,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369527506] [2019-11-26 20:30:38,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 20:30:38,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:38,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 20:30:38,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:30:38,053 INFO L87 Difference]: Start difference. First operand 36093 states and 150964 transitions. Second operand 10 states. [2019-11-26 20:30:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:39,012 INFO L93 Difference]: Finished difference Result 42962 states and 180318 transitions. [2019-11-26 20:30:39,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 20:30:39,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-11-26 20:30:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:39,118 INFO L225 Difference]: With dead ends: 42962 [2019-11-26 20:30:39,119 INFO L226 Difference]: Without dead ends: 42716 [2019-11-26 20:30:39,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-11-26 20:30:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42716 states. [2019-11-26 20:30:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42716 to 39089. [2019-11-26 20:30:39,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39089 states. [2019-11-26 20:30:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39089 states to 39089 states and 165489 transitions. [2019-11-26 20:30:39,914 INFO L78 Accepts]: Start accepts. Automaton has 39089 states and 165489 transitions. Word has length 45 [2019-11-26 20:30:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:39,914 INFO L462 AbstractCegarLoop]: Abstraction has 39089 states and 165489 transitions. [2019-11-26 20:30:39,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 20:30:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 39089 states and 165489 transitions. [2019-11-26 20:30:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 20:30:39,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:39,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:39,928 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:39,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:39,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1972664708, now seen corresponding path program 4 times [2019-11-26 20:30:39,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:39,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27313156] [2019-11-26 20:30:39,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:40,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27313156] [2019-11-26 20:30:40,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:40,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-26 20:30:40,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016298426] [2019-11-26 20:30:40,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 20:30:40,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:40,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 20:30:40,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:30:40,095 INFO L87 Difference]: Start difference. First operand 39089 states and 165489 transitions. Second operand 12 states. [2019-11-26 20:30:40,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:40,748 INFO L93 Difference]: Finished difference Result 53313 states and 227626 transitions. [2019-11-26 20:30:40,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-26 20:30:40,748 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-11-26 20:30:40,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:40,885 INFO L225 Difference]: With dead ends: 53313 [2019-11-26 20:30:40,885 INFO L226 Difference]: Without dead ends: 53067 [2019-11-26 20:30:40,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-11-26 20:30:41,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53067 states. [2019-11-26 20:30:41,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53067 to 39087. [2019-11-26 20:30:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39087 states. [2019-11-26 20:30:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39087 states to 39087 states and 165485 transitions. [2019-11-26 20:30:41,798 INFO L78 Accepts]: Start accepts. Automaton has 39087 states and 165485 transitions. Word has length 45 [2019-11-26 20:30:41,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:41,798 INFO L462 AbstractCegarLoop]: Abstraction has 39087 states and 165485 transitions. [2019-11-26 20:30:41,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 20:30:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 39087 states and 165485 transitions. [2019-11-26 20:30:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 20:30:41,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:41,812 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:41,812 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:41,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:41,812 INFO L82 PathProgramCache]: Analyzing trace with hash -237289220, now seen corresponding path program 5 times [2019-11-26 20:30:41,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:41,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496546368] [2019-11-26 20:30:41,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:42,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496546368] [2019-11-26 20:30:42,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:42,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-26 20:30:42,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156840319] [2019-11-26 20:30:42,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 20:30:42,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:42,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 20:30:42,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-11-26 20:30:42,169 INFO L87 Difference]: Start difference. First operand 39087 states and 165485 transitions. Second operand 15 states. [2019-11-26 20:30:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:43,593 INFO L93 Difference]: Finished difference Result 45916 states and 194740 transitions. [2019-11-26 20:30:43,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-26 20:30:43,593 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2019-11-26 20:30:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:43,706 INFO L225 Difference]: With dead ends: 45916 [2019-11-26 20:30:43,706 INFO L226 Difference]: Without dead ends: 45670 [2019-11-26 20:30:43,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-11-26 20:30:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45670 states. [2019-11-26 20:30:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45670 to 39029. [2019-11-26 20:30:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39029 states. [2019-11-26 20:30:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39029 states to 39029 states and 165325 transitions. [2019-11-26 20:30:44,966 INFO L78 Accepts]: Start accepts. Automaton has 39029 states and 165325 transitions. Word has length 45 [2019-11-26 20:30:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:44,967 INFO L462 AbstractCegarLoop]: Abstraction has 39029 states and 165325 transitions. [2019-11-26 20:30:44,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 20:30:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 39029 states and 165325 transitions. [2019-11-26 20:30:44,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 20:30:44,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:44,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:44,989 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:44,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:44,989 INFO L82 PathProgramCache]: Analyzing trace with hash -237203330, now seen corresponding path program 1 times [2019-11-26 20:30:44,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:44,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233891129] [2019-11-26 20:30:44,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:45,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233891129] [2019-11-26 20:30:45,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:45,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 20:30:45,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158794188] [2019-11-26 20:30:45,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 20:30:45,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:45,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 20:30:45,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:30:45,125 INFO L87 Difference]: Start difference. First operand 39029 states and 165325 transitions. Second operand 10 states. [2019-11-26 20:30:45,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:45,682 INFO L93 Difference]: Finished difference Result 51611 states and 218018 transitions. [2019-11-26 20:30:45,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 20:30:45,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-11-26 20:30:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:45,811 INFO L225 Difference]: With dead ends: 51611 [2019-11-26 20:30:45,811 INFO L226 Difference]: Without dead ends: 51305 [2019-11-26 20:30:45,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-11-26 20:30:46,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51305 states. [2019-11-26 20:30:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51305 to 39028. [2019-11-26 20:30:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39028 states. [2019-11-26 20:30:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39028 states to 39028 states and 165324 transitions. [2019-11-26 20:30:46,670 INFO L78 Accepts]: Start accepts. Automaton has 39028 states and 165324 transitions. Word has length 47 [2019-11-26 20:30:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:46,670 INFO L462 AbstractCegarLoop]: Abstraction has 39028 states and 165324 transitions. [2019-11-26 20:30:46,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 20:30:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 39028 states and 165324 transitions. [2019-11-26 20:30:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 20:30:46,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:46,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:46,690 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:46,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:46,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1279105862, now seen corresponding path program 2 times [2019-11-26 20:30:46,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:46,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496316431] [2019-11-26 20:30:46,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:47,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496316431] [2019-11-26 20:30:47,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:47,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-26 20:30:47,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004664771] [2019-11-26 20:30:47,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 20:30:47,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:47,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 20:30:47,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:30:47,138 INFO L87 Difference]: Start difference. First operand 39028 states and 165324 transitions. Second operand 14 states. [2019-11-26 20:30:47,670 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-11-26 20:30:48,013 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-11-26 20:30:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:48,742 INFO L93 Difference]: Finished difference Result 44937 states and 188326 transitions. [2019-11-26 20:30:48,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-26 20:30:48,742 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-11-26 20:30:48,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:48,852 INFO L225 Difference]: With dead ends: 44937 [2019-11-26 20:30:48,852 INFO L226 Difference]: Without dead ends: 44631 [2019-11-26 20:30:48,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2019-11-26 20:30:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44631 states. [2019-11-26 20:30:49,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44631 to 37958. [2019-11-26 20:30:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37958 states. [2019-11-26 20:30:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37958 states to 37958 states and 160183 transitions. [2019-11-26 20:30:50,309 INFO L78 Accepts]: Start accepts. Automaton has 37958 states and 160183 transitions. Word has length 47 [2019-11-26 20:30:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:50,310 INFO L462 AbstractCegarLoop]: Abstraction has 37958 states and 160183 transitions. [2019-11-26 20:30:50,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 20:30:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 37958 states and 160183 transitions. [2019-11-26 20:30:50,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 20:30:50,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:50,329 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:50,329 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:50,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:50,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1755610754, now seen corresponding path program 1 times [2019-11-26 20:30:50,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:50,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789618124] [2019-11-26 20:30:50,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:50,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789618124] [2019-11-26 20:30:50,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:50,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-26 20:30:50,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035429668] [2019-11-26 20:30:50,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 20:30:50,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:50,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 20:30:50,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:30:50,472 INFO L87 Difference]: Start difference. First operand 37958 states and 160183 transitions. Second operand 12 states. [2019-11-26 20:30:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:51,344 INFO L93 Difference]: Finished difference Result 54466 states and 223015 transitions. [2019-11-26 20:30:51,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 20:30:51,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-11-26 20:30:51,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:51,452 INFO L225 Difference]: With dead ends: 54466 [2019-11-26 20:30:51,452 INFO L226 Difference]: Without dead ends: 47822 [2019-11-26 20:30:51,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-11-26 20:30:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47822 states. [2019-11-26 20:30:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47822 to 37752. [2019-11-26 20:30:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37752 states. [2019-11-26 20:30:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37752 states to 37752 states and 159365 transitions. [2019-11-26 20:30:52,233 INFO L78 Accepts]: Start accepts. Automaton has 37752 states and 159365 transitions. Word has length 47 [2019-11-26 20:30:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:52,233 INFO L462 AbstractCegarLoop]: Abstraction has 37752 states and 159365 transitions. [2019-11-26 20:30:52,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 20:30:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 37752 states and 159365 transitions. [2019-11-26 20:30:52,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 20:30:52,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:52,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:52,248 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:52,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:52,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1197832933, now seen corresponding path program 1 times [2019-11-26 20:30:52,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:52,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414791224] [2019-11-26 20:30:52,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:52,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:52,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414791224] [2019-11-26 20:30:52,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:52,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-26 20:30:52,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197119746] [2019-11-26 20:30:52,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 20:30:52,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:52,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 20:30:52,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:30:52,648 INFO L87 Difference]: Start difference. First operand 37752 states and 159365 transitions. Second operand 14 states. [2019-11-26 20:30:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:54,083 INFO L93 Difference]: Finished difference Result 48404 states and 202537 transitions. [2019-11-26 20:30:54,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 20:30:54,084 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-11-26 20:30:54,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:54,201 INFO L225 Difference]: With dead ends: 48404 [2019-11-26 20:30:54,202 INFO L226 Difference]: Without dead ends: 48098 [2019-11-26 20:30:54,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2019-11-26 20:30:54,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48098 states. [2019-11-26 20:30:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48098 to 37743. [2019-11-26 20:30:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37743 states. [2019-11-26 20:30:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37743 states to 37743 states and 159350 transitions. [2019-11-26 20:30:55,045 INFO L78 Accepts]: Start accepts. Automaton has 37743 states and 159350 transitions. Word has length 47 [2019-11-26 20:30:55,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:55,046 INFO L462 AbstractCegarLoop]: Abstraction has 37743 states and 159350 transitions. [2019-11-26 20:30:55,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 20:30:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 37743 states and 159350 transitions. [2019-11-26 20:30:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 20:30:55,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:55,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:55,062 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:55,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:55,063 INFO L82 PathProgramCache]: Analyzing trace with hash -53538853, now seen corresponding path program 2 times [2019-11-26 20:30:55,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:55,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785693772] [2019-11-26 20:30:55,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:55,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785693772] [2019-11-26 20:30:55,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:55,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-26 20:30:55,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144719402] [2019-11-26 20:30:55,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 20:30:55,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:55,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 20:30:55,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:30:55,435 INFO L87 Difference]: Start difference. First operand 37743 states and 159350 transitions. Second operand 14 states. [2019-11-26 20:30:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:30:56,567 INFO L93 Difference]: Finished difference Result 43702 states and 182857 transitions. [2019-11-26 20:30:56,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 20:30:56,568 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-11-26 20:30:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:30:56,746 INFO L225 Difference]: With dead ends: 43702 [2019-11-26 20:30:56,746 INFO L226 Difference]: Without dead ends: 43396 [2019-11-26 20:30:56,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-11-26 20:30:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43396 states. [2019-11-26 20:30:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43396 to 35601. [2019-11-26 20:30:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35601 states. [2019-11-26 20:30:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35601 states to 35601 states and 149339 transitions. [2019-11-26 20:30:57,703 INFO L78 Accepts]: Start accepts. Automaton has 35601 states and 149339 transitions. Word has length 47 [2019-11-26 20:30:57,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:30:57,703 INFO L462 AbstractCegarLoop]: Abstraction has 35601 states and 149339 transitions. [2019-11-26 20:30:57,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 20:30:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 35601 states and 149339 transitions. [2019-11-26 20:30:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 20:30:57,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:30:57,717 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:30:57,717 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:30:57,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:30:57,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2013384893, now seen corresponding path program 1 times [2019-11-26 20:30:57,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:30:57,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007806605] [2019-11-26 20:30:57,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:30:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:30:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:30:58,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007806605] [2019-11-26 20:30:58,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:30:58,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-26 20:30:58,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361331101] [2019-11-26 20:30:58,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-26 20:30:58,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:30:58,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-26 20:30:58,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-26 20:30:58,200 INFO L87 Difference]: Start difference. First operand 35601 states and 149339 transitions. Second operand 16 states. [2019-11-26 20:30:59,178 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-11-26 20:31:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:00,277 INFO L93 Difference]: Finished difference Result 45102 states and 190564 transitions. [2019-11-26 20:31:00,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-26 20:31:00,277 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2019-11-26 20:31:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:00,397 INFO L225 Difference]: With dead ends: 45102 [2019-11-26 20:31:00,397 INFO L226 Difference]: Without dead ends: 44856 [2019-11-26 20:31:00,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2019-11-26 20:31:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44856 states. [2019-11-26 20:31:01,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44856 to 37548. [2019-11-26 20:31:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37548 states. [2019-11-26 20:31:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37548 states to 37548 states and 159873 transitions. [2019-11-26 20:31:01,190 INFO L78 Accepts]: Start accepts. Automaton has 37548 states and 159873 transitions. Word has length 47 [2019-11-26 20:31:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:01,191 INFO L462 AbstractCegarLoop]: Abstraction has 37548 states and 159873 transitions. [2019-11-26 20:31:01,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-26 20:31:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 37548 states and 159873 transitions. [2019-11-26 20:31:01,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 20:31:01,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:01,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:01,213 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:01,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:01,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1496907519, now seen corresponding path program 1 times [2019-11-26 20:31:01,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:01,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555402960] [2019-11-26 20:31:01,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:01,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555402960] [2019-11-26 20:31:01,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:01,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-26 20:31:01,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434829503] [2019-11-26 20:31:01,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-26 20:31:01,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:01,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-26 20:31:01,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-26 20:31:01,765 INFO L87 Difference]: Start difference. First operand 37548 states and 159873 transitions. Second operand 16 states. [2019-11-26 20:31:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:03,426 INFO L93 Difference]: Finished difference Result 42944 states and 180663 transitions. [2019-11-26 20:31:03,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-26 20:31:03,427 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2019-11-26 20:31:03,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:03,591 INFO L225 Difference]: With dead ends: 42944 [2019-11-26 20:31:03,592 INFO L226 Difference]: Without dead ends: 42638 [2019-11-26 20:31:03,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2019-11-26 20:31:03,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42638 states. [2019-11-26 20:31:04,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42638 to 34161. [2019-11-26 20:31:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34161 states. [2019-11-26 20:31:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34161 states to 34161 states and 144013 transitions. [2019-11-26 20:31:04,370 INFO L78 Accepts]: Start accepts. Automaton has 34161 states and 144013 transitions. Word has length 49 [2019-11-26 20:31:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:04,370 INFO L462 AbstractCegarLoop]: Abstraction has 34161 states and 144013 transitions. [2019-11-26 20:31:04,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-26 20:31:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 34161 states and 144013 transitions. [2019-11-26 20:31:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 20:31:04,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:04,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:04,399 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:04,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:04,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1847573331, now seen corresponding path program 1 times [2019-11-26 20:31:04,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:04,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384283545] [2019-11-26 20:31:04,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:04,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384283545] [2019-11-26 20:31:04,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:04,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 20:31:04,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779589173] [2019-11-26 20:31:04,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 20:31:04,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:04,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 20:31:04,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:31:04,447 INFO L87 Difference]: Start difference. First operand 34161 states and 144013 transitions. Second operand 5 states. [2019-11-26 20:31:04,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:04,704 INFO L93 Difference]: Finished difference Result 38902 states and 161891 transitions. [2019-11-26 20:31:04,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 20:31:04,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-26 20:31:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:04,797 INFO L225 Difference]: With dead ends: 38902 [2019-11-26 20:31:04,797 INFO L226 Difference]: Without dead ends: 38068 [2019-11-26 20:31:04,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:31:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38068 states. [2019-11-26 20:31:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38068 to 36250. [2019-11-26 20:31:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36250 states. [2019-11-26 20:31:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36250 states to 36250 states and 152433 transitions. [2019-11-26 20:31:05,504 INFO L78 Accepts]: Start accepts. Automaton has 36250 states and 152433 transitions. Word has length 50 [2019-11-26 20:31:05,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:05,504 INFO L462 AbstractCegarLoop]: Abstraction has 36250 states and 152433 transitions. [2019-11-26 20:31:05,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 20:31:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 36250 states and 152433 transitions. [2019-11-26 20:31:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 20:31:05,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:05,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:05,533 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:05,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:05,534 INFO L82 PathProgramCache]: Analyzing trace with hash 85080083, now seen corresponding path program 2 times [2019-11-26 20:31:05,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:05,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568047463] [2019-11-26 20:31:05,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:05,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568047463] [2019-11-26 20:31:05,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:05,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 20:31:05,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496572761] [2019-11-26 20:31:05,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 20:31:05,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:05,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 20:31:05,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:31:05,613 INFO L87 Difference]: Start difference. First operand 36250 states and 152433 transitions. Second operand 8 states. [2019-11-26 20:31:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:06,192 INFO L93 Difference]: Finished difference Result 40970 states and 170279 transitions. [2019-11-26 20:31:06,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:31:06,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-26 20:31:06,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:06,289 INFO L225 Difference]: With dead ends: 40970 [2019-11-26 20:31:06,289 INFO L226 Difference]: Without dead ends: 40136 [2019-11-26 20:31:06,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:31:06,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40136 states. [2019-11-26 20:31:07,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40136 to 36229. [2019-11-26 20:31:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36229 states. [2019-11-26 20:31:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36229 states to 36229 states and 152401 transitions. [2019-11-26 20:31:07,377 INFO L78 Accepts]: Start accepts. Automaton has 36229 states and 152401 transitions. Word has length 50 [2019-11-26 20:31:07,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:07,378 INFO L462 AbstractCegarLoop]: Abstraction has 36229 states and 152401 transitions. [2019-11-26 20:31:07,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 20:31:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 36229 states and 152401 transitions. [2019-11-26 20:31:07,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 20:31:07,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:07,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:07,401 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:07,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:07,402 INFO L82 PathProgramCache]: Analyzing trace with hash 368089865, now seen corresponding path program 3 times [2019-11-26 20:31:07,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:07,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805380704] [2019-11-26 20:31:07,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:07,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805380704] [2019-11-26 20:31:07,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:07,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 20:31:07,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618224953] [2019-11-26 20:31:07,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 20:31:07,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:07,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 20:31:07,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:31:07,560 INFO L87 Difference]: Start difference. First operand 36229 states and 152401 transitions. Second operand 10 states. [2019-11-26 20:31:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:08,306 INFO L93 Difference]: Finished difference Result 40944 states and 170238 transitions. [2019-11-26 20:31:08,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 20:31:08,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-11-26 20:31:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:08,411 INFO L225 Difference]: With dead ends: 40944 [2019-11-26 20:31:08,411 INFO L226 Difference]: Without dead ends: 40110 [2019-11-26 20:31:08,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-11-26 20:31:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40110 states. [2019-11-26 20:31:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40110 to 36224. [2019-11-26 20:31:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36224 states. [2019-11-26 20:31:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36224 states to 36224 states and 152392 transitions. [2019-11-26 20:31:09,143 INFO L78 Accepts]: Start accepts. Automaton has 36224 states and 152392 transitions. Word has length 50 [2019-11-26 20:31:09,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:09,144 INFO L462 AbstractCegarLoop]: Abstraction has 36224 states and 152392 transitions. [2019-11-26 20:31:09,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 20:31:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 36224 states and 152392 transitions. [2019-11-26 20:31:09,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 20:31:09,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:09,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:09,176 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:09,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:09,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1194704651, now seen corresponding path program 1 times [2019-11-26 20:31:09,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:09,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216799811] [2019-11-26 20:31:09,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:09,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216799811] [2019-11-26 20:31:09,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:09,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-26 20:31:09,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932929041] [2019-11-26 20:31:09,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 20:31:09,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:09,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 20:31:09,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:31:09,354 INFO L87 Difference]: Start difference. First operand 36224 states and 152392 transitions. Second operand 14 states. [2019-11-26 20:31:10,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:10,241 INFO L93 Difference]: Finished difference Result 55813 states and 227527 transitions. [2019-11-26 20:31:10,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-26 20:31:10,242 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2019-11-26 20:31:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:10,335 INFO L225 Difference]: With dead ends: 55813 [2019-11-26 20:31:10,335 INFO L226 Difference]: Without dead ends: 41645 [2019-11-26 20:31:10,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2019-11-26 20:31:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41645 states. [2019-11-26 20:31:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41645 to 31645. [2019-11-26 20:31:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31645 states. [2019-11-26 20:31:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31645 states to 31645 states and 132063 transitions. [2019-11-26 20:31:11,007 INFO L78 Accepts]: Start accepts. Automaton has 31645 states and 132063 transitions. Word has length 50 [2019-11-26 20:31:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:11,007 INFO L462 AbstractCegarLoop]: Abstraction has 31645 states and 132063 transitions. [2019-11-26 20:31:11,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 20:31:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 31645 states and 132063 transitions. [2019-11-26 20:31:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 20:31:11,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:11,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:11,028 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:11,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:11,028 INFO L82 PathProgramCache]: Analyzing trace with hash 557019397, now seen corresponding path program 4 times [2019-11-26 20:31:11,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:11,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204725026] [2019-11-26 20:31:11,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:11,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204725026] [2019-11-26 20:31:11,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:11,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-26 20:31:11,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12941380] [2019-11-26 20:31:11,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 20:31:11,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:11,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 20:31:11,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:31:11,263 INFO L87 Difference]: Start difference. First operand 31645 states and 132063 transitions. Second operand 12 states. [2019-11-26 20:31:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:11,980 INFO L93 Difference]: Finished difference Result 35903 states and 148202 transitions. [2019-11-26 20:31:11,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-26 20:31:11,980 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-11-26 20:31:11,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:12,057 INFO L225 Difference]: With dead ends: 35903 [2019-11-26 20:31:12,058 INFO L226 Difference]: Without dead ends: 35264 [2019-11-26 20:31:12,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-11-26 20:31:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35264 states. [2019-11-26 20:31:12,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35264 to 31635. [2019-11-26 20:31:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31635 states. [2019-11-26 20:31:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31635 states to 31635 states and 132039 transitions. [2019-11-26 20:31:12,649 INFO L78 Accepts]: Start accepts. Automaton has 31635 states and 132039 transitions. Word has length 50 [2019-11-26 20:31:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:12,649 INFO L462 AbstractCegarLoop]: Abstraction has 31635 states and 132039 transitions. [2019-11-26 20:31:12,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 20:31:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 31635 states and 132039 transitions. [2019-11-26 20:31:12,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 20:31:12,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:12,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:12,668 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:12,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:12,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1504475862, now seen corresponding path program 1 times [2019-11-26 20:31:12,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:12,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462041581] [2019-11-26 20:31:12,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:13,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462041581] [2019-11-26 20:31:13,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:13,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-26 20:31:13,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943583732] [2019-11-26 20:31:13,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 20:31:13,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:13,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 20:31:13,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-11-26 20:31:13,466 INFO L87 Difference]: Start difference. First operand 31635 states and 132039 transitions. Second operand 18 states. [2019-11-26 20:31:14,223 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-11-26 20:31:14,573 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-11-26 20:31:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:16,236 INFO L93 Difference]: Finished difference Result 34237 states and 140880 transitions. [2019-11-26 20:31:16,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-26 20:31:16,237 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-11-26 20:31:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:16,324 INFO L225 Difference]: With dead ends: 34237 [2019-11-26 20:31:16,324 INFO L226 Difference]: Without dead ends: 33415 [2019-11-26 20:31:16,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2019-11-26 20:31:16,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33415 states. [2019-11-26 20:31:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33415 to 26641. [2019-11-26 20:31:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26641 states. [2019-11-26 20:31:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26641 states to 26641 states and 110388 transitions. [2019-11-26 20:31:16,854 INFO L78 Accepts]: Start accepts. Automaton has 26641 states and 110388 transitions. Word has length 50 [2019-11-26 20:31:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:16,854 INFO L462 AbstractCegarLoop]: Abstraction has 26641 states and 110388 transitions. [2019-11-26 20:31:16,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 20:31:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 26641 states and 110388 transitions. [2019-11-26 20:31:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 20:31:16,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:16,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:16,871 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:16,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:16,871 INFO L82 PathProgramCache]: Analyzing trace with hash 238485273, now seen corresponding path program 5 times [2019-11-26 20:31:16,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:16,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552335268] [2019-11-26 20:31:16,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:17,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552335268] [2019-11-26 20:31:17,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:17,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-26 20:31:17,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819492207] [2019-11-26 20:31:17,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-26 20:31:17,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:17,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-26 20:31:17,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-26 20:31:17,355 INFO L87 Difference]: Start difference. First operand 26641 states and 110388 transitions. Second operand 16 states. [2019-11-26 20:31:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:18,396 INFO L93 Difference]: Finished difference Result 30874 states and 126473 transitions. [2019-11-26 20:31:18,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 20:31:18,396 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-11-26 20:31:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:18,467 INFO L225 Difference]: With dead ends: 30874 [2019-11-26 20:31:18,467 INFO L226 Difference]: Without dead ends: 30235 [2019-11-26 20:31:18,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-11-26 20:31:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30235 states. [2019-11-26 20:31:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30235 to 26641. [2019-11-26 20:31:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26641 states. [2019-11-26 20:31:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26641 states to 26641 states and 110298 transitions. [2019-11-26 20:31:18,994 INFO L78 Accepts]: Start accepts. Automaton has 26641 states and 110298 transitions. Word has length 50 [2019-11-26 20:31:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:18,994 INFO L462 AbstractCegarLoop]: Abstraction has 26641 states and 110298 transitions. [2019-11-26 20:31:18,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-26 20:31:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 26641 states and 110298 transitions. [2019-11-26 20:31:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 20:31:19,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:19,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:19,012 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:19,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:19,012 INFO L82 PathProgramCache]: Analyzing trace with hash -467336723, now seen corresponding path program 6 times [2019-11-26 20:31:19,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:19,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814536546] [2019-11-26 20:31:19,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:19,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814536546] [2019-11-26 20:31:19,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:19,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-26 20:31:19,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981451512] [2019-11-26 20:31:19,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 20:31:19,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:19,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 20:31:19,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:31:19,221 INFO L87 Difference]: Start difference. First operand 26641 states and 110298 transitions. Second operand 14 states. [2019-11-26 20:31:20,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:20,080 INFO L93 Difference]: Finished difference Result 35760 states and 145343 transitions. [2019-11-26 20:31:20,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 20:31:20,081 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2019-11-26 20:31:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:20,170 INFO L225 Difference]: With dead ends: 35760 [2019-11-26 20:31:20,170 INFO L226 Difference]: Without dead ends: 35121 [2019-11-26 20:31:20,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2019-11-26 20:31:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35121 states. [2019-11-26 20:31:20,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35121 to 26069. [2019-11-26 20:31:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26069 states. [2019-11-26 20:31:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26069 states to 26069 states and 107734 transitions. [2019-11-26 20:31:20,739 INFO L78 Accepts]: Start accepts. Automaton has 26069 states and 107734 transitions. Word has length 50 [2019-11-26 20:31:20,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:20,739 INFO L462 AbstractCegarLoop]: Abstraction has 26069 states and 107734 transitions. [2019-11-26 20:31:20,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 20:31:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 26069 states and 107734 transitions. [2019-11-26 20:31:20,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 20:31:20,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:20,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:20,760 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:20,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:20,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1790589462, now seen corresponding path program 1 times [2019-11-26 20:31:20,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:20,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536433895] [2019-11-26 20:31:20,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:21,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536433895] [2019-11-26 20:31:21,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:21,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-26 20:31:21,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038060126] [2019-11-26 20:31:21,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 20:31:21,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:21,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 20:31:21,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-11-26 20:31:21,339 INFO L87 Difference]: Start difference. First operand 26069 states and 107734 transitions. Second operand 18 states. [2019-11-26 20:31:22,242 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-11-26 20:31:22,541 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-11-26 20:31:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:23,932 INFO L93 Difference]: Finished difference Result 26868 states and 109219 transitions. [2019-11-26 20:31:23,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-26 20:31:23,933 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-11-26 20:31:23,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:23,991 INFO L225 Difference]: With dead ends: 26868 [2019-11-26 20:31:23,991 INFO L226 Difference]: Without dead ends: 25824 [2019-11-26 20:31:23,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=338, Invalid=1144, Unknown=0, NotChecked=0, Total=1482 [2019-11-26 20:31:24,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25824 states. [2019-11-26 20:31:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25824 to 20400. [2019-11-26 20:31:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20400 states. [2019-11-26 20:31:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20400 states to 20400 states and 83216 transitions. [2019-11-26 20:31:24,400 INFO L78 Accepts]: Start accepts. Automaton has 20400 states and 83216 transitions. Word has length 52 [2019-11-26 20:31:24,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:24,400 INFO L462 AbstractCegarLoop]: Abstraction has 20400 states and 83216 transitions. [2019-11-26 20:31:24,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 20:31:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 20400 states and 83216 transitions. [2019-11-26 20:31:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 20:31:24,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:24,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:24,419 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:24,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:24,420 INFO L82 PathProgramCache]: Analyzing trace with hash 610346052, now seen corresponding path program 1 times [2019-11-26 20:31:24,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:24,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374000689] [2019-11-26 20:31:24,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:25,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374000689] [2019-11-26 20:31:25,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:25,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-26 20:31:25,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575339580] [2019-11-26 20:31:25,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 20:31:25,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:25,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 20:31:25,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:31:25,145 INFO L87 Difference]: Start difference. First operand 20400 states and 83216 transitions. Second operand 14 states. [2019-11-26 20:31:26,416 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-11-26 20:31:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:26,893 INFO L93 Difference]: Finished difference Result 25840 states and 104248 transitions. [2019-11-26 20:31:26,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 20:31:26,894 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-11-26 20:31:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:26,954 INFO L225 Difference]: With dead ends: 25840 [2019-11-26 20:31:26,954 INFO L226 Difference]: Without dead ends: 25471 [2019-11-26 20:31:26,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-11-26 20:31:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25471 states. [2019-11-26 20:31:27,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25471 to 20430. [2019-11-26 20:31:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20430 states. [2019-11-26 20:31:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20430 states to 20430 states and 83308 transitions. [2019-11-26 20:31:27,372 INFO L78 Accepts]: Start accepts. Automaton has 20430 states and 83308 transitions. Word has length 52 [2019-11-26 20:31:27,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:27,372 INFO L462 AbstractCegarLoop]: Abstraction has 20430 states and 83308 transitions. [2019-11-26 20:31:27,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 20:31:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand 20430 states and 83308 transitions. [2019-11-26 20:31:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 20:31:27,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:27,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:27,390 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:27,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:27,391 INFO L82 PathProgramCache]: Analyzing trace with hash -414010068, now seen corresponding path program 2 times [2019-11-26 20:31:27,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:27,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65153823] [2019-11-26 20:31:27,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:27,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65153823] [2019-11-26 20:31:27,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:27,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-26 20:31:27,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423624544] [2019-11-26 20:31:27,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-26 20:31:27,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:27,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-26 20:31:27,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-26 20:31:27,720 INFO L87 Difference]: Start difference. First operand 20430 states and 83308 transitions. Second operand 16 states. [2019-11-26 20:31:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:29,045 INFO L93 Difference]: Finished difference Result 27069 states and 108818 transitions. [2019-11-26 20:31:29,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 20:31:29,046 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2019-11-26 20:31:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:29,110 INFO L225 Difference]: With dead ends: 27069 [2019-11-26 20:31:29,110 INFO L226 Difference]: Without dead ends: 26700 [2019-11-26 20:31:29,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-11-26 20:31:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26700 states. [2019-11-26 20:31:29,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26700 to 20091. [2019-11-26 20:31:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20091 states. [2019-11-26 20:31:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20091 states to 20091 states and 82206 transitions. [2019-11-26 20:31:29,532 INFO L78 Accepts]: Start accepts. Automaton has 20091 states and 82206 transitions. Word has length 52 [2019-11-26 20:31:29,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:29,532 INFO L462 AbstractCegarLoop]: Abstraction has 20091 states and 82206 transitions. [2019-11-26 20:31:29,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-26 20:31:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 20091 states and 82206 transitions. [2019-11-26 20:31:29,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 20:31:29,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:29,550 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:29,551 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:29,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:29,551 INFO L82 PathProgramCache]: Analyzing trace with hash -650142920, now seen corresponding path program 1 times [2019-11-26 20:31:29,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:29,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118670798] [2019-11-26 20:31:29,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:30,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118670798] [2019-11-26 20:31:30,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:30,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-26 20:31:30,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412018467] [2019-11-26 20:31:30,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 20:31:30,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:30,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 20:31:30,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-11-26 20:31:30,145 INFO L87 Difference]: Start difference. First operand 20091 states and 82206 transitions. Second operand 18 states. [2019-11-26 20:31:30,800 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-11-26 20:31:30,971 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-11-26 20:31:31,158 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-11-26 20:31:31,321 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-11-26 20:31:31,444 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-11-26 20:31:31,576 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-11-26 20:31:31,742 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-11-26 20:31:32,479 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-11-26 20:31:32,704 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-11-26 20:31:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:33,288 INFO L93 Difference]: Finished difference Result 20593 states and 82993 transitions. [2019-11-26 20:31:33,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-26 20:31:33,289 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-11-26 20:31:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:33,332 INFO L225 Difference]: With dead ends: 20593 [2019-11-26 20:31:33,332 INFO L226 Difference]: Without dead ends: 18658 [2019-11-26 20:31:33,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=383, Invalid=1257, Unknown=0, NotChecked=0, Total=1640 [2019-11-26 20:31:33,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18658 states. [2019-11-26 20:31:33,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18658 to 12962. [2019-11-26 20:31:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12962 states. [2019-11-26 20:31:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 52687 transitions. [2019-11-26 20:31:33,618 INFO L78 Accepts]: Start accepts. Automaton has 12962 states and 52687 transitions. Word has length 52 [2019-11-26 20:31:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:33,619 INFO L462 AbstractCegarLoop]: Abstraction has 12962 states and 52687 transitions. [2019-11-26 20:31:33,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 20:31:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 12962 states and 52687 transitions. [2019-11-26 20:31:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 20:31:33,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:33,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:33,632 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1885292943, now seen corresponding path program 1 times [2019-11-26 20:31:33,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:33,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680928660] [2019-11-26 20:31:33,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:33,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680928660] [2019-11-26 20:31:33,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:33,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 20:31:33,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133987118] [2019-11-26 20:31:33,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 20:31:33,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:33,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 20:31:33,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:31:33,677 INFO L87 Difference]: Start difference. First operand 12962 states and 52687 transitions. Second operand 5 states. [2019-11-26 20:31:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:33,941 INFO L93 Difference]: Finished difference Result 15975 states and 63018 transitions. [2019-11-26 20:31:33,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 20:31:33,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-26 20:31:33,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:34,004 INFO L225 Difference]: With dead ends: 15975 [2019-11-26 20:31:34,004 INFO L226 Difference]: Without dead ends: 15255 [2019-11-26 20:31:34,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:31:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15255 states. [2019-11-26 20:31:34,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15255 to 14835. [2019-11-26 20:31:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14835 states. [2019-11-26 20:31:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14835 states to 14835 states and 59421 transitions. [2019-11-26 20:31:34,429 INFO L78 Accepts]: Start accepts. Automaton has 14835 states and 59421 transitions. Word has length 53 [2019-11-26 20:31:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:34,429 INFO L462 AbstractCegarLoop]: Abstraction has 14835 states and 59421 transitions. [2019-11-26 20:31:34,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 20:31:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 14835 states and 59421 transitions. [2019-11-26 20:31:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 20:31:34,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:34,443 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:34,443 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:34,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:34,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1948516785, now seen corresponding path program 2 times [2019-11-26 20:31:34,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:34,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357601897] [2019-11-26 20:31:34,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:34,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357601897] [2019-11-26 20:31:34,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:34,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 20:31:34,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925654266] [2019-11-26 20:31:34,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 20:31:34,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:34,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 20:31:34,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:31:34,513 INFO L87 Difference]: Start difference. First operand 14835 states and 59421 transitions. Second operand 8 states. [2019-11-26 20:31:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:34,890 INFO L93 Difference]: Finished difference Result 17827 states and 69720 transitions. [2019-11-26 20:31:34,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:31:34,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-26 20:31:34,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:34,927 INFO L225 Difference]: With dead ends: 17827 [2019-11-26 20:31:34,927 INFO L226 Difference]: Without dead ends: 17107 [2019-11-26 20:31:34,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:31:34,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17107 states. [2019-11-26 20:31:35,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17107 to 14814. [2019-11-26 20:31:35,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14814 states. [2019-11-26 20:31:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14814 states to 14814 states and 59389 transitions. [2019-11-26 20:31:35,208 INFO L78 Accepts]: Start accepts. Automaton has 14814 states and 59389 transitions. Word has length 53 [2019-11-26 20:31:35,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:35,209 INFO L462 AbstractCegarLoop]: Abstraction has 14814 states and 59389 transitions. [2019-11-26 20:31:35,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 20:31:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand 14814 states and 59389 transitions. [2019-11-26 20:31:35,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 20:31:35,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:35,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:35,223 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:35,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:35,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2072130299, now seen corresponding path program 3 times [2019-11-26 20:31:35,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:35,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969198619] [2019-11-26 20:31:35,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:35,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969198619] [2019-11-26 20:31:35,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:35,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 20:31:35,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311270283] [2019-11-26 20:31:35,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 20:31:35,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:35,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 20:31:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:31:35,414 INFO L87 Difference]: Start difference. First operand 14814 states and 59389 transitions. Second operand 10 states. [2019-11-26 20:31:36,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:36,125 INFO L93 Difference]: Finished difference Result 17801 states and 69679 transitions. [2019-11-26 20:31:36,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 20:31:36,126 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-11-26 20:31:36,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:36,161 INFO L225 Difference]: With dead ends: 17801 [2019-11-26 20:31:36,161 INFO L226 Difference]: Without dead ends: 17081 [2019-11-26 20:31:36,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-11-26 20:31:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17081 states. [2019-11-26 20:31:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17081 to 14809. [2019-11-26 20:31:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14809 states. [2019-11-26 20:31:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 59380 transitions. [2019-11-26 20:31:36,433 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 59380 transitions. Word has length 53 [2019-11-26 20:31:36,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:36,433 INFO L462 AbstractCegarLoop]: Abstraction has 14809 states and 59380 transitions. [2019-11-26 20:31:36,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 20:31:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 59380 transitions. [2019-11-26 20:31:36,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 20:31:36,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:36,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:36,627 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:36,628 INFO L82 PathProgramCache]: Analyzing trace with hash -230306945, now seen corresponding path program 4 times [2019-11-26 20:31:36,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:36,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247395928] [2019-11-26 20:31:36,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:36,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247395928] [2019-11-26 20:31:36,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:36,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-26 20:31:36,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718444054] [2019-11-26 20:31:36,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 20:31:36,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:36,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 20:31:36,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:31:36,876 INFO L87 Difference]: Start difference. First operand 14809 states and 59380 transitions. Second operand 12 states. [2019-11-26 20:31:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:37,587 INFO L93 Difference]: Finished difference Result 17780 states and 69636 transitions. [2019-11-26 20:31:37,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-26 20:31:37,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-26 20:31:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:37,626 INFO L225 Difference]: With dead ends: 17780 [2019-11-26 20:31:37,626 INFO L226 Difference]: Without dead ends: 17060 [2019-11-26 20:31:37,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-11-26 20:31:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17060 states. [2019-11-26 20:31:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17060 to 14799. [2019-11-26 20:31:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14799 states. [2019-11-26 20:31:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14799 states to 14799 states and 59356 transitions. [2019-11-26 20:31:37,894 INFO L78 Accepts]: Start accepts. Automaton has 14799 states and 59356 transitions. Word has length 53 [2019-11-26 20:31:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:37,894 INFO L462 AbstractCegarLoop]: Abstraction has 14799 states and 59356 transitions. [2019-11-26 20:31:37,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 20:31:37,894 INFO L276 IsEmpty]: Start isEmpty. Operand 14799 states and 59356 transitions. [2019-11-26 20:31:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 20:31:37,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:37,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:37,908 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:37,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:37,908 INFO L82 PathProgramCache]: Analyzing trace with hash -149039827, now seen corresponding path program 5 times [2019-11-26 20:31:37,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:37,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225596544] [2019-11-26 20:31:37,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:38,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225596544] [2019-11-26 20:31:38,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:38,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-26 20:31:38,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459275461] [2019-11-26 20:31:38,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 20:31:38,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:38,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 20:31:38,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:31:38,292 INFO L87 Difference]: Start difference. First operand 14799 states and 59356 transitions. Second operand 14 states. [2019-11-26 20:31:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:39,279 INFO L93 Difference]: Finished difference Result 17735 states and 69515 transitions. [2019-11-26 20:31:39,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 20:31:39,279 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-11-26 20:31:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:39,316 INFO L225 Difference]: With dead ends: 17735 [2019-11-26 20:31:39,316 INFO L226 Difference]: Without dead ends: 17015 [2019-11-26 20:31:39,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2019-11-26 20:31:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17015 states. [2019-11-26 20:31:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17015 to 14779. [2019-11-26 20:31:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14779 states. [2019-11-26 20:31:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14779 states to 14779 states and 59290 transitions. [2019-11-26 20:31:39,602 INFO L78 Accepts]: Start accepts. Automaton has 14779 states and 59290 transitions. Word has length 53 [2019-11-26 20:31:39,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:39,603 INFO L462 AbstractCegarLoop]: Abstraction has 14779 states and 59290 transitions. [2019-11-26 20:31:39,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 20:31:39,603 INFO L276 IsEmpty]: Start isEmpty. Operand 14779 states and 59290 transitions. [2019-11-26 20:31:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 20:31:39,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:39,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:39,620 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:39,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:39,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1879007737, now seen corresponding path program 6 times [2019-11-26 20:31:39,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:39,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100805590] [2019-11-26 20:31:39,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:40,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100805590] [2019-11-26 20:31:40,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:40,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-26 20:31:40,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233864335] [2019-11-26 20:31:40,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-26 20:31:40,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:40,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-26 20:31:40,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-26 20:31:40,161 INFO L87 Difference]: Start difference. First operand 14779 states and 59290 transitions. Second operand 16 states. [2019-11-26 20:31:40,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:40,915 INFO L93 Difference]: Finished difference Result 17575 states and 69027 transitions. [2019-11-26 20:31:40,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 20:31:40,916 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-11-26 20:31:40,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:40,951 INFO L225 Difference]: With dead ends: 17575 [2019-11-26 20:31:40,952 INFO L226 Difference]: Without dead ends: 16855 [2019-11-26 20:31:40,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-11-26 20:31:41,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16855 states. [2019-11-26 20:31:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16855 to 14779. [2019-11-26 20:31:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14779 states. [2019-11-26 20:31:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14779 states to 14779 states and 59290 transitions. [2019-11-26 20:31:41,226 INFO L78 Accepts]: Start accepts. Automaton has 14779 states and 59290 transitions. Word has length 53 [2019-11-26 20:31:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:41,227 INFO L462 AbstractCegarLoop]: Abstraction has 14779 states and 59290 transitions. [2019-11-26 20:31:41,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-26 20:31:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 14779 states and 59290 transitions. [2019-11-26 20:31:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 20:31:41,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:41,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:41,242 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:41,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:41,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1567369699, now seen corresponding path program 7 times [2019-11-26 20:31:41,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:41,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847749048] [2019-11-26 20:31:41,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:41,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847749048] [2019-11-26 20:31:41,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:41,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-26 20:31:41,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23251967] [2019-11-26 20:31:41,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-26 20:31:41,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:41,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-26 20:31:41,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-26 20:31:41,726 INFO L87 Difference]: Start difference. First operand 14779 states and 59290 transitions. Second operand 19 states. [2019-11-26 20:31:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:44,137 INFO L93 Difference]: Finished difference Result 20719 states and 81367 transitions. [2019-11-26 20:31:44,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-26 20:31:44,139 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2019-11-26 20:31:44,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:44,179 INFO L225 Difference]: With dead ends: 20719 [2019-11-26 20:31:44,179 INFO L226 Difference]: Without dead ends: 18559 [2019-11-26 20:31:44,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=355, Invalid=1205, Unknown=0, NotChecked=0, Total=1560 [2019-11-26 20:31:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18559 states. [2019-11-26 20:31:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18559 to 14107. [2019-11-26 20:31:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14107 states. [2019-11-26 20:31:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14107 states to 14107 states and 56562 transitions. [2019-11-26 20:31:44,471 INFO L78 Accepts]: Start accepts. Automaton has 14107 states and 56562 transitions. Word has length 53 [2019-11-26 20:31:44,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:44,471 INFO L462 AbstractCegarLoop]: Abstraction has 14107 states and 56562 transitions. [2019-11-26 20:31:44,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-26 20:31:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 14107 states and 56562 transitions. [2019-11-26 20:31:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 20:31:44,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:44,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:44,486 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:44,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:44,486 INFO L82 PathProgramCache]: Analyzing trace with hash 692038795, now seen corresponding path program 8 times [2019-11-26 20:31:44,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:44,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086405183] [2019-11-26 20:31:44,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:44,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086405183] [2019-11-26 20:31:44,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:44,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-26 20:31:44,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634939670] [2019-11-26 20:31:44,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-26 20:31:44,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:44,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-26 20:31:44,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-26 20:31:44,904 INFO L87 Difference]: Start difference. First operand 14107 states and 56562 transitions. Second operand 16 states. [2019-11-26 20:31:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:45,794 INFO L93 Difference]: Finished difference Result 19933 states and 76843 transitions. [2019-11-26 20:31:45,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 20:31:45,795 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-11-26 20:31:45,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:45,834 INFO L225 Difference]: With dead ends: 19933 [2019-11-26 20:31:45,834 INFO L226 Difference]: Without dead ends: 19213 [2019-11-26 20:31:45,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=598, Unknown=0, NotChecked=0, Total=812 [2019-11-26 20:31:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19213 states. [2019-11-26 20:31:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19213 to 13403. [2019-11-26 20:31:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13403 states. [2019-11-26 20:31:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13403 states to 13403 states and 53710 transitions. [2019-11-26 20:31:46,094 INFO L78 Accepts]: Start accepts. Automaton has 13403 states and 53710 transitions. Word has length 53 [2019-11-26 20:31:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:46,094 INFO L462 AbstractCegarLoop]: Abstraction has 13403 states and 53710 transitions. [2019-11-26 20:31:46,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-26 20:31:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 13403 states and 53710 transitions. [2019-11-26 20:31:46,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-26 20:31:46,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:46,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:46,109 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:46,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:46,109 INFO L82 PathProgramCache]: Analyzing trace with hash -713827360, now seen corresponding path program 1 times [2019-11-26 20:31:46,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:46,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176609970] [2019-11-26 20:31:46,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:46,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176609970] [2019-11-26 20:31:46,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:46,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-26 20:31:46,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872778271] [2019-11-26 20:31:46,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 20:31:46,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:46,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 20:31:46,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:31:46,555 INFO L87 Difference]: Start difference. First operand 13403 states and 53710 transitions. Second operand 14 states. [2019-11-26 20:31:47,800 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-11-26 20:31:48,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:48,287 INFO L93 Difference]: Finished difference Result 17394 states and 67692 transitions. [2019-11-26 20:31:48,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 20:31:48,288 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-11-26 20:31:48,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:48,321 INFO L225 Difference]: With dead ends: 17394 [2019-11-26 20:31:48,321 INFO L226 Difference]: Without dead ends: 17106 [2019-11-26 20:31:48,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-11-26 20:31:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17106 states. [2019-11-26 20:31:48,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17106 to 13433. [2019-11-26 20:31:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13433 states. [2019-11-26 20:31:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13433 states to 13433 states and 53802 transitions. [2019-11-26 20:31:48,567 INFO L78 Accepts]: Start accepts. Automaton has 13433 states and 53802 transitions. Word has length 55 [2019-11-26 20:31:48,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:48,567 INFO L462 AbstractCegarLoop]: Abstraction has 13433 states and 53802 transitions. [2019-11-26 20:31:48,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 20:31:48,568 INFO L276 IsEmpty]: Start isEmpty. Operand 13433 states and 53802 transitions. [2019-11-26 20:31:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-26 20:31:48,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:48,582 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:48,582 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:48,583 INFO L82 PathProgramCache]: Analyzing trace with hash -632560242, now seen corresponding path program 2 times [2019-11-26 20:31:48,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:48,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696496687] [2019-11-26 20:31:48,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:49,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696496687] [2019-11-26 20:31:49,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:49,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-26 20:31:49,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069049073] [2019-11-26 20:31:49,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-26 20:31:49,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:49,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-26 20:31:49,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-26 20:31:49,051 INFO L87 Difference]: Start difference. First operand 13433 states and 53802 transitions. Second operand 16 states. [2019-11-26 20:31:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:50,803 INFO L93 Difference]: Finished difference Result 17713 states and 69001 transitions. [2019-11-26 20:31:50,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 20:31:50,803 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2019-11-26 20:31:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:50,838 INFO L225 Difference]: With dead ends: 17713 [2019-11-26 20:31:50,838 INFO L226 Difference]: Without dead ends: 17137 [2019-11-26 20:31:50,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=226, Invalid=766, Unknown=0, NotChecked=0, Total=992 [2019-11-26 20:31:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17137 states. [2019-11-26 20:31:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17137 to 13292. [2019-11-26 20:31:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13292 states. [2019-11-26 20:31:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13292 states to 13292 states and 53402 transitions. [2019-11-26 20:31:51,077 INFO L78 Accepts]: Start accepts. Automaton has 13292 states and 53402 transitions. Word has length 55 [2019-11-26 20:31:51,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:51,077 INFO L462 AbstractCegarLoop]: Abstraction has 13292 states and 53402 transitions. [2019-11-26 20:31:51,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-26 20:31:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 13292 states and 53402 transitions. [2019-11-26 20:31:51,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-26 20:31:51,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:51,091 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:51,091 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:51,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:51,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1395487322, now seen corresponding path program 3 times [2019-11-26 20:31:51,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:51,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266113274] [2019-11-26 20:31:51,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:51,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266113274] [2019-11-26 20:31:51,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:51,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-26 20:31:51,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965317636] [2019-11-26 20:31:51,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 20:31:51,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:51,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 20:31:51,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-26 20:31:51,514 INFO L87 Difference]: Start difference. First operand 13292 states and 53402 transitions. Second operand 18 states. [2019-11-26 20:31:52,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:52,907 INFO L93 Difference]: Finished difference Result 17480 states and 68319 transitions. [2019-11-26 20:31:52,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-26 20:31:52,908 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-11-26 20:31:52,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:52,941 INFO L225 Difference]: With dead ends: 17480 [2019-11-26 20:31:52,941 INFO L226 Difference]: Without dead ends: 16904 [2019-11-26 20:31:52,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=310, Invalid=950, Unknown=0, NotChecked=0, Total=1260 [2019-11-26 20:31:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16904 states. [2019-11-26 20:31:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16904 to 12524. [2019-11-26 20:31:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12524 states. [2019-11-26 20:31:53,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12524 states to 12524 states and 49818 transitions. [2019-11-26 20:31:53,167 INFO L78 Accepts]: Start accepts. Automaton has 12524 states and 49818 transitions. Word has length 55 [2019-11-26 20:31:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:53,167 INFO L462 AbstractCegarLoop]: Abstraction has 12524 states and 49818 transitions. [2019-11-26 20:31:53,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 20:31:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 12524 states and 49818 transitions. [2019-11-26 20:31:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-26 20:31:53,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:53,180 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:53,180 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:53,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:53,180 INFO L82 PathProgramCache]: Analyzing trace with hash 208518380, now seen corresponding path program 4 times [2019-11-26 20:31:53,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:53,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371105420] [2019-11-26 20:31:53,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:53,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371105420] [2019-11-26 20:31:53,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:53,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-26 20:31:53,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995070720] [2019-11-26 20:31:53,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 20:31:53,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:53,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 20:31:53,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-26 20:31:53,570 INFO L87 Difference]: Start difference. First operand 12524 states and 49818 transitions. Second operand 18 states. [2019-11-26 20:31:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:55,562 INFO L93 Difference]: Finished difference Result 11144 states and 43359 transitions. [2019-11-26 20:31:55,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-26 20:31:55,562 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-11-26 20:31:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:55,584 INFO L225 Difference]: With dead ends: 11144 [2019-11-26 20:31:55,584 INFO L226 Difference]: Without dead ends: 10568 [2019-11-26 20:31:55,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=520, Invalid=1736, Unknown=0, NotChecked=0, Total=2256 [2019-11-26 20:31:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10568 states. [2019-11-26 20:31:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10568 to 6914. [2019-11-26 20:31:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6914 states. [2019-11-26 20:31:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6914 states to 6914 states and 28315 transitions. [2019-11-26 20:31:55,725 INFO L78 Accepts]: Start accepts. Automaton has 6914 states and 28315 transitions. Word has length 55 [2019-11-26 20:31:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:55,725 INFO L462 AbstractCegarLoop]: Abstraction has 6914 states and 28315 transitions. [2019-11-26 20:31:55,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 20:31:55,726 INFO L276 IsEmpty]: Start isEmpty. Operand 6914 states and 28315 transitions. [2019-11-26 20:31:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 20:31:55,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:55,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:55,737 INFO L410 AbstractCegarLoop]: === Iteration 44 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:55,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:55,737 INFO L82 PathProgramCache]: Analyzing trace with hash -734287533, now seen corresponding path program 1 times [2019-11-26 20:31:55,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:55,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820805333] [2019-11-26 20:31:55,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:55,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820805333] [2019-11-26 20:31:55,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:55,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 20:31:55,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985307831] [2019-11-26 20:31:55,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 20:31:55,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:55,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 20:31:55,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:31:55,833 INFO L87 Difference]: Start difference. First operand 6914 states and 28315 transitions. Second operand 8 states. [2019-11-26 20:31:56,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:56,044 INFO L93 Difference]: Finished difference Result 6914 states and 28309 transitions. [2019-11-26 20:31:56,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:31:56,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-11-26 20:31:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:56,060 INFO L225 Difference]: With dead ends: 6914 [2019-11-26 20:31:56,061 INFO L226 Difference]: Without dead ends: 6887 [2019-11-26 20:31:56,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:31:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6887 states. [2019-11-26 20:31:56,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6887 to 6887. [2019-11-26 20:31:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6887 states. [2019-11-26 20:31:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6887 states to 6887 states and 28201 transitions. [2019-11-26 20:31:56,173 INFO L78 Accepts]: Start accepts. Automaton has 6887 states and 28201 transitions. Word has length 88 [2019-11-26 20:31:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:56,173 INFO L462 AbstractCegarLoop]: Abstraction has 6887 states and 28201 transitions. [2019-11-26 20:31:56,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 20:31:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 6887 states and 28201 transitions. [2019-11-26 20:31:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 20:31:56,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:56,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:56,184 INFO L410 AbstractCegarLoop]: === Iteration 45 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:56,184 INFO L82 PathProgramCache]: Analyzing trace with hash -812593641, now seen corresponding path program 1 times [2019-11-26 20:31:56,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:56,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582469871] [2019-11-26 20:31:56,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:56,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582469871] [2019-11-26 20:31:56,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:56,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-26 20:31:56,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097624229] [2019-11-26 20:31:56,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 20:31:56,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:56,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 20:31:56,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:31:56,680 INFO L87 Difference]: Start difference. First operand 6887 states and 28201 transitions. Second operand 14 states. [2019-11-26 20:31:57,227 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-11-26 20:31:57,462 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-11-26 20:31:57,646 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-11-26 20:31:57,986 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-11-26 20:31:58,775 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-11-26 20:31:58,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:58,916 INFO L93 Difference]: Finished difference Result 9443 states and 38056 transitions. [2019-11-26 20:31:58,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 20:31:58,917 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2019-11-26 20:31:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:58,937 INFO L225 Difference]: With dead ends: 9443 [2019-11-26 20:31:58,937 INFO L226 Difference]: Without dead ends: 9335 [2019-11-26 20:31:58,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=253, Invalid=559, Unknown=0, NotChecked=0, Total=812 [2019-11-26 20:31:58,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9335 states. [2019-11-26 20:31:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9335 to 7049. [2019-11-26 20:31:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7049 states. [2019-11-26 20:31:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7049 states to 7049 states and 28759 transitions. [2019-11-26 20:31:59,067 INFO L78 Accepts]: Start accepts. Automaton has 7049 states and 28759 transitions. Word has length 88 [2019-11-26 20:31:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:59,067 INFO L462 AbstractCegarLoop]: Abstraction has 7049 states and 28759 transitions. [2019-11-26 20:31:59,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 20:31:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 7049 states and 28759 transitions. [2019-11-26 20:31:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 20:31:59,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:59,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:59,078 INFO L410 AbstractCegarLoop]: === Iteration 46 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash 794295666, now seen corresponding path program 1 times [2019-11-26 20:31:59,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:59,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40393463] [2019-11-26 20:31:59,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:59,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40393463] [2019-11-26 20:31:59,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:59,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 20:31:59,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851152831] [2019-11-26 20:31:59,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 20:31:59,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:59,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 20:31:59,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:31:59,173 INFO L87 Difference]: Start difference. First operand 7049 states and 28759 transitions. Second operand 8 states. [2019-11-26 20:31:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:31:59,384 INFO L93 Difference]: Finished difference Result 7049 states and 28753 transitions. [2019-11-26 20:31:59,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:31:59,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-11-26 20:31:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:31:59,400 INFO L225 Difference]: With dead ends: 7049 [2019-11-26 20:31:59,400 INFO L226 Difference]: Without dead ends: 6941 [2019-11-26 20:31:59,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:31:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6941 states. [2019-11-26 20:31:59,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6941 to 6941. [2019-11-26 20:31:59,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6941 states. [2019-11-26 20:31:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6941 states to 6941 states and 28321 transitions. [2019-11-26 20:31:59,504 INFO L78 Accepts]: Start accepts. Automaton has 6941 states and 28321 transitions. Word has length 88 [2019-11-26 20:31:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:31:59,504 INFO L462 AbstractCegarLoop]: Abstraction has 6941 states and 28321 transitions. [2019-11-26 20:31:59,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 20:31:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 6941 states and 28321 transitions. [2019-11-26 20:31:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 20:31:59,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:31:59,515 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:31:59,515 INFO L410 AbstractCegarLoop]: === Iteration 47 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:31:59,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:31:59,515 INFO L82 PathProgramCache]: Analyzing trace with hash 755142612, now seen corresponding path program 1 times [2019-11-26 20:31:59,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:31:59,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496359756] [2019-11-26 20:31:59,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:31:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:31:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:31:59,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496359756] [2019-11-26 20:31:59,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:31:59,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-26 20:31:59,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635496899] [2019-11-26 20:31:59,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 20:31:59,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:31:59,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 20:31:59,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:31:59,698 INFO L87 Difference]: Start difference. First operand 6941 states and 28321 transitions. Second operand 10 states. [2019-11-26 20:32:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:32:00,140 INFO L93 Difference]: Finished difference Result 6941 states and 28273 transitions. [2019-11-26 20:32:00,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:32:00,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-11-26 20:32:00,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:32:00,155 INFO L225 Difference]: With dead ends: 6941 [2019-11-26 20:32:00,155 INFO L226 Difference]: Without dead ends: 6446 [2019-11-26 20:32:00,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-11-26 20:32:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6446 states. [2019-11-26 20:32:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6446 to 6446. [2019-11-26 20:32:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6446 states. [2019-11-26 20:32:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6446 states to 6446 states and 26161 transitions. [2019-11-26 20:32:00,257 INFO L78 Accepts]: Start accepts. Automaton has 6446 states and 26161 transitions. Word has length 88 [2019-11-26 20:32:00,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:32:00,258 INFO L462 AbstractCegarLoop]: Abstraction has 6446 states and 26161 transitions. [2019-11-26 20:32:00,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 20:32:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 6446 states and 26161 transitions. [2019-11-26 20:32:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 20:32:00,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:32:00,267 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:32:00,267 INFO L410 AbstractCegarLoop]: === Iteration 48 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:32:00,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:32:00,268 INFO L82 PathProgramCache]: Analyzing trace with hash -329848485, now seen corresponding path program 1 times [2019-11-26 20:32:00,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:32:00,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426959953] [2019-11-26 20:32:00,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:32:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:32:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:32:00,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426959953] [2019-11-26 20:32:00,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:32:00,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-26 20:32:00,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026961063] [2019-11-26 20:32:00,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 20:32:00,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-26 20:32:00,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 20:32:00,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:32:00,366 INFO L87 Difference]: Start difference. First operand 6446 states and 26161 transitions. Second operand 8 states. [2019-11-26 20:32:00,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:32:00,549 INFO L93 Difference]: Finished difference Result 6446 states and 26155 transitions. [2019-11-26 20:32:00,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:32:00,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-11-26 20:32:00,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:32:00,562 INFO L225 Difference]: With dead ends: 6446 [2019-11-26 20:32:00,562 INFO L226 Difference]: Without dead ends: 5213 [2019-11-26 20:32:00,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-26 20:32:00,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5213 states. [2019-11-26 20:32:00,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5213 to 5213. [2019-11-26 20:32:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5213 states. [2019-11-26 20:32:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5213 states to 5213 states and 21079 transitions. [2019-11-26 20:32:00,646 INFO L78 Accepts]: Start accepts. Automaton has 5213 states and 21079 transitions. Word has length 88 [2019-11-26 20:32:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:32:00,647 INFO L462 AbstractCegarLoop]: Abstraction has 5213 states and 21079 transitions. [2019-11-26 20:32:00,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 20:32:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5213 states and 21079 transitions. [2019-11-26 20:32:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-26 20:32:00,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:32:00,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:32:00,654 INFO L410 AbstractCegarLoop]: === Iteration 49 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2019-11-26 20:32:00,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:32:00,655 INFO L82 PathProgramCache]: Analyzing trace with hash -14930375, now seen corresponding path program 1 times [2019-11-26 20:32:00,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-26 20:32:00,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802656366] [2019-11-26 20:32:00,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 20:32:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 20:32:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 20:32:00,745 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-26 20:32:00,745 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 20:32:00,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 08:32:00 BasicIcfg [2019-11-26 20:32:00,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 20:32:00,869 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 20:32:00,869 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 20:32:00,869 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 20:32:00,870 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:30:09" (3/4) ... [2019-11-26 20:32:00,872 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 20:32:00,974 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-26 20:32:00,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 20:32:00,976 INFO L168 Benchmark]: Toolchain (without parser) took 112584.47 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 955.0 MB in the beginning and 987.6 MB in the end (delta: -32.6 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-11-26 20:32:00,976 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:32:00,977 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -121.3 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-11-26 20:32:00,977 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-26 20:32:00,977 INFO L168 Benchmark]: Boogie Preprocessor took 31.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:32:00,978 INFO L168 Benchmark]: RCFGBuilder took 568.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-11-26 20:32:00,978 INFO L168 Benchmark]: TraceAbstraction took 110961.02 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -15.1 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-11-26 20:32:00,978 INFO L168 Benchmark]: Witness Printer took 105.70 ms. Allocated memory is still 4.6 GB. Free memory was 1.1 GB in the beginning and 987.6 MB in the end (delta: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. [2019-11-26 20:32:00,980 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 843.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -121.3 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 568.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 110961.02 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -15.1 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 105.70 ms. Allocated memory is still 4.6 GB. Free memory was 1.1 GB in the beginning and 987.6 MB in the end (delta: 66.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1088]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1089] 0 char *v; VAL [v={0:0}] [L1122] 0 pthread_t t; VAL [v={0:0}] [L1123] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1107] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, v={0:0}] [L1124] 0 \read(t) VAL [arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, v={0:0}] [L1107] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={0:0}] [L1108] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={0:0}] [L1109] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={0:0}] [L1092] 2 v = malloc(sizeof(char)) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1093] 2 return 0; VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1109] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1110] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1097] 3 v[0] = 'X' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1098] 3 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1111] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 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}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1112] FCALL, FORK 1 pthread_create(&t4, 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))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1097] 5 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1098] 5 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1113] 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))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1097] 6 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1102] 4 v[0] = 'Y' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1103] 4 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1098] 6 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1114] 1 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1114] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1115] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1115] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1116] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1116] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1117] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1117] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1118] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t1={9:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1118] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t2={10:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1118] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t3={11:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1118] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t4={12:0}, t5={6:0}, v={1:0}] [L1118] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, t5={6:0}, v={1:0}] [L1118] 1 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, v={1:0}] [L1124] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, v={1:0}] [L1125] 0 v[0] VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, v={1:0}] [L1088] COND TRUE 0 !expression VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, v={1:0}] [L1088] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={1:0}, v={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 92 locations, 1 error locations. Result: UNSAFE, OverallTime: 110.4s, OverallIterations: 49, TraceHistogramMax: 1, AutomataDifference: 58.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9211 SDtfs, 22609 SDslu, 37290 SDs, 0 SdLazy, 16858 SolverSat, 2876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1188 GetRequests, 152 SyntacticMatches, 65 SemanticMatches, 971 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4138 ImplicationChecksByTransitivity, 34.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47313occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 31.7s AutomataMinimizationTime, 48 MinimizatonAttempts, 255659 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 2604 NumberOfCodeBlocks, 2604 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2468 ConstructedInterpolants, 0 QuantifiedInterpolants, 1877096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...